- Open Access
Low-Density Parity-Check Codes as Stable Phases of Quantum Matter
PRX Quantum 6, 030329 – Published 19 August, 2025
DOI: https://doi.org/10.1103/361k-nj4b
Abstract
Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.
Physics Subject Headings (PhySH)
Popular Summary
The universal properties of quantum many-body ground states are typically understood through the lens of stable phases of matter, a framework that usually relies on the system being contained in finite spatial dimensions. Certain phases of matter in finite spatial dimensions, such as the toric code, are known to be absolutely stable to perturbations, a property that is related to the ability of the system to robustly store quantum information. Yet, many-body systems can also emerge in effectively infinite dimensions—for instance, in spin glasses or error-correcting codes. Do such systems represent stable phases of matter in the same sense? This work answers that question affirmatively. We prove that certain quantum low-density parity-check (LDPC) codes form absolutely stable phases of matter, robust against arbitrary local perturbations.
LDPC codes are foundational in classical error correction and are widely used in modern communication devices. Their quantum counterparts are now emerging as leading candidates for scalable quantum error correction, offering far lower overhead than traditional finite-dimensional codes like the toric code. We propose a sufficient condition for stability, grounded in coding theory, which generalizes the existing paradigm for the stability of the toric-code phase.
Intriguingly, these “infinite-dimensional” phases seem to defy the third law of thermodynamics: they have robust nonzero entropy density at zero temperature in the thermodynamic limit. Our work illustrates how error-correcting codes can open new perspectives on the foundations of statistical mechanics.
See Also
Low-Density Parity-Check Stabilizer Codes as Gapped Quantum Phases: Stability under Graph-Local Perturbations
Article Text
References (67)
- Bei Zeng, Xie Chen, Duan-Lu Zhou, and Xiao-Gang Wen, Quantum Information Meets Quantum Matter (Springer, New York, 2019).
- Xie Chen, Zheng-Cheng Gu, and Xiao-Gang Wen, Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order, Phys. Rev. B 82, 155138 (2010).
- S. Bravyi, M. B. Hastings, and F. Verstraete, Lieb-Robinson bounds and the generation of correlations and topological quantum order, Phys. Rev. Lett. 97, 050401 (2006).
- Sergey Bravyi, Matthew B. Hastings, and Spyridon Michalakis, Topological quantum order: Stability under local perturbations, J. Math. Phys. 51, 093512 (2010).
- Lorenzo Piroli, Georgios Styliaris, and J. Ignacio Cirac, Quantum circuits assisted by local operations and classical communication: Transformations and phases of matter, Phys. Rev. Lett. 127, 220503 (2021).
- Nathanan Tantivasadakarn, Ashvin Vishwanath, and Ruben Verresen, Hierarchy of topological order from finite-depth unitaries, measurement, and feedforward, PRX Quantum 4, 020339 (2023).
- David T. Stephen, Arpit Dua, Ali Lavasani, and Rahul Nandkishore, Nonlocal finite-depth circuits for constructing symmetry-protected topological states and quantum cellular automata, PRX Quantum 5, 010304 (2024).
- A. Yu. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Phys. 303, 2 (2003).
- Spyridon Michalakis and Justyna P. Zwolak, Stability of frustration-free Hamiltonians, Commun. Math. Phys. 322, 277 (2013).
- Benjamin J. Brown, Daniel Loss, Jiannis K. Pachos, Chris N. Self, and James R. Wootton, Quantum memories at finite temperature, Rev. Mod. Phys. 88, 045005 (2016).
- Zack Weinstein, Gerardo Ortiz, and Zohar Nussinov, Universality classes of stabilizer code Hamiltonians, Phys. Rev. Lett. 123, 230503 (2019).
- Sebastian Krinner, Nathan Lacroix, Ants Remm, Agustin Di Paolo, Elie Genois, Catherine Leroux, Christoph Hellings, Stefania Lazar, Francois Swiadek, Johannes Herrmann, Graham J. Norris, Christian Kraglund Andersen, Markus Müller, Alexandre Blais, Christopher Eichler, and Andreas Wallraff, Realizing repeated quantum error correction in a distance-three surface code, Nature 605, 669 (2022).
- Riddhi S. Gupta, Neereja Sundaresan, Thomas Alexander, Christopher J. Wood, Seth T. Merkel, Michael B. Healy, Marius Hillenbrand, Tomas Jochym-O’Connor, James R. Wootton, Theodore J. Yoder, Andrew W. Cross, Maika Takita, and Benjamin J. Brown, Encoding a magic state with beyond break-even fidelity, Nature 625, 259 (2024).
- Rajeev Acharya et al. (Google Quantum AI), Suppressing quantum errors by scaling a surface code logical qubit, Nature 614, 676 (2023).
- Rajeev Acharya et al. (Google Quantum AI and Colloborators), Quantum error correction below the surface code threshold, Nature 638, 920 (2025).
- Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, J. Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gullans, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 626, 58 (2024).
- Noah Berthusen, Joan Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Dan Gresh, Nathan Hewitt, Michael Mills, Steven A. Moses, Brian Neyenhuis, Peter Siegfried, and David Hayes, Experiments with the four-dimensional surface code on a quantum charge-coupled device quantum computer, Phys. Rev. A 110, 062413 (2024).
- Jean-Pierre Tillich and Gilles Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Trans. Inf. Theory 60, 1193 (2014).
- Matthew B. Hastings, Jeongwan Haah, and Ryan O’Donnell, in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 (Association for Computing Machinery, New York, NY, USA, 2021), pp. 1276–1288.
- Nikolas P. Breuckmann and Jens N. Eberhardt, Balanced product quantum codes, IEEE Trans. Inf. Theory 67, 6653 (2021).
- Pavel Panteleev and Gleb Kalachev, Quantum LDPC codes with almost linear minimum distance, IEEE Trans. Inf. Theory 68, 213 (2022).
- Pavel Panteleev and Gleb Kalachev, in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022 (Association for Computing Machinery, New York, NY, USA, 2022), pp. 375–388.
- Anthony Leverrier and Gilles Zémor, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Denver, CO, USA, 2022), pp. 872–883.
- Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick, Good quantum LDPC codes with linear time decoders, arXiv:2206.07750 [quant-ph].
- Yifan Hong, Jinkang Guo, and Andrew Lucas, Quantum memory at nonzero temperature in a thermodynamically trivial system, Nat. Commun. 16, 316 (2025).
- Tibor Rakovszky and Vedika Khemani, The Physics of (good) LDPC Codes I. Gauging and dualities, arXiv:2310.16032 [quant-ph].
- Tibor Rakovszky and Vedika Khemani, The Physics of (good) LDPC Codes II. Product constructions, arXiv:2402.16831 [quant-ph].
- Yifan Hong, Matteo Marinelli, Adam M. Kaufman, and Andrew Lucas, Long-range-enhanced surface codes, Phys. Rev. A 110, 022607 (2024).
- Yifan Hong, Elijah Durso-Sabina, David Hayes, and Andrew Lucas, Entangling four logical qubits beyond break-even in a nonlocal code, Phys. Rev. Lett. 133, 180601 (2024).
- Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasic, Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou, Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays, Nat. Phys. 20, 1084 (2024).
- Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J. Pablo Bonilla Ataides, Mikhail D. Lukin, and Liang Jiang, Fast and parallelizable logical computation with homological product codes, Phys. Rev. X 15, 021065 (2025).
- Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe, in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC ’23 (ACM, 2023).
- M. H. Freedman and M. B. Hastings, Quantum systems on non--hyperfinite complexes: A generalization of classical statistical mechanics on expander graphs, arXiv:1301.1363 [quant-ph].
- Ali Lavasani, Michael J. Gullans, Victor V. Albert, and Maissam Barkeshli, On stability of k-local quantum phases of matter, arXiv:2405.19412 [quant-ph].
- Yaodong Li, Nicholas O’Dea, and Vedika Khemani, Perturbative stability and error-correction thresholds of quantum codes, PRX Quantum 6, 010327 (2025).
- Chao Yin, Federica M. Surace, and Andrew Lucas, Theory of metastable states in many-body quantum systems, Phys. Rev. X 15, 011064 (2025).
- Dorit Aharonov and Yonathan Touati, Quantum circuit depth lower bounds for homological codes, arXiv:1810.03912 [quant-ph].
- Sergey Bravyi and Matthew B. Hastings, A short proof of stability of topological order under local perturbations, Commun. Math. Phys. 307, 609 (2011).
- M. B. Hastings and Xiao-Gang Wen, Quasiadiabatic continuation of quantum states: The stability of topological ground-state degeneracy and emergent gauge invariance, Phys. Rev. B 72, 045141 (2005).
- Sven Bachmann, Spyridon Michalakis, Bruno Nachtergaele, and Robert Sims, Automorphic equivalence within gapped phases of quantum lattice systems, Commun. Math. Phys. 309, 835 (2012).
- Ben T. McDonough, Chao Yin, Andrew Lucas, and Carolyn Zhang, Lieb-Robinson bounds with exponential-in-volume tails, arXiv:2502.02652 [quant-ph].
- Lawrence E. Thomas, Bound on the mass gap for finite volume stochastic Ising models at low temperature, Commun. Math. Phys. 126, 1 (1989).
- Matthew F. Lapa and Michael Levin, Stability of ground state degeneracy to long-range interactions, J. Stat. Mech.: Theory Exp. 2023, 013102 (2023).
- Subir Sachdev, Quantum Phase Transitions (Cambridge University Press, Cambridge, 2011), 2nd ed.
- Here the big-O notation means for a constant independent of system size. We will also use for with a constant , and for .
- Sergey Bravyi, David Poulin, and Barbara Terhal, Tradeoffs for reliable quantum information storage in 2D systems, Phys. Rev. Lett. 104, 050503 (2010).
- For subexponential-expanding graphs, Ref. [34] also only gets a quasipolynomial bound.
- Ilya Dumer, Alexey A. Kovalev, and Leonid P. Pryadko, Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes, Phys. Rev. Lett. 115, 050502 (2015).
- Note that here we use a different symbol than the Appendix to differentiate with the previous used for faces.
- Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor, in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (IEEE, Berkeley, CA, USA, 2015).
- For finite dimensions, this requires that (as we show later) we can relax the check soundness condition to be any polynomial.
- Chi-Fang (Anthony) Chen, Andrew Lucas, and Chao Yin, Speed limits and locality in many-body quantum dynamics, Rep. Prog. Phys. 86, 116001 (2023).
- Dmitry Abanin, Wojciech De Roeck, Wen Wei Ho, and François Huveneers, A rigorous theory of many-body prethermalization for periodically driven and closed quantum systems, Commun. Math. Phys. 354, 809 (2017).
- Sidney Coleman, Fate of the false vacuum: Semiclassical theory, Phys. Rev. D 15, 2929 (1977).
- Chao Yin and Andrew Lucas, Prethermalization and the local robustness of gapped systems, Phys. Rev. Lett. 131, 050402 (2023).
- Chao Yin, Rahul Nandkishore, and Andrew Lucas, Eigenstate localization in a many-body quantum system, Phys. Rev. Lett. 133, 137101 (2024).
- Rahul Nandkishore and David A. Huse, Many-body localization and thermalization in quantum statistical mechanics, Annu. Rev. Condens. Matter Phys. 6, 15 (2015).
- H. A. M. Daniëls and A. C. D. Van Enter, Differentiability properties of the pressure in lattice systems, Commun. Math. Phys. 71, 65 (1980).
- A. C. D. van Enter, A note on the stability of phase diagrams in lattice systems, Commun. Math. Phys. 79, 25 (1981).
- Andrea Montanari and Guilhem Semerjian, On the dynamics of the glass transition on bethe lattices, J. Stat. Phys. 124, 103 (2006).
- Wojciech De Roeck, Vedika Khemani, Yaodong Li, Nicholas O’Dea, and Tibor Rakovszky, Low-density parity-check stabilizer codes as gapped quantum phases: Stability under graph-local perturbations, PRX Quantum 6, 030330 (2025).
- In the proof of Theorem 1, we will often substitute or for out of convenience.
- Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes, Good locally testable codes, arXiv:2207.11929 [cs.IT].
- Max Hopkins and Ting-Chun Lin, Explicit lower bounds against -rounds of sum-of-squares, arXiv:2204.11469 [cs.CC].
- A classical expander code can be constructed by, e.g., taking a random bipartite graph with regular degrees and identifying the two sets of vertices as bits and checks. The parity-check matrix of the code is thus the adjacency matrix of the bipartite graph.
- Earl T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Sci. Technol. 4, 025006 (2019).
- Tom Richardson and Ruediger Urbanke, Modern Coding Theory (Cambridge University Press, Cambridge, 2008).
