Energy Spectra of Compressed Quantum States
arXiv:2507.07191 · doi:10.1103/q5fz-4hzy
Abstract
Quantum algorithms for estimating the ground state energy of a quantum system often operate by preparing a classically accessible quantum state and then applying quantum phase estimation. Whether this approach yields quantum advantage hinges on the state's energy spectrum, that is, the sequence of the state's overlaps with the energy eigenstates of the system Hamiltonian. We show that the energy spectrum of any entanglement-compressed quantum state must have large support if most energy eigenstates are highly entangled, an assumption supported by the eigenstate thermalization hypothesis. Furthermore, we show that if the compressed quantum state minimizes expected energy, then its energy spectrum decays with the inverse-squared energy eigenvalues under a convex relaxation of the compression constraint. This explains the main empirical finding of Silvester, Carleo, and White (Physical Review Letters, 2025) that the energy spectra of matrix product states do not decay exponentially.
13 pages; v2: published version
References in corpus (50)
- The density-matrix renormalization group in the age of matrix product states
- Chaos and Quantum Thermalization
- Entanglement Spectrum as a Generalization of Entanglement Entropy: Identification of Topological Order in Non-Abelian Fractional Quantum Hall Effect States
- Entanglement entropy and conformal field theory
- Quantum computational chemistry
- Average Entropy of a Subsystem
- Quantum Chemistry in the Age of Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- An Area Law for One Dimensional Quantum Systems
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Quantum algorithms for quantum chemistry and quantum materials science
- Elucidating Reaction Mechanisms on Quantum Computers
- Matrix product states represent ground states faithfully
- Probing entanglement entropy via randomized measurements
- Eigenstate Thermalization Hypothesis
- Tensor networks for complex quantum systems
- Entropy scaling and simulability by Matrix Product States
- Quantum computing enhanced computational catalysis
- Does a single eigenstate encode the full Hamiltonian?
- Is there evidence for exponential quantum advantage in quantum chemistry?
- A perspective on the current state-of-the-art of quantum computing for drug discovery applications
- Near-optimal ground state preparation
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Entanglement Entropy of Eigenstates of Quadratic Fermionic Hamiltonians
- Sequential Generation of Matrix-Product States in Cavity QED
- Drug design on quantum computers
- Preparing ground states of quantum many-body systems on a quantum computer
- Entanglement Entropy of the Two-Dimensional Heisenberg Antiferromagnet
- Preparation of matrix product states with log-depth quantum circuits
- The Entanglement of Superpositions
- Spectra and eigenstates of spin chain Hamiltonians
- Rigorous RG algorithms and area laws for low energy eigenstates in 1D
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- Tensor Network Python (TeNPy) version 1
- Initial state preparation for quantum chemistry on quantum computers
- An area law for 2D frustration-free spin systems
- Eigenstate entanglement: Crossover from the ground state to volume laws
- Rapid initial state preparation for the quantum simulation of strongly correlated molecules
- Reexamination of entanglement of superpositions
- Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
- Entanglement accelerates quantum simulation
- Eigenstate entanglement scaling for critical interacting spin chains
- Entanglement of subspaces in terms of entanglement of superpositions
- Dissipative Preparation of Many-Body Quantum States: Towards Practical Quantum Advantage
- Classical and Quantum Algorithms for Tensor Principal Component Analysis
- Sparse random Hamiltonians are quantumly easy
- Quartic quantum speedups for planted inference
- Beating the natural Grover bound for low-energy estimation and state preparation
- Effective temperature in approximate quantum many-body states