Maximally Extendable Product Codes are Good Coboundary Expanders

• URL: http://arxiv.org/abs/2501.01411v1
• Date: Thu, 02 Jan 2025 18:56:01 GMT
• Title: Maximally Extendable Product Codes are Good Coboundary Expanders
• Authors: Gleb Kalachev, Pavel Panteleev,
• Abstract summary: We investigate the coboundary expansion property of product codes called product expansion. In this paper, we prove that the collection of random codes over a sufficiently large field has good product expansion.
• Score: 4.604003661048267
• License:
• Abstract: We investigate the coboundary expansion property of product codes called product expansion, which plays an important role in the recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research revealed that this property is equivalent to agreement testability and robust testability for products of two codes of linear distance. However, for products of more than two codes, product expansion is a strictly stronger property. In this paper, we prove that the collection of random codes over a sufficiently large field has good product expansion. We believe that in the case of four codes, these ideas can be used to construct good quantum locally testable codes in a way similar to the current constructions using only products of two codes.

Related papers

• 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)
• Quantum LDPC Codes of Almost Linear Distance via Homological Products [23.22566380210149]
  We present new constructions of quantum codes of linear or close-to-linear distance and dimension with low-weight stabilizers. Our results help address the natural question: When do homological products preserve good code distance?
  arXiv  Detail & Related papers  (2024-11-06T03:53:10Z)
• 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)
• Maximally Extendable Sheaf Codes [5.439020425819001]
  We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes. We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
  arXiv  Detail & Related papers  (2024-03-06T12:20:49Z)
• High-dimensional Expansion of Product Codes is Stronger than Robust and Agreement Testability [0.0]
  We show that robust testability for product of many codes with linear distance is equivalent to agreement testability. We provide an example of product of three codes with linear distance which is robustly testable but not product expanding.
  arXiv  Detail & Related papers  (2023-08-05T14:13:25Z)
• 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. 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)
• Classical product code constructions for quantum Calderbank-Shor-Steane codes [1.4699455652461726]
  We introduce a new product code construction which is a natural generalisation of classical product codes to quantum codes. We 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.
  arXiv  Detail & Related papers  (2022-09-27T15:48:37Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• 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)
• Quantum XYZ Product Codes [0.3222802562733786]
  We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classical LDPC codes, this "XYZ product" yields a non CSS quantum LDPC code which might display a large minimum distance.
  arXiv  Detail & Related papers  (2020-11-19T09:50:08Z)

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.