Find this paper

Abstract

Classical low-density parity-check (cLDPC) codes defined on expander graphs are a fundamental ingredient in the construction of good quantum LDPC codes, a recent milestone in quantum error correction. They also define interesting statistical mechanics models in their own right, as they include examples of spin glass order without quenched randomness or frustration. We investigate this via a case study of a cLDPC code on a locally tree-like expander graph. Recursive techniques on trees, made possible by the locally tree-like property, probe a menagerie of stable, incongruent valleys induced by imposing different boundary conditions at low temperature. Analysis of stable and unstable fixed points within the cavity method, complemented by a numerical study of the valleys on closed finite graphs, reveals the inequivalence of the microcanonical and canonical ensemble for certain valleys.

Posts about this paper

No posts about this paper yet. Mention it with @ in a post to start the conversation.