Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.10069

Coupled-Layer Codes: Beyond Quantum Product Constructions

Shuyu Zhang, Tzu-Chieh Wei, Nathanan Tantivasadakarn

quant-phcond-mat.str-elSubmitted Aug 10, 2026• Announced Aug 12, 2026• 2 citations
arXivHTMLPDF

Abstract

Product codes are an important class of quantum error-correcting codes constructed from multiple input codes, which can give rise to asymptotically good quantum low-density parity check codes. In previous work, we showed how the product between two codes can be physically implemented by coupling layers of the first code using checks of the second code. In this work, we further unify product code constructions with coupled-layer constructions of phases of matter by introducing coupled-layer codes. The essential strategy is to condense general excitations created by Pauli operators among multiple decoupled layers of the first code. The condensation is specified by an excitation algebra, which encodes the excitations, along with an algebra-preserving map. This coupling between layers generalizes the notion of gauging in physics as well as the mapping cone in homological algebra, and can be used to produce non-CSS codes. As examples, we show how coupled-layer codes reproduce the X-cube and Chamon models. We further generalize the balanced product code by allowing a unitary transformation in addition to a group action by free permutation and describe its corresponding coupled-layer construction. In particular, we show how balancing by a ZX-duality can reproduce non-CSS codes such as the fermionic toric code and the 3-fermion Walker-Wang model in 3D.

Comments
27+15 pages

Related papers

Coupled-Layer Construction of Quantum Product Codes

Shuyu Zhang, Tzu-Chieh Wei, Nathanan Tantivasadakarn

Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of both code distance and encoding rate. However, despite its powerful algebraic formulation, the physical mechanism for assembling a general product code from its constituents remains unclear. In this letter, we show that the tensor and balanced product codes admit an intuitive coupled-layer construction by taking a stack of one code and condensing a set of excitations in the pattern given by the checks of the other code. We also make a connection to concatenated codes by showing that the tensor product code can be obtained by gauging large-weight logicals in concatenated codes, making them qLDPC. Our framework accommodates both classical or quantum CSS input codes, unifies known physical mechanisms for constructing higher dimensional topological phases via anyon condensation, and naturally extends to non-topological codes.

quant-pharXiv:2603.08711•Mar 10, 2026•7 citations

Quantum Process Realization of LDPC Code Dualities and Product Constructions

Shuhan Zhang, Deepak Aryal, Yi-Zhuang You

We realize a broad class of code transformations, including Kramers-Wannier duality, tensor product, and check product, as quantum processes consisting of ancilla initialization, local unitaries, and projective measurements. Using ZX-calculus, we formulate these code transformations diagrammatically and develop a systematic algorithm for extracting their quantum-process realizations. Central to our framework is the observation that the physical content of a classical LDPC code is captured by the operator algebra associated with its Tanner graph, and that code transformations correspond to maps between such algebras. Kramers-Wannier duality then admits a natural interpretation as gauging, while tensor and check products correspond to coupled-layer constructions in which interlayer coupling and projection implement a quotient on stacked operator algebras. Together, these results establish a unified framework connecting code transformations, quantum circuits, and mappings between distinct quantum phases of matter.

quant-pharXiv:2603.13538•Mar 17, 2026•1 citation

Classical product code constructions for quantum Calderbank-Shor-Steane codes

Dimiter Ostrev, Davide Orsucci, Francisco Lázaro +1 more

Several notions of code products are known in quantum error correction, such as hypergraph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which is a natural generalization of classical product codes to quantum codes: starting from a set of component Calderbank-Shor-Steane (CSS) codes, a larger CSS code is obtained where both X parity checks and Z parity checks are associated to classical product codes. We deduce several properties of product CSS codes from the properties of the component codes, including bounds to the code distance, and show that built-in redundancies in the parity checks result in so-called meta-checks which can be exploited to correct syndrome read-out errors. We then specialize to the case of single-parity-check (SPC) product codes which in the classical domain are a common choice for constructing product codes. Logical error rate simulations of a SPC 3 -fold product CSS code having parameters [[512,174,8]] are shown under both a maximum likelihood decoder for the erasure channel and belief propagation decoding for depolarizing noise. We compare the results with other codes of comparable length and dimension, including a code from the family of asymptotically good Tanner codes. We observe that our reference product CSS code outperforms all the other examined codes.

arXiv:2209.13474•Quantum•Jul 22, 2024•13 citations

Non-Abelian sheaf quantum LDPC codes: good and magical

Zimu Li, Fuchuan Wei, Zhengyi Han +1 more

Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to establish code families with constant encoding rate and linear distance, simultaneously achieving optimal asymptotic scaling in both parameters. In particular, we characterize explicit logical representatives of the full gauged code space, and provide a fundamental treatment of non-Abelian code distance in the sense of Knill--Laflamme based on combining expansion with cleaning to establish protection against arbitrary errors. We further construct an almost-good family with entire code spaces exhibiting long-range magic. Moreover, we use linearly addressable cup product to directly generate linearly many encoded magic states from gauging measurements of Clifford operators. These results extend good qLDPC codes beyond the Pauli stabilizer setting, lay the foundation for pursuing the no low-energy trivial magic conjecture and shed light on non-Abelian quantum phases and orders beyond geometric locality.

