Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation

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 Schroedinger 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.

4 pages

References in corpus (3)

• Quantum Amplitude Amplification and Estimation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Efficient Simulation of Quantum Systems by Quantum Computers

Cited by in corpus (19)

• Quantum Circuits for General Multiqubit Gates
• Simulating chemistry using quantum computers
• Introduction to Quantum Algorithms for Physics and Chemistry
• Long-range coupling and scalable architecture for superconducting flux qubits
• Quantum phase estimation for a class of generalized eigenvalue problems
• Measures of quantum computing speedup
• Reinforcement learning for semi-autonomous approximate quantum eigensolver
• A Lower Bound for Quantum Phase Estimation
• Towards Large-Scale Quantum Computation
• A high-fidelity method for a single-step $N$-bit Toffoli gate in trapped ions
• Eigenvalue Estimation of Differential Operators
• A quantum algorithm for the linear Vlasov equation with collisions
• Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem
• Efficient state initialization by a quantum spectral filtering algorithm
• General quantum phase estimation and calibration of a timepiece in a quantum dot system
• Limitations of Clustering Using Quantum Persistent Homology
• The Quantum Setting with Randomized Queries for Continuous Problems
• The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries
• Exponentially accelerated relaxation and quantum Mpemba effect in open quantum systems