.png){kind=icon}
.png){kind=icon}
Return
Experimental realization of Shor's quantum factoring algorithm using qubit recycling
.png){kind=icon}
PRE
AI
DOI：10.1038/NPHOTON.2012.259.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms(1-3). Shor's quantum algorithm(4) for fast number factoring is a key example and the prime motivator in the international effort to realize a quantum computer(5). However, due to the substantial resource requirement, to date there have been only four small-scale demonstrations(6-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 protocol(10,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.
Keywords:
COMPUTATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.