Certified algorithms for equilibrium states of local quantum Hamiltonians

Abstract

Predicting observables in equilibrium states is a central yet notoriously hard question in quantum many-body systems. In the physically relevant thermodynamic limit, certain mathematical formulations of this task have even been shown to result in undecidable problems. Using a finite-size scaling of algorithms devised for finite systems often fails due to the lack of certified convergence bounds for this limit. In this work, we design certified algorithms for computing expectation values of observables in the equilibrium states of local quantum Hamiltonians, both at zero and positive temperature. Importantly, our algorithms output rigorous lower and upper bounds on these values. This allows us to show that expectation values of local observables can be approximated in finite time, contrasting related undecidability results. When the Hamiltonian is commuting on a 2-dimensional lattice, we prove fast convergence of the hierarchy at high temperature and as a result for a desired precision $\epsilon$, local observables can be approximated by a convex optimization program of quasi-polynomial size in $1/\epsilon$.

References in corpus (26)

• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• The Conformal Bootstrap: Theory, Numerical Techniques, and Applications
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Quantum Metropolis Sampling
• Undecidability of the Spectral Gap (short version)
• Solving Gapped Hamiltonians Locally
• The problem of equilibration and the computation of correlation functions on a quantum computer
• Hamiltonian complexity
• Approximating Gibbs states of local Hamiltonians efficiently with PEPS
• Convergent relaxations of polynomial optimization problems with non-commuting variables
• Semidefinite approximations of the matrix logarithm
• Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
• Improved thermal area law and quasi-linear time algorithm for quantum Gibbs states
• Markov entropy decomposition: a variational dual for quantum belief propagation
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Thermal State Preparation via Rounding Promises
• Solving condensed-matter ground-state problems by semidefinite relaxations
• Lower Bounds for Ground States of Condensed Matter Systems
• Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
• On the complexity of quantum partition functions
• Lower Bounding Ground-State Energies of Local Hamiltonians Through the Renormalization Group
• Efficient Algorithms for Approximating Quantum Partition Functions
• Uncomputability of Phase Diagrams
• Certifying ground-state properties of quantum many-body systems
• Entropy Constraints for Ground Energy Optimization
• A subpolynomial-time algorithm for the free energy of one-dimensional quantum systems in the thermodynamic limit

Cited by in corpus (7)

• Bootstrapping the Quantum Hall problem
• Certifying steady-state properties of open quantum systems
• Mapping Phase Diagrams of Quantum Spin Systems through Semidefinite-Programming Relaxations
• High-Precision Bootstrap of Multimatrix Quantum Mechanics
• Bootstrapping Flat-band Superconductors: Rigorous Lower Bounds on Superfluid Stiffness
• Efficient and simple Gibbs state preparation of the 2D toric code via duality to classical Ising chains
• Bootstrapping Nonequilibrium Stochastic Processes