arXiv:2610.06667
Quantum Gibbs State Preparation via Relative Decoding: From Fast-Mixing Sources to Broader Target Classes
Zhong-Xia Shang, Yufei Wang, Daniel Stilck França
Abstract
Provable guarantees for preparing quantum Gibbs states, such as rapid mixing or gapped coherent preparation paths, are known only for restricted Hamiltonian families and usually must be re-derived for each new family. Building on homomorphic polynomial transduction, a generalization of decoded quantum interferometry (DQI) and Hamiltonian DQI (HDQI), we show how relative decoding transfers such a guarantee from a source Hamiltonian $H_A$ to a target $H_B$. Writing each Hamiltonian as a sum of $m$ Pauli terms, the subsets of terms whose product is proportional to the identity, its relations, form a binary linear code, $K_A$ for the source and $K_B$ for the target, with the Pauli-label matrix as parity-check matrix as in DQI. Starting from the canonical thermofield double (TFD) of $H_A$, a Bell transform, a reversible label map, and a coherent decoder for the quotient code $K_B/K_A$ prepare an approximate TFD of $H_B$, and hence its Gibbs state. Because this decoder only resolves target relations absent from the source, the reachable inverse temperature is set by the relative distance $d_{\rm rel}$, the fewest terms in any such relation. It can far exceed the ordinary distance $d_{\rm ord}$, the fewest terms in any target relation, which bounds the uniform exact decoding radius of DQI and HDQI. We show that linear $d_{\rm rel}$ with efficient decoding at linear radius certifies a constant inverse temperature. As an example, starting from a nearest-neighbor spin chain whose TFD is known to be preparable at every finite temperature, a sparse classical parity-check matrix yields bounded-degree, geometrically nonlocal, noncommuting targets with $d_{\rm ord}=3$ and $d_{\rm rel}=Θ(m)$. To our knowledge, this gives a new class of efficiently preparable TFDs.
AI Summary
The paper asks when an efficient quantum Gibbs-state preparation guarantee can be transferred from a source Hamiltonian to a different target, without analyzing target mixing dynamics. It specializes the companion framework of homomorphic polynomial transduction to Pauli Hamiltonians and develops its thermal application. For Hamiltonians with matched term magnitudes, identical anticommutation patterns, nested relation codes $K_A\subseteq K_B$, and compatible signed relation phases, a Bell-basis circuit converts source polynomial-filtered purifications into target ones. The decoder recovers only the source label, rather than the full term-selection vector. Exact conversion at degree $D$ requires $2D<d_{\rm rel}$, where $d_{\rm rel}=\min_{c\in K_B\setminus K_A}|c|$, potentially exceeding the ordinary target-code distance. Polynomial approximation then gives target-TFD trace-distance error $\delta_{\rm src}+2\eta+\delta_{\rm circ}$ when the decoding degree is at least $\beta\Lambda+O(\sqrt{\beta\Lambda\log(1/\eta)}+\log(1/\eta))$, with $\Lambda\ge\|H_A\|$. The explicit construction starts from a bounded-strength nearest-neighbor chain with an efficiently preparable canonical TFD and replaces classical spins by parities specified by a classical code. With $m=5N-1$ terms, it has ordinary distance $3$, relative distance $d_F=\Theta(N)$, and efficient decoding through $\lfloor\tau N\rfloor$. This certifies polynomial-time target preparation for fixed $\beta<\tau/(5J_0)$, including inverse-polynomial accuracy. Sparse checks give bounded-weight, bounded-degree, geometrically nonlocal targets. The guarantees require canonical source-TFD access and efficient relative decoding; distance alone does not ensure efficient decoding. Classical sampling hardness and advantages over direct target preparation or specified target dynamics remain open.
ChatGPT 5.6 Sol, ChatGPT 6 Astra were used for formulations and for helping the authors realize that relative decoding is what is needed at the uncomputation stage.
Error found: The abstract omits the equal-anticommutation and signed-relation compatibility assumptions needed to transfer source-TFD preparation to the target. The abstract's linear-decoding-radius temperature claim omits the extensive spectral-bound assumption needed for a system-size-independent certified inverse-temperature window.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 60 pages, 1 figure. Update review of previous works