arXiv:2609.39959
Haah's 3D cubic code thermalizes rapidly
Sebastian Stengele, Libor Caha, Ángela Capel, Simone Warzel
Abstract
Haah's 3D cubic code was introduced as a candidate for a self-correcting quantum memory in three dimensions, using the absence of string logical operators to obstruct thermal errors. It has been a long-standing open question whether it is a self-correcting quantum memory. Even though the memory time was explored numerically, no analytical upper bound was known. Here, we settle this question rigorously and show that the cubic code thermalizes rapidly at every positive temperature. Our proof relies on the framework of [Commun. Math. Phys. 407, 195 (2026)] to turn a decay-of-correlations condition into a modified logarithmic Sobolev inequality for the Davies generator. To the best of our knowledge, this is the first analytic proof of rapid mixing for all positive temperatures for any fracton code.
AI Summary
Haah’s cubic code has a logarithmic logical energy barrier and exhibits partial self-correction over a temperature-dependent range of sizes, but these facts do not determine its asymptotic thermal memory lifetime. This paper establishes an all-positive-temperature thermalization bound for the code under local Davies dynamics. For a periodic cubic lattice of linear size $L$ with $n=2L^3$ qubits, single-qubit $X$ and $Z$ bath couplings, and detailed-balance rates uniformly bounded away from zero at fixed inverse temperature $\beta<\infty$, the Davies generator satisfies a modified logarithmic Sobolev inequality with a size-independent constant. Consequently, the worst-case trace-distance mixing time obeys $t_{\mathrm{mix}}(\varepsilon)\leq C_\beta(\log L+\log\varepsilon^{-1})$. Contractivity under recovery gives an $O_\beta(\log L)$ upper bound on passive-memory time, irrespective of the final decoder, excluding asymptotic polynomial lifetime growth at fixed positive temperature. The proof applies an existing framework converting a Dobrushin–Shlosman boundary-correlation condition into entropy tensorization and then a uniform Sobolev bound. The new geometric estimates control kernels of restricted check maps: their dimensions scale at most linearly with box side lengths, while configurations reaching distance $\ell$ have weight at least $\min\{\ell^2,L_{\min}^2\}/100$. Cancellations in a Gibbs-state expansion yield boundary-correlation decay $Ke^{-\gamma d^2}$ for separations $d\geq L_{\max}^{2/3}$. The result concerns the specified Davies dynamics and periodic boundaries; open boundaries are not proved. Temperature-dependent constants may grow rapidly as $\beta\to\infty$, so the bound remains compatible with finite-size partial self-correction.
We acknowledge the use of LLMs for a proof of Lemma~\ref{lem:characterbound} as well as testing, refining proof ideas, proofreading, and generating Ti$k$Z figures.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 28 pages, 11 figures