Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
复制标题
DOI：
10.1103/physrevlett.83.5162
复制
发表时间：
1999-12-13
影响因子：
8.6
通讯作者：
Lloyd, S
中科院分区：
文献类型：
--
作者：
Abrams, DS;Lloyd, S
我们描述了一个新的多项式时间量子算法，使用量子快速傅立叶变换找到本地哈密顿的本征值和本征向量，并可以应用在所有已知的经典算法需要指数时间的情况下（通常发现在从头算物理和化学问题）。被认为是具体问题的算法的应用，我们发现，经典的棘手和有趣的问题，从原子物理可以解决50至100量子位。
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.