Coupled-Layer Construction of Quantum Product Codes

• URL: http://arxiv.org/abs/2603.08711v1
• Date: Mon, 09 Mar 2026 17:59:59 GMT
• Title: Coupled-Layer Construction of Quantum Product Codes
• Abstract summary: Product codes are quantum error correcting codes built from two or more constituent codes.<n>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.
• Score: 0.664167116861767
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. 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.

Related papers

• Coupled-Layer Codes: Beyond Quantum Product Constructions [0.664167116861767]
  Product codes are an important class of quantum error-correcting codes constructed from multiple input codes.<n>We show how coupled-layer codes reproduce the X-cube and Chamon models.<n>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.
  arXiv  Detail & Related papers  (2026-08-10T18:00:01Z)
• Quantum bootstrap product codes [8.649956206461296]
  Product constructions constitute a powerful method for generating quantum CSS codes.<n>We introduce the textitquantum bootstrap productfork (QBP)<n>We show that QBP can generate self-correcting quantum codes from input codes with constant energy barriers.
  arXiv  Detail & Related papers  (2026-01-29T22:16:31Z)
• Growing Sparse Quantum Codes from a Seed [0.0]
  We show that by conjoining only quantum repetition codes, one can construct quantum LDPC codes.<n>We also show that the conjoining of even just two-qubit quantum bit-flip and phase-flip repetition codes is quite powerful as they can create any CSS code.
  arXiv  Detail & Related papers  (2025-07-17T19:05:52Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes [16.55015892533456]
  The construction utilizes nearly self-orthogonal codes to design quantum stabilizer codes. A refined lower bound on the minimum distance of the resulting quantum codes is established. We report numerous record breaking quantum codes from our randomized search for inclusion in the updated online database.
  arXiv  Detail & Related papers  (2024-05-23T21:10:23Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Quantum spherical codes [55.33545082776197]
  We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
  arXiv  Detail & Related papers  (2023-02-22T19:00:11Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.