Quantum impurity models: easy at equilibrium, universal in motion
Abstract
A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be efficiently approximated by classical means, whereas time evolution can implement a universal quantum computation. More precisely, let $H$ be the Hamiltonian of an impurity model with $...
Description / Details
A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be efficiently approximated by classical means, whereas time evolution can implement a universal quantum computation. More precisely, let be the Hamiltonian of an impurity model with fermionic modes and a constant-size impurity. We show that: (1) the ground energy of can be approximated to additive error by a classical algorithm with runtime , improving on the quasi-polynomial runtime of the best previously known algorithm; (2) at inverse temperature , the Helmholtz free energy and a classical description of the thermofield double state can be computed to precision in time ; (3) simulating the time evolution is -complete, for that is time-independent and has a fixed, constant impurity size. Our algorithms exploit exponential suppression of multi-particle bath excitations in a basis organized by energy scale and Krylov depth. Our universality construction realizes a stationary quantum processor whose program arrives in a stream of freely propagating fermions.
Source: arXiv:2610.02130v1 - http://arxiv.org/abs/2610.02130v1 PDF: https://arxiv.org/pdf/2610.02130v1 Original Link: http://arxiv.org/abs/2610.02130v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 2, 2026
Quantum Computing
Quantum Physics
0