Certified algorithms for equilibrium states of local quantum Hamiltonians
Published version
Peer-reviewed
Repository URI
Repository DOI
Type
Change log
Authors
Abstract
jats:titleAbstract</jats:title>jats:pPredicting 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 jats:italicε</jats:italic>, local observables can be approximated by a convex optimization program of quasi-polynomial size in 1/jats:italicε</jats:italic>.</jats:p>
Description
Acknowledgements: We thank Daniel Stilck França for the helpful discussions. H.F. acknowledges funding from UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding guarantee EP/X032051/1. O.F. acknowledges funding by the European Research Council (ERC Grant AlgoQIP, Agreement No. 851716) as well as by the European Union’s Horizon 2020 within the QuantERA II Program under Grant VERIqTAS Agreement No 101017733. S.O.S. acknowledges support from the UK Engineering and Physical Sciences Research Council (EPSRC) under grant number EP/W524141/1.