Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
dc.contributor.author | Skosana, Unathi | en_ZA |
dc.contributor.author | Tame, Mark | en_ZA |
dc.date.accessioned | 2023-04-04T07:04:02Z | |
dc.date.available | 2023-04-04T07:04:02Z | |
dc.date.issued | 2021-08-16 | |
dc.description | CITATION: 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.description | The original publication is available at https://www.nature.com | en_ZA |
dc.description.abstract | We 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.uri | https://www.nature.com/articles/s41598-021-95973-w | |
dc.description.version | Publisher's version | en_ZA |
dc.format.extent | 12 pages : illustrations | en_ZA |
dc.identifier.citation | 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.identifier.issn | 2045-2322 (online) | |
dc.identifier.other | doi:10.1038/s41598-021-95973-w | |
dc.identifier.uri | http://hdl.handle.net/10019.1/126768 | |
dc.language.iso | en_ZA | en_ZA |
dc.publisher | Nature | en_ZA |
dc.rights.holder | Authors retain copyright | en_ZA |
dc.subject | Algorithms | en_ZA |
dc.subject | Quantum theory | en_ZA |
dc.subject | Quantum Physics | en_ZA |
dc.subject | Shor’s algorithm | en_ZA |
dc.subject | IBM quantum processors | en_ZA |
dc.title | Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors | en_ZA |
dc.type | Article | en_ZA |