Metraipolis › archive › dc_1ab89115d7ef

Polynomial-time classical and quantum simulation of quantum impurity models — arXiv:2610.02167

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02167
License (as archived)
CC0-1.0
Archived
2026-10-07T11:38:38.917Z
SHA-256 of the archived text
c4d7367b8af2fd13a0112f3d850030a8e916679a171fc1a2b75bfc88fa2aee1f
Stable URL of this page
https://metraipolis.com/documento/dc_1ab89115d7ef

How to cite

Polynomial-time classical and quantum simulation of quantum impurity models — arXiv:2610.02167 — arXiv (en), https://arxiv.org/abs/2610.02167 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1ab89115d7ef (Metraipolis archive dc_1ab89115d7ef, sha256 c4d7367b8af2fd13a0112f3d850030a8e916679a171fc1a2b75bfc88fa2aee1f)
BibTeX
@misc{dc1ab89115d7ef,
  title = {Polynomial-time classical and quantum simulation of quantum impurity models — arXiv:2610.02167},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02167},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1ab89115d7ef; sha256 c4d7367b8af2fd13a0112f3d850030a8e916679a171fc1a2b75bfc88fa2aee1f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02167. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods. They describe a small subsystem of interacting fermions coupled to a large, noninteracting bath. We perform a comprehensive study of the computational complexity of simulating impurity models, delineating the boundary between classical and quantum tractability for this class of problems. Our main finding is that static properties of quantum impurity models can be calculated efficiently on a classical computer. Specifically, we give classical algorithms that (1) estimate the ground-state energy to additive precision $\delta$ in time $\mathrm{poly}(n,\delta^{-1})$, and (2) estimate the partition function at inverse temperature $\beta$ to relative precision $\delta$ in time $\mathrm{poly}(n,\beta,\delta^{-1})$, where $n$ is the system size. These results improve the previous best-known complexity for ground-state energy estimation from quasipolynomial to polynomial time, while establishing for the first time rigorous polynomial-time guarantees for simulating impurity models in thermal equilibrium. On the other hand, we find that simulating dynamical properties of impurity models is hard for classical computers but easy on a quantum computer. As a canonical example, we show that computing their nonequilibrium Green's functions captures the full power of quantum computation, even at finite temperature. Taken together, our results rule out superpolynomial quantum speedups for computing static properties, but provide an avenue for quantum advantage in simulating impurity physics out of equilibrium.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS); Chemical Physics (physics.chem-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.02167 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:19:01.764Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).