English
Related papers

Related papers: New Quantum Codes from CSS Codes

200 papers

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with…

Quantum Physics · Physics 2009-02-19 Andrew Cross , Graeme Smith , John A. Smolin , Bei Zeng

We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.

Quantum Physics · Physics 2007-05-23 Andrew Thangaraj , Steven McLaughlin

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Information Theory · Computer Science 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

In this paper, we investigate the transversality of pairs of CSS codes and their use in the second generation of quantum repeaters (QR)s. We show that different stations of quantum link can experience different errors. Considering this…

Quantum Physics · Physics 2024-06-04 Mahdi Bayanifar , Alexei Ashikhmin , Dawei Jiao , Olav Tirkkonen

An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition,…

Information Theory · Computer Science 2023-10-03 Ruhao Wan

We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Thomas Beth , Martin Roetteler

We use multidimensional circulant approach to construct new qutrit stabilizer $\dsb{\ell, 0, d}$ codes with parameters $(\ell, d) \in \{(51, 16), (52, 16), (54, 17), (55, 17), (57, 17)\}$ through symplectic self-dual additive codes over…

Information Theory · Computer Science 2023-12-21 Padmapani Seneviratne , Hannah Cuff , Alexandra Koletsos , Kerry Seekamp , Adrian Thananopavarn

We present new quantum codes with good parameters which are constructed from self-orthogonal algebraic geometry codes. Our method permits a wide class of curves to be used in the formation of these codes, which greatly extends the class of…

Algebraic Geometry · Mathematics 2025-01-17 Fernando Hernando , Gary McGuire , Francisco Monserrat , Julio José Moyano-Fernández

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…

Information Theory · Computer Science 2020-10-15 Ram Krishna Verma , Om Prakash , Ashutosh Singh

We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We…

Information Theory · Computer Science 2013-12-18 Alain Couvreur , Nicolas Delfosse , Gilles Zémor

This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.

Information Theory · Computer Science 2010-08-11 Yeow Meng Chee , Chaoping Xing , Sze Ling Yeo

Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. We introduce two new families of quantum convolutional codes. Our construction is based on an algebraic method which allows to…

In this paper, we introduce a new family of stabilizer quantum LDPC codes derived from the classical linear codes $L_k$ and $L_k^{+}$, defined via sub-exceding functions. In previous work, these codes demonstrated strong performance in…

Quantum Physics · Physics 2026-03-10 Luc Rabefihavanana , Harinaivo Andriatahiny , Randriamiarampanahy Ferdinand

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…

Information Theory · Computer Science 2014-08-19 Yixuan Xie , Jinhong Yuan , Yuichiro Fujiwara

We construct quantum MDS codes with parameters $ [\![ q^2+1,q^2+3-2d,d ]\!] _q$ for all $d \leqslant q+1$, $d \neq q$. These codes are shown to exist by proving that there are classical generalised Reed-Solomon codes which contain their…

Quantum Physics · Physics 2021-01-15 Simeon Ball

We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them…

Quantum Physics · Physics 2009-11-13 Zhuo Li , Li-Juan Xing , Xin-Mei Wang

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

New properties of $q$-ary cyclotomic cosets modulo $n = q^{m} - 1$, where $q \geq 3$ is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of…

Information Theory · Computer Science 2016-01-01 Giuliano Gadioli La Guardia , Marcelo Muniz Silva Alves

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu