Moderate-length lifted quantum Tanner codes

• URL: http://arxiv.org/abs/2502.20297v1
• Date: Thu, 27 Feb 2025 17:23:53 GMT
• Title: Moderate-length lifted quantum Tanner codes
• Authors: Virgile Guemard, Gilles Zémor,
• Abstract summary: We introduce new families of quantum Tanner codes, a class of quantum codes first appeared in the work of Leverrier and Z'emor.<n>We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and for which the distance surpasses the square root of the code length.
• Score: 11.310502327308578
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce new families of quantum Tanner codes, a class of quantum codes which first appeared in the work of Leverrier and Z\'emor. These codes are built from two classical Tanner codes, for which the underlying graphs are extracted from coverings of 2D geometrical complexes, and the local linear codes are tensor-product of cyclic or double-circulant linear codes. We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and for which the distance surpasses the square root of the code length. Among them, we report the existence of a $[[96,2,12]]$ code, for which half of the checks are of weight 8 and the other half of weight 4.

Related papers

• Classical and quantum Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the Reed-Muller family by replacing the group $mathbbZm$ with an arbitrary finite Coxeter group.<n>We also construct quantum CSS codes arising from the Coxeter codes, which admit logical operators outside of the Clifford group.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• 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)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Dihedral Quantum Codes [0.0]
  We present the code construction and give a formula for the code dimension, depending on the two classical codes that the CSS code is based on. We also give a lower bound on the code distance and construct an example of short dihedral quantum codes.
  arXiv  Detail & Related papers  (2023-10-23T16:55:34Z)
• Spatially-Coupled QLDPC Codes [3.1000291317724997]
  We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes. We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes. This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
  arXiv  Detail & Related papers  (2023-04-29T00:57:57Z)
• 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)
• Decoding quantum Tanner codes [0.38073142980732994]
  We introduce sequential and parallel decoders for quantum Tanner codes. Our decoders provably correct arbitrary errors of weight linear in the code length. The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev.
  arXiv  Detail & Related papers  (2022-08-10T19:50:18Z)
• Quantum Tanner codes [0.38073142980732994]
  We prove a theorem that simultaneously gives a growing minimum distance for the quantum code and recovers the local testability of the Dinur et al. code.
  arXiv  Detail & Related papers  (2022-02-28T09:35:31Z)
• New Binary Quantum Codes Constructed from Quasi-Cyclic Codes [6.718184400443239]
  It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing. As an application, we construct 8 binary quantum codes that exceed the best-known results.
  arXiv  Detail & Related papers  (2021-12-14T03:22:16Z)
• 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)
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians [7.092674229752723]
  We introduce a framework that takes it any classical code and explicitly constructs the corresponding QEC code. A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code.
  arXiv  Detail & Related papers  (2020-12-02T19:00:19Z)

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.