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.
arXiv commentfinal publication version of invited article for EPJ A Topical Issue "Quantum computing in low-energy nuclear theory"
References in corpus (68)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- The Variational Quantum Eigensolver: a review of methods and best practices
- Fermionic quantum computation
- Towards Quantum Chemistry on a Quantum Computer
- Preparation of Entangled States by Quantum Markov Processes
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Hartree-Fock on a superconducting qubit quantum computer
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Quantum Search by Local Adiabatic Evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Optimal Quantum Phase Estimation
- Robustness of adiabatic quantum computation
- Training variational quantum algorithms is NP-hard
- Cloud Quantum Computing of an Atomic Nucleus
- Bounds for the adiabatic approximation with applications to quantum computation
- A random compiler for fast Hamiltonian simulation
- Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
- Efficient Bayesian Phase Estimation
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Algorithmic Cooling and Scalable NMR Quantum Computers
- How Powerful is Adiabatic Quantum Computation?
- Faster quantum simulation by randomization
- Estimating the gradient and higher-order derivatives on quantum hardware
- Eigenvector continuation with subspace learning
- The sign problem in Monte Carlo simulations of frustrated quantum spin systems
- Algorithms for quantum simulation at finite energies
- Quantum Krylov subspace algorithms for ground and excited state energy estimation
- A Compact Fermion to Qubit Mapping
- Lowering qubit requirements for quantum simulations of fermionic systems
- Auxiliary field diffusion Monte Carlo calculations of light and medium-mass nuclei with local chiral interactions
- Rodeo Algorithm for Quantum Computing
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Quantum computing of the Li nucleus via ordered unitary coupled clusters
- Local spin operators for fermion simulations
- Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
- Experimental Performance of a Quantum Simulator: Optimizing Adiabatic Evolution and Identifying Many-Body Ground States
- Demon-like Algorithmic Quantum Cooling and its Realization with Quantum Optics
- Improved Error-Scaling for Adiabatic Quantum State Transfer
- Preparation of excited states for nuclear dynamics on a quantum computer
- Nuclear shell-model simulation in digital quantum computers
- Accessing ground state and excited states energies in many-body system after symmetry restoration using quantum computers
- Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
- Solving hadron structures using the basis light-front quantization approach on quantum computers
- Imaginary Time Propagation on a Quantum Chip
- Randomizing multi-product formulas for Hamiltonian simulation
- A Cyclic Cooling Algorithm
- Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer
- Simulating excited states of the Lipkin model on a quantum computer
- An Alternative Approach to Quantum Imaginary Time Evolution
- Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective
- Projection algorithm for state preparation on quantum computers
- Prediction of the neutron drip line in oxygen isotopes using quantum computation
- Quantum state preparation by adiabatic evolution with customized gates
- Nuclear deformation at finite temperature
- Projected Cooling Algorithm for Quantum Computation
- Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
- Spatial, spin, and charge symmetry projections for a Fermi-Hubbard model on a quantum computer
- Iterative phase estimation
- Quantum computation of nuclear observables involving linear combination of unitary operators
- Projective Cooling for the transverse Ising model
- Floating block method for quantum Monte Carlo simulations
- Boltzmann Distributions on a Quantum Computer via Active Cooling
- Subspace Diagonalization on Quantum Computers using Eigenvector Continuation