Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors

dc.contributor.authorSkosana, Unathien_ZA
dc.contributor.authorTame, Marken_ZA
dc.date.accessioned2023-04-04T07:04:02Z
dc.date.available2023-04-04T07:04:02Z
dc.date.issued2021-08-16
dc.descriptionCITATION: Skosana, U. & Tame, M. 2021. Demonstration of Shor's factoring algorithm for N = 21 on IBM quantum processors. Scientific Reports, 11:16599, doi:10.1038/s41598-021-95973-w.en_ZA
dc.descriptionThe original publication is available at https://www.nature.comen_ZA
dc.description.abstractWe report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration. We go beyond this work by using a configuration of approximate Toffoli gates with residual phase shifts, which preserves the functional correctness and allows us to achieve a complete factoring of N=21 . We implemented the algorithm on IBM quantum processors using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm’s speedup in general. The techniques we employ may be useful in carrying out Shor’s algorithm for larger integers, or other algorithms in systems with a limited number of noisy qubits.en_ZA
dc.description.urihttps://www.nature.com/articles/s41598-021-95973-w
dc.description.versionPublisher's versionen_ZA
dc.format.extent12 pages : illustrationsen_ZA
dc.identifier.citationSkosana, U. & Tame, M. 2021. Demonstration of Shor's factoring algorithm for N = 21 on IBM quantum processors. Scientific Reports, 11:16599, doi:10.1038/s41598-021-95973-w.en_ZA
dc.identifier.issn2045-2322 (online)
dc.identifier.otherdoi:10.1038/s41598-021-95973-w
dc.identifier.urihttp://hdl.handle.net/10019.1/126768
dc.language.isoen_ZAen_ZA
dc.publisherNatureen_ZA
dc.rights.holderAuthors retain copyrighten_ZA
dc.subjectAlgorithmsen_ZA
dc.subjectQuantum theoryen_ZA
dc.subjectQuantum Physicsen_ZA
dc.subjectShor’s algorithmen_ZA
dc.subjectIBM quantum processorsen_ZA
dc.titleDemonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processorsen_ZA
dc.typeArticleen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
skosana_demonstration_2021.pdf
Size:
3.32 MB
Format:
Adobe Portable Document Format
Description:
Download article
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: