New Quantum Codes from CSS Codes

• URL: http://arxiv.org/abs/2208.05353v2
• Date: Tue, 13 Dec 2022 18:02:28 GMT
• Title: New Quantum Codes from CSS Codes
• Authors: Markus Grassl
• Abstract summary: In general, one would only obtain a code with parameters $[![n,k,d]!]_q$. The construction applies to asymmetric quantum codes from the CSS construction as well.
• Score: 0.6091702876917279
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a new propagation rule for CSS codes. Starting with a CSS code $[\![n,k,d]\!]_q$, we construct a CSS code with parameters $[\![n-2,k,d-1]\!]_q$. In general, one would only obtain a code with parameters $[\![n-2,k,d-2]\!]_q$. The construction applies to asymmetric quantum codes from the CSS construction as well.

Related papers

• Asymptotically good CSS-T codes exist [0.0]
  We give a new construction of binary quantum codes that enables the generation of a CSS-T code from any given CSS code. We show that the same result holds for binary quantum low-density parity check CSS-T codes.
  arXiv  Detail & Related papers  (2024-12-11T18:03:58Z)
• Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound [44.154181086513574]
  We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ frackn = frac13 $. We demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs.
  arXiv  Detail & Related papers  (2024-10-05T11:56:15Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• On Transversality Across Two Distinct Quantum Error Correction Codes For Quantum Repeaters [7.38597648387724]
  We show that different stations of quantum can experience different errors. Considering this fact, we suggest to use different CSS codes in different stations. We show that in contrast to the well known CNOTity which states that two CSS codes should be the same, less restrictive constraints are needed.
  arXiv  Detail & Related papers  (2024-06-01T08:04:51Z)
• 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)
• Delving StyleGAN Inversion for Image Editing: A Foundation Latent Space Viewpoint [76.00222741383375]
  GAN inversion and editing via StyleGAN maps an input image into the embedding spaces ($mathcalW$, $mathcalW+$, and $mathcalF$) to simultaneously maintain image fidelity and meaningful manipulation. Recent GAN inversion methods typically explore $mathcalW+$ and $mathcalF$ rather than $mathcalW$ to improve reconstruction fidelity while maintaining editability. We introduce contrastive learning to align $mathcalW$ and the image space for precise latent
  arXiv  Detail & Related papers  (2022-11-21T13:35:32Z)
• Divisible Codes for Quantum Computation [0.6445605125467572]
  Divisible codes are defined by the property that codeword weights share a common divisor greater than one. This paper explores how they can be used to protect quantum information as it is transformed by logical gates.
  arXiv  Detail & Related papers  (2022-04-27T20:18:51Z)
• 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)
• Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically [36.685393265844986]
  We construct new families of quantum error correction codes achieving the quantum-Omega-Varshamov boundally. $mathscrQ$ can be encoded very efficiently by circuits of size $O(N)$ and depth $O(sqrtN)$. $mathscrQ$ can also be decoded in parallel in $O(sqrtN)$ time by using $O(sqrtN)$ classical processors.
  arXiv  Detail & Related papers  (2021-07-12T03:27:30Z)
• Classical Coding Problem from Transversal $T$ Gates [10.478611957969145]
  We show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical $T$ via physical $T$. We also use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes.
  arXiv  Detail & Related papers  (2020-01-14T16:45:48Z)

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.