Demonstration of Shor’s factoring algorithm for N $$=$$ = 21 on IBM quantum processors
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 configu...
Main Authors: | Unathi Skosana, Mark Tame |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2021-08-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-021-95973-w |
Similar Items
-
Author Correction: Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
by: Unathi Skosana, et al.
Published: (2023-03-01) -
Author Correction: Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
by: Unathi Skosana, et al.
Published: (2023-01-01) -
Quasi-Shor Algorithms for Global Benchmarking of Universal Quantum Processors
by: Genting Dai, et al.
Published: (2022-12-01) -
Quantum computation and Shor's factoring algorithm
by: Ekert, A, et al.
Published: (1996) -
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
by: Dennis Willsch, et al.
Published: (2023-10-01)