.png){kind=icon}
.png){kind=icon}
Return
Calculating unknown eigenvalues with a quantum algorithm
.png){kind=icon}
PRE
AI
DOI：10.1038/NPHOTON.2012.360.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A quantum algorithm solves computational tasks using fewer physical resources than the best-known classical algorithm. Of most interest are those for which an exponential reduction is achieved. The key example is the phase estimation algorithm, which provides the quantum speedup in Shor's factoring algorithm and quantum simulation algorithms. To date, fully quantum experiments of this type have demonstrated only the read-out stage of quantum algorithms, but not the steps in which input data is read in and processed to calculate the final quantum state. Indeed, knowing the answer beforehand was essential. We present a photonic demonstration of a full quantum algorithm-the iterative phase estimation algorithm (IPEA)-without knowing the answer in advance. This result suggests practical applications of the phase estimation algorithm, including quantum simulations and quantum metrology in the near term, and factoring in the long term.
Keywords:
NUCLEAR-MAGNETIC-RESONANCE
FACTORING ALGORITHM
ENTANGLEMENT
COMPUTATION
CIRCUITS
STATE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
32.9
Papers:
4.3K
Citations:
6.1W