Constructions and decoding procedures for quantum CSS codes
- URL: http://arxiv.org/abs/2502.03242v1
- Date: Wed, 05 Feb 2025 15:00:46 GMT
- Title: Constructions and decoding procedures for quantum CSS codes
- Authors: Yannick Saouter, Massinissa Zenia, Gilles Burel,
- Abstract summary: This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS) codes.
The codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes.
- Score: 0.0
- License:
- Abstract: This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes. A new algebraic decoding technique is also introduced. This technique is exemplified on CSS codes obtained from BCH, Reed-Muller and projective geometry codes.
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.
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) - Coherent information for CSS codes under decoherence [0.0]
A class called Calderbank-Shor-Steane (CSS) codes includes many important examples such as toric codes, color codes, and fractons.
Recent studies have revealed that the decoding transition for these QECCs could be intrinsically captured by calculating information-theoretic quantities from the mixed state.
arXiv Detail & Related papers (2024-07-02T18:00:02Z) - 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) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Lifts of quantum CSS codes [0.0]
We propose a notion of lift for quantum CSS codes, inspired by the geometrical construction of Freedman and Hastings.
It is based on the existence of a canonical complex associated to any CSS code, that we introduce under the name of Tanner cone-complex.
arXiv Detail & Related papers (2024-04-25T16:44:45Z) - 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) - 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) - CSS code surgery as a universal construction [51.63482609748332]
We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes.
We describe code surgery between such codes using a specific colimit in the category of chain complexes.
arXiv Detail & Related papers (2023-01-31T16:17:25Z) - 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) - Encoding Classical Information in Gauge Subsystems of Quantum Codes [7.6146285961466]
We show how to construct hybrid quantum-classical codes from subsystem codes by encoding the classical information into the gauge qudits using gauge fixing.
We give an explicit construction of hybrid codes from two classical linear codes using Bacon-Casaccino subsystem codes, as well as several new examples of good hybrid code.
arXiv Detail & Related papers (2020-12-10T18:58:07Z)
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.