Quantum techniques for eigenvalue problems
arXiv:2307.03889 · doi:10.1140/epja/s10050-023-01183-5
Abstract
This article is a brief introduction to quantum algorithms for the eigenvalue problem in quantum many-body systems. Rather than a broad survey of topics, we focus on providing a conceptual understanding of several quantum algorithms that cover the essentials of adiabatic evolution, variational methods, phase detection algorithms, and several other approaches. For each method, we discuss the potential advantages and remaining challenges.
final publication version of invited article for EPJ A Topical Issue "Quantum computing in low-energy nuclear theory"
References in corpus (8)
- Optimal Quantum Phase Estimation
- Bounds for the adiabatic approximation with applications to quantum computation
- How Powerful is Adiabatic Quantum Computation?
- A Cyclic Cooling Algorithm
- Prediction of the neutron drip line in oxygen isotopes using quantum computation
- Nuclear deformation at finite temperature
- Floating block method for quantum Monte Carlo simulations
- Subspace Diagonalization on Quantum Computers using Eigenvector Continuation