Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation
- 19 December 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 91 (25) , 257902
Abstract
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schrödinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quantum mechanically, an approximation of the same eigenvector on a fine grid. We use this approximation as the initial state for the eigenvalue estimation algorithm, and show the relationship between its success probability and the size of the coarse grid.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Quantum amplitude amplification and estimation2002
- Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and EigenvectorsPhysical Review Letters, 1999
- Simulating quantum systems on a quantum computerProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Universal Quantum SimulatorsScience, 1996