English
Related papers

Related papers: Quantum Codes from Generalized Reed-Solomon Codes …

200 papers

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…

Quantum Physics · Physics 2023-10-06 Markus Grassl

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are…

Quantum Physics · Physics 2009-09-29 Zhuo Wang , Kai Sun , Hen Fan , Vlatko Vedral

Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes…

Quantum Physics · Physics 2026-05-05 Ryota Nizuka , Ryutaroh Matsumoto

We present a construction scheme for quantum error correcting codes. The basic ingredients are a graph and a finite abelian group, from which the code can explicitly be obtained. We prove necessary and sufficient conditions for the graph…

Quantum Physics · Physics 2013-05-29 D. Schlingemann , R. F. Werner

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…

Information Theory · Computer Science 2025-06-16 Kanat Abdukhalikov , Cunsheng Ding , Gyanendra K. Verma

Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…

Quantum Physics · Physics 2013-05-29 Gregory M. Crosswhite , Dave Bacon

Construction of good quantum codes via classical codes is an important task for quantum information and quantum computing. In this work, by virtue of a decomposition of the defining set of constacyclic codes we have constructed eight new…

Information Theory · Computer Science 2019-01-11 Mehmet E. Koroglu

Qudits naturally correspond to multi-level quantum systems, which offer an efficient route towards quantum information processing, but their reliability is contingent upon quantum error correction capabilities. In this paper, we present a…

Quantum Physics · Physics 2024-10-04 Robert Frederik Uy , Dorian A. Gangloff

We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear…

Quantum Physics · Physics 2009-07-30 Peter W. Shor , Graeme Smith , John A. Smolin , Bei Zeng

Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space…

Quantum Physics · Physics 2008-12-05 Salah A. Aly , Andreas Klappenecker

With the development of quantum error correction techniques, quantum low density parity check (QLDPC) codes become a promising area in quantum error correction codes. In this paper, the requirements of QLDPC codes based on points except the…

Quantum Algebra · Mathematics 2023-10-04 Ya'nan Feng , Chuchen Tang , Chenming Bai

In this paper we construct several new families of quantum codes with good and asymptotically good parameters. These new quantum codes are derived from (classical) algebraic geometry (AG) codes by applying the Calderbank-Shor-Steane (CSS)…

Quantum Physics · Physics 2017-05-09 Giuliano Gadioli La Guardia , Francisco Revson F. Pereira

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…

Quantum Physics · Physics 2025-10-14 Shubham P. Jain , Joseph T. Iosue , Alexander Barg , Victor V. Albert

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding…

Information Theory · Computer Science 2022-03-08 Markus Grassl

This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum…

Quantum Physics · Physics 2024-01-10 Simeon Ball , Aina Centelles , Felix Huber

Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…

Quantum Physics · Physics 2012-08-27 Hari Dilip Kumar

We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction…

Information Theory · Computer Science 2024-05-29 Elena Berardini , Alessio Caminata , Alberto Ravagnani

Let $q$ be a prime power. Let $\lambda>1$ be a divisor of $q-1$, and let $\tau>1$ and $\rho>1$ be divisors of $q+1$. Under certain conditions we prove that there exists an MDS stabilizer quantum code with length $n=\lambda \tau \sigma$…

Information Theory · Computer Science 2025-10-14 Oisin Campion , Fernando Hernando , Gary McGuire