quant-pharXiv:2609.30159•Sep 25, 2026•3 citations

Quantum bootstrap product codes

Meng-Yuan Li

Product constructions constitute a powerful method for generating quantum CSS codes, yielding celebrated examples such as toric codes and asymptotically good low-density parity check (LDPC) codes. Since a CSS code is fully described by a chain complex, existing product formalisms are predominantly homological, defined via the tensor product of the underlying chain complexes of input codes, thereby establishing a natural connection between quantum codes and topology. In this Letter, we introduce the \textit{quantum bootstrap product} (QBP), an approach that extends beyond this standard homological paradigm. Specifically, a QBP code is determined by solving a consistency condition termed the ``bootstrap equation''. We find that the QBP paradigm unifies a wide range of important codes, including general hypergraph product (HGP) codes of arbitrary dimensions and fracton codes typically represented by the X-cube code. Crucially, the solutions to the bootstrap equation yield chain complexes where the chain groups and associated boundary maps consist of multiple components. We term such structures \textit{fork complexes}. This structure elucidates the underlying topological structures of fracton codes, akin to foliated fracton order theories. Beyond conceptual insights, we demonstrate that the QBP paradigm can generate self-correcting quantum codes from input codes with constant energy barriers and surpass the code-rate upper bounds inherent to HGP codes. Our work thus substantially extends the scope of quantum product codes and provides a versatile framework for designing fault-tolerant quantum memories.

quant-pharXiv:2601.22363•Feb 2, 2026•0 citations

The Physics of (good) LDPC Codes II. Product constructions

Tibor Rakovszky, Vedika Khemani

We continue the study of classical and quantum low-density parity check (LDPC) codes from a physical perspective. We focus on constructive approaches and formulate a general framework for systematically constructing codes with various features on generic Euclidean and non-Euclidean graphs. These codes can serve as fixed-point limits for phases of matter. To build our machinery, we unpack various product constructions from the coding literature in terms of physical principles such as symmetries and redundancies, introduce a new cubic product, and combine these products with the ideas of gauging and Higgsing introduced in Part I. We illustrate the usefulness of this approach in finite Euclidean dimensions by showing that using the one-dimensional Ising model as a starting point, we can systematically produce a very large zoo of classical and quantum phases of matter, including type I and type II fractons and SPT phases with generalized symmetries. We also use the balanced product to construct new Euclidean models, including one with topological order enriched by translation symmetry, and another exotic fracton model whose excitations are formed by combining those of a fractal spin liquid with those of a toric code, resulting in exotic mobility constraints. Moving beyond Euclidean models, we give a review of existing constructions of good qLDPC codes and classical locally testable codes and elaborate on the relationship between quantum code distance and classical energy barriers, discussed in Part I, from the perspective of product constructions.

