A penalty-free quantum algorithm to find energy eigenstates
arXiv:2509.09148 · doi:10.1103/25rr-mpyj
Abstract
Finding eigenstates of a given many-body Hamiltonian is a long-standing challenge due to the perceived computational complexity. Leveraging on the hardware of a quantum computer accommodating the exponential growth of the Hilbert space size with the number of qubits, more quantum algorithms to find the eigenstates of many-body Hamiltonians will be of wide interest with profound implications and applications. In this work, we advocate a quantum algorithm to find the ground state and excited states of many-body systems, without any penalty functions, variational steps or hybrid quantum-classical steps. Our fully quantum algorithm will be an important addition to the quantum computational toolbox to tackle problems intractable on classical machines.
14 pages, 5 figures
References in corpus (39)
- Topological insulators and superconductors
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Ising formulations of many NP problems
- Barren plateaus in quantum neural network training landscapes
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Adiabatic Quantum Computing
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- The Variational Quantum Eigensolver: a review of methods and best practices
- Quantum annealing with more than one hundred qubits
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Perspectives of quantum annealing: Methods and implementations
- Variational Quantum Computation of Excited States
- Low-temperature thermodynamics with quantum coherence
- Subspace-search variational quantum eigensolver for excited states
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Variational quantum algorithms for discovering Hamiltonian spectra
- Barren Plateaus in Variational Quantum Computing
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Real- and imaginary-time evolution with compressed quantum circuits
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Near-optimal ground state preparation
- Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
- Hardware-efficient variational quantum algorithms for time evolution
- Digital quantum simulation of open quantum systems using quantum imaginary time evolution
- Decoding quantum errors with subspace expansions
- Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
- Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation
- Exact and efficient Lanczos method on a quantum computer
- Steady States of Infinite-Size Dissipative Quantum Chains via Imaginary Time Evolution
- Imaginary Time Propagation on a Quantum Chip
- Variational quantum eigensolvers for sparse Hamiltonians
- Projection algorithm for state preparation on quantum computers
- Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
- Fault-tolerant quantum algorithms for quantum molecular systems: A survey
- Quantum computing quantum Monte Carlo algorithm
- Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
- Filter-enhanced adiabatic quantum computing on a digital quantum processor
- Tangent Space Excitation Ansatz for Quantum Circuits