Quantum Algorithm For Estimating Eigenvalue
arXiv:2211.06179 · doi:10.1016/j.physleta.2023.129138
Abstract
A majority of numerical scientific computation relies heavily on handling and manipulating matrices, such as solving linear equations, finding eigenvalues and eigenvectors, and so on. Many quantum algorithms have been developed to advance these computational tasks, and in some cases, such as solving linear equations, can be shown to yield exponential speedup. Here, employing the techniques in the HHL algorithm and the ideas of the classical power method, we provide a simple quantum algorithm for estimating the largest eigenvalue in magnitude of a given Hermitian matrix. As in the case of the HHL algorithm, our quantum procedure can also yield exponential speedup compared to classical algorithms that solve the same problem. We also discuss a few possible extensions and applications of our quantum algorithm, such as a version of a hybrid quantum-classical Lanczos algorithm.
References in corpus (23)
- Quantum algorithm for solving linear systems of equations
- Supervised learning with quantum enhanced feature spaces
- Quantum Circuit Learning
- Quantum Amplitude Amplification and Estimation
- Quantum principal component analysis
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Evaluating analytic gradients on quantum hardware
- Circuit-centric quantum classifiers
- Hamiltonian Simulation by Qubitization
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Efficient quantum algorithms for simulating sparse Hamiltonians
- The quest for a Quantum Neural Network
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Quantum Data Fitting
- Quantum-state preparation with universal gate decompositions
- Quantum algorithms for algebraic problems
- Preconditioned quantum linear system algorithm
- A quantum linear system algorithm for dense matrices
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Finding matrix product state representations of highly-excited eigenstates of many-body localized Hamiltonians