Phys. Rev. Lett. 83, 5162–5165 (1999)Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and EigenvectorsReceived 27 July 1998; published in the issue dated 13 December 1999 We describe a new polynomial time quantum algorithm that uses the quantum fast Fourier transform to find eigenvalues and eigenvectors of a local Hamiltonian, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits. © 1999 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.83.5162
DOI:
10.1103/PhysRevLett.83.5162
PACS:
03.67.Lx, 31.15.Ar
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.