Complexity of quantum impurity problems
Sergey Bravyi, David Gosset

TL;DR
This paper presents a quasi-polynomial time classical algorithm for estimating ground state energies of quantum impurity models, enabling efficient low-energy state computation and analysis of their properties.
Contribution
The authors introduce a novel classical algorithm for impurity models that approximates ground energies and constructs low-energy states with superpositions of Gaussian states, advancing simulation capabilities.
Findings
Algorithm achieves ground energy approximation with additive error 2^{-b} in time n^3 exp(O(b^3))
Eigenvalues of ground state covariance matrices decay exponentially, depending mildly on spectral gap
Benchmarking on the single impurity Anderson model demonstrates practical effectiveness
Abstract
We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem called an impurity. The full system consists of fermionic modes and has a Hamiltonian , where is quadratic in creation-annihilation operators and is an arbitrary Hamiltonian acting on a subset of modes. We show that the ground energy of can be approximated with an additive error in time . Our algorithm also finds a low energy state that achieves this approximation. The low energy state is represented as a superposition of fermionic Gaussian states. To arrive at this result we prove several theorems concerning exact ground states of impurity models. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
