Experimental realization of Shor's quantum factoring algorithm using qubit recycling
By E. Martin-Lopez, Anthony Laing, T. Lawson, R. Alvarez, Xiaoqi Zhou, Jeremy Lloyd O'Brien. Nature Photonics, 2011
351 citations recorded by the source corpus.
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms1,2,3. Shor's quantum algorithm4 for fast number factoring is a key example and the prime motivator in the international effort to realize a quantum computer5. However, due to the substantial resource requirement, to date there have been only four small-scale demonstrations6,7,8,9. Here, we address this resource demand and demonstrate a scalable version of Shor's algorithm in which the n-qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one-third of that required in the standard protocol10,11. Encoding the work register in higher-dimensional states, we implement a two-photon compiled algorithm to factor N = 21. The algorithmic output is distinguishable from noise, in contrast to previous demonstrations. These results point to larger-scale implementations of Shor's algorithm by harnessing scalable resource reductions applicable to all physical architectures. By using qubit recycling, researchers demonstrate a scalable version of Shor's algorithm in which the total number of qubits is one third of that required in the standard protocol. They experimentally implemented a two-photon compiled algorithm to factor N = 21, pointing to larger-scale implementations of Shor's algorithm.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/cad2736ff0869e8674144b3816486c41118e4003
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
Citations in the corpus
- Spontaneous parametric down-conversion (2018, methodology): “Using SPDC, it has been used to implement basic concepts in quantum processing through the proof of CNOT gates [15], Shor’s algorithm [38], one-way quantum computation [39] or boson sampling type of gates [40].”