A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors

1998/07/24 by Daniel S. Abrams, Seth Lloyd · 9 citations
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physrevlett.83.5162

published as Phys.Rev.Lett.83:5162-5165,1999 · 10 pages

arxiv created 1998/07/24 · arxiv updated 2009/12/01

Abstract

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, 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.

Cited by

• STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer
• When is randomization advantageous in quantum simulation?
• Efficient quantum state preparation through seniority driven operator selection
• Coherence dynamics in quantum algorithm for linear systems of equations
• AlphaCNOT: Learning CNOT Minimization with Model-Based Planning
• Determining Molecular Ground State with Quantum Imaginary Time Evolution using Broken-Symmetry Wave Function
• Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware
• Qubit-efficient quantum chemistry with the ADAPT variational quantum eigensolver and double unitary downfolding
• Impact of molecular orbital localization on quantum computational resources for Hamiltonian simulation: A benchmark study of hydrogen chain systems