arXiv:2402.16831•Feb 26, 2024•45 citations
Product codes are an important class of quantum error-correcting codes constructed from multiple input codes, which can give rise to asymptotically good quantum low-density parity check codes. In previous work, we showed how the product between two codes can be physically implemented by coupling layers of the first code using checks of the second code. In this work, we further unify product code constructions with coupled-layer constructions of phases of matter by introducing coupled-layer codes. The essential strategy is to condense general excitations created by Pauli operators among multiple decoupled layers of the first code. The condensation is specified by an excitation algebra, which encodes the excitations, along with an algebra-preserving map. This coupling between layers generalizes the notion of gauging in physics as well as the mapping cone in homological algebra, and can be used to produce non-CSS codes. As examples, we show how coupled-layer codes reproduce the X-cube and Chamon models. We further generalize the balanced product code by allowing a unitary transformation in addition to a group action by free permutation and describe its corresponding coupled-layer construction. In particular, we show how balancing by a ZX-duality can reproduce non-CSS codes such as the fermionic toric code and the 3-fermion Walker-Wang model in 3D.
Product codes are a class of quantum error correcting codes built from two or more constituent codes. They have recently gained prominence for a breakthrough yielding quantum low-density parity-check (qLDPC) codes with favorable scaling of both code distance and encoding rate. However, despite its powerful algebraic formulation, the physical mechanism for assembling a general product code from its constituents remains unclear. In this letter, we show that the tensor and balanced product codes admit an intuitive coupled-layer construction by taking a stack of one code and condensing a set of excitations in the pattern given by the checks of the other code. We also make a connection to concatenated codes by showing that the tensor product code can be obtained by gauging large-weight logicals in concatenated codes, making them qLDPC. Our framework accommodates both classical or quantum CSS input codes, unifies known physical mechanisms for constructing higher dimensional topological phases via anyon condensation, and naturally extends to non-topological codes.
We realize a broad class of code transformations, including Kramers-Wannier duality, tensor product, and check product, as quantum processes consisting of ancilla initialization, local unitaries, and projective measurements. Using ZX-calculus, we formulate these code transformations diagrammatically and develop a systematic algorithm for extracting their quantum-process realizations. Central to our framework is the observation that the physical content of a classical LDPC code is captured by the operator algebra associated with its Tanner graph, and that code transformations correspond to maps between such algebras. Kramers-Wannier duality then admits a natural interpretation as gauging, while tensor and check products correspond to coupled-layer constructions in which interlayer coupling and projection implement a quotient on stacked operator algebras. Together, these results establish a unified framework connecting code transformations, quantum circuits, and mappings between distinct quantum phases of matter.
Several notions of code products are known in quantum error correction, such as hypergraph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which is a natural generalization of classical product codes to quantum codes: starting from a set of component Calderbank-Shor-Steane (CSS) codes, a larger CSS code is obtained where both X parity checks and Z parity checks are associated to classical product codes. We deduce several properties of product CSS codes from the properties of the component codes, including bounds to the code distance, and show that built-in redundancies in the parity checks result in so-called meta-checks which can be exploited to correct syndrome read-out errors. We then specialize to the case of single-parity-check (SPC) product codes which in the classical domain are a common choice for constructing product codes. Logical error rate simulations of a SPC 3 -fold product CSS code having parameters [[512,174,8]] are shown under both a maximum likelihood decoder for the erasure channel and belief propagation decoding for depolarizing noise. We compare the results with other codes of comparable length and dimension, including a code from the family of asymptotically good Tanner codes. We observe that our reference product CSS code outperforms all the other examined codes.
Non-Abelian quantum codes connect quantum error correction, phases of matter, and computational resources. In this work, we develop a general framework for constructing non-Abelian quantum low-density parity-check (qLDPC) codes by gauging sheaf codes via cup products and use it to establish code families with constant encoding rate and linear distance, simultaneously achieving optimal asymptotic scaling in both parameters. In particular, we characterize explicit logical representatives of the full gauged code space, and provide a fundamental treatment of non-Abelian code distance in the sense of Knill--Laflamme based on combining expansion with cleaning to establish protection against arbitrary errors. We further construct an almost-good family with entire code spaces exhibiting long-range magic. Moreover, we use linearly addressable cup product to directly generate linearly many encoded magic states from gauging measurements of Clifford operators. These results extend good qLDPC codes beyond the Pauli stabilizer setting, lay the foundation for pursuing the no low-energy trivial magic conjecture and shed light on non-Abelian quantum phases and orders beyond geometric locality.
Product constructions constitute a powerful method for generating quantum CSS codes, yielding celebrated examples such as toric codes and asymptotically good low-density parity check (LDPC) codes. Since a CSS code is fully described by a chain complex, existing product formalisms are predominantly homological, defined via the tensor product of the underlying chain complexes of input codes, thereby establishing a natural connection between quantum codes and topology. In this Letter, we introduce the \textit{quantum bootstrap product} (QBP), an approach that extends beyond this standard homological paradigm. Specifically, a QBP code is determined by solving a consistency condition termed the ``bootstrap equation''. We find that the QBP paradigm unifies a wide range of important codes, including general hypergraph product (HGP) codes of arbitrary dimensions and fracton codes typically represented by the X-cube code. Crucially, the solutions to the bootstrap equation yield chain complexes where the chain groups and associated boundary maps consist of multiple components. We term such structures \textit{fork complexes}. This structure elucidates the underlying topological structures of fracton codes, akin to foliated fracton order theories. Beyond conceptual insights, we demonstrate that the QBP paradigm can generate self-correcting quantum codes from input codes with constant energy barriers and surpass the code-rate upper bounds inherent to HGP codes. Our work thus substantially extends the scope of quantum product codes and provides a versatile framework for designing fault-tolerant quantum memories.
We continue the study of classical and quantum low-density parity check (LDPC) codes from a physical perspective. We focus on constructive approaches and formulate a general framework for systematically constructing codes with various features on generic Euclidean and non-Euclidean graphs. These codes can serve as fixed-point limits for phases of matter. To build our machinery, we unpack various product constructions from the coding literature in terms of physical principles such as symmetries and redundancies, introduce a new cubic product, and combine these products with the ideas of gauging and Higgsing introduced in Part I. We illustrate the usefulness of this approach in finite Euclidean dimensions by showing that using the one-dimensional Ising model as a starting point, we can systematically produce a very large zoo of classical and quantum phases of matter, including type I and type II fractons and SPT phases with generalized symmetries. We also use the balanced product to construct new Euclidean models, including one with topological order enriched by translation symmetry, and another exotic fracton model whose excitations are formed by combining those of a fractal spin liquid with those of a toric code, resulting in exotic mobility constraints. Moving beyond Euclidean models, we give a review of existing constructions of good qLDPC codes and classical locally testable codes and elaborate on the relationship between quantum code distance and classical energy barriers, discussed in Part I, from the perspective of product constructions.