arXiv:2609.39674
Polylog-depth Quantum Thermal Simulation via Local Recovery Channels
Hideaki Hakoshima, Atsushi Iwaki, Nobuyuki Yoshioka
Abstract
We establish sufficient conditions for preparing quantum thermal states of noncommuting local Hamiltonians with polylogarithmic circuit depth in arbitrary fixed spatial dimension. Our conditions combine locality and stability bounds on the effective interactions of reduced density matrices of a Gibbs state with a quantitative high-temperature condition and access to coarse classical reference Hamiltonians. When these references can be generated locally, the classical preprocessing cost is $N^{1+o(1)}$ for $N$ sites at inverse-polynomial global accuracy. We construct the preparation circuit from spatially localized Petz recovery maps. Quantum corrections derived from the microscopic Hamiltonian enable accurate recovery while the classical references remain coarse. After preprocessing, the resulting circuit prepares the canonical purification using $N\operatorname{polylog}(N/\varepsilon)$ gates and qubits, where $\varepsilon$ is the preparation error. These results link two fundamental questions: how correlations are organized in thermal equilibrium, and how efficiently the corresponding states can be realized through operations allowed by quantum mechanics. By translating static equilibrium structure into explicit preparation circuits, they give equilibrium locality a constructive computational interpretation and a physically grounded role in quantum algorithm design.
AI Summary
The paper asks when spatial locality of thermal correlations can be converted into elementary-gate circuits for preparing Gibbs states of noncommuting local Hamiltonians. It gives a conditional construction on bounded-degree graphs with polynomial volume growth in any fixed spatial dimension $D$, targeting the canonical purification rather than only the mixed state. The assumptions are exponentially decaying effective interactions for Gibbs marginals, stability of their coefficients under changes of retained regions, a quantitative high-temperature bound, and supplied coarse classical approximations to marginal Hamiltonians. Under these conditions, input-independent preprocessing produces a preparation unitary with vector error $\varepsilon$, depth $\operatorname{polylog}(N/\varepsilon)$, and $N\operatorname{polylog}(N/\varepsilon)$ gates and qubits. If the reference lists admit the stipulated local generation procedure, classical preprocessing costs $N^{1+o(1)}$ at inverse-polynomial global accuracy. The construction localizes ordinary Petz recovery to patches of radius $O(\log(N/\varepsilon))$, containing $O(\log^D(N/\varepsilon))$ sites. Exact Petz composition supplies coherent assembly; graph coloring permits parallel recovery. Efficient patch implementation combines coarse classical references with quantum corrections retaining the microscopic Gibbs information, imaginary-time locality bounds, and a bounded-function integral implemented using LCU and QSVT. The principal limitation is that simultaneous effective-interaction bounds for arbitrary, potentially disconnected retained sets remain explicit hypotheses for general noncommuting models; high temperature alone is not shown to imply them. Reference generation is also separately assumed. Extensions to lower temperatures, constrained higher-dimensional fermionic encodings, and regimes exhibiting quantum sampling advantage are left open.
They were also used extensively to draft and revise the entire manuscript, including the mathematical proofs.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 33 pages, 1 figure