Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0901.1353

Optimal Nonadditive Quantum Error-Detecting Code

Wen-Tai Yen, Li‐Yi Hsu

Published Jan 10, 2009• 2 citations
arXivHTMLPDF

Abstract

In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with maximal number of codewords can be found. Therein, except the n=7 case, the n-vertex loop graphs help find the optimal quantum codes.

DOI
10.48550/arxiv.0901.1353

Related papers

Graphical Quantum Error-Correcting Codes

Sixia Yu, Qing Chen, Choo Hiap Oh

We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.

arXiv:0709.1780•Sep 12, 2007•64 citations

Nonadditive Quantum Error-Correcting Code

Sixia Yu, Qing Chen, Ching–Yi Lai +1 more

We report the first nonadditive quantum error-correcting code, namely, a ((9, 12, 3)) code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors. Taking advantage of the graph states, we construct explicitly a complete encoding-decoding circuit for the proposed nonadditive error-correcting code.

arXiv:0704.2122•Physical Review Letters•Aug 29, 2008•58 citations

Quantum-error-correcting codes using qudit graph states

Shiang Yong Looi, Li Zhi Yu, Vlad Gheorghiu +1 more

Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive, as well as degenerate and nondegenerate, quantum-error-correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an additive graph code.

arXiv:0712.1979•Physical Review A•Oct 7, 2008•118 citations

Quantum codes of minimum distance two

Eric M. Rains

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With this in mind, we present a number of results on codes of minimum distance 2. We first compute the linear programming bound on the dimension of such a code, then show that this bound can only be attained when the code either is of even length, or is of length 3 or 5. We next consider questions of uniqueness, showing that the optimal code of length 2 or 1 is unique (implying that the well-known one-qubit-in-five single-error correcting code is unique), and presenting nonadditive optimal codes of all greater even lengths. Finally, we compute the full automorphism group of the more important distance 2 codes, allowing us to determine the full automorphism group of any GF(4)-linear code.

arXiv:quant-ph/9704043•IEEE Transactions on Information Theory•Jan 1, 1999•90 citations

Graphical nonbinary quantum error-correcting codes

Dan Mei Hu, Weidong Tang, Meisheng Zhao +3 more

In this paper, we present a systematic way based on the nonbinary graph state of constructing good nonbinary quantum codes, both additive and nonadditive, for systems with integer dimensions. With a computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, ${[[6,2,3]]}_{p}$, ${[[7,3,3]]}_{p}$, ${[[8,2,4]]}_{p}$, and ${[[8,4,3]]}_{p}$ for any odd dimension $\mathit{p}$ and a family of nonadditive codes ${((5,p,3))}_{p}$ for arbitrary $p>3$. In the case of composite numbers as dimensions, we also construct a family of stabilizer codes ${((6,2{p}^{2},3))}_{2p}$ for odd $\mathit{p}$, whose coding subspace is not of a dimension that is a power of the dimension of the physical subsystem.

arXiv:0801.0831•Physical Review A•Jul 3, 2008•77 citations

Simple Family of Nonadditive Quantum Codes

John A. Smolin, Graeme Smith, Stephanie Wehner

Most known quantum codes are additive, meaning the code can be described as the simultaneous eigenspace of an Abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood about how to construct nonadditive codes with good performance. Here we present a family of distance 2 nonadditive quantum codes for all odd block lengths n, that has a particularly simple form. Our codes detect single qubit errors (or correct single qubit erasures) while encoding a higher dimensional space than is possible with an additive code or, for n> or =11, any previous codes. We exhibit the encoding circuits and automorphism group for our codes as well.

arXiv:quant-ph/0701065•Physical Review Letters•Sep 28, 2007•49 citations
In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with maximal number of codewords can be found. Therein, except the n=7 case, the n-vertex loop graphs help find the optimal quantum codes.
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.
Graph states are generalized from qubits to collections of nnn qudits of arbitrary dimension DDD, and simple graphical methods are used to construct both additive and nonadditive, as well as degenerate and nondegenerate, quantum-error-correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large nnn and DDD are constructed using simple graphs, except when nnn is odd and DDD is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general DDD, and shown to provide a dual representation of an additive graph code.
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With this in mind, we present a number of results on codes of minimum distance 2. We first compute the linear programming bound on the dimension of such a code, then show that this bound can only be attained when the code either is of even length, or is of length 3 or 5. We next consider questions of uniqueness, showing that the optimal code of length 2 or 1 is unique (implying that the well-known one-qubit-in-five single-error correcting code is unique), and presenting nonadditive optimal codes of all greater even lengths. Finally, we compute the full automorphism group of the more important distance 2 codes, allowing us to determine the full automorphism group of any GF(4)-linear code.
In this paper, we present a systematic way based on the nonbinary graph state of constructing good nonbinary quantum codes, both additive and nonadditive, for systems with integer dimensions. With a computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, [[6,2,3]]p{[[6,2,3]]}_{p}[[6,2,3]]p​, [[7,3,3]]p{[[7,3,3]]}_{p}[[7,3,3]]p​, [[8,2,4]]p{[[8,2,4]]}_{p}[[8,2,4]]p​, and [[8,4,3]]p{[[8,4,3]]}_{p}[[8,4,3]]p​ for any odd dimension p\mathit{p}p and a family of nonadditive codes ((5,p,3))p{((5,p,3))}_{p}((5,p,3))p​ for arbitrary p>3p>3p>3. In the case of composite numbers as dimensions, we also construct a family of stabilizer codes ((6,2p2,3))2p{((6,2{p}^{2},3))}_{2p}((6,2p2,3))2p​ for odd p\mathit{p}p, whose coding subspace is not of a dimension that is a power of the dimension of the physical subsystem.
Most known quantum codes are additive, meaning the code can be described as the simultaneous eigenspace of an Abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood about how to construct nonadditive codes with good performance. Here we present a family of distance 2 nonadditive quantum codes for all odd block lengths n, that has a particularly simple form. Our codes detect single qubit errors (or correct single qubit erasures) while encoding a higher dimensional space than is possible with an additive code or, for n> or =11, any previous codes. We exhibit the encoding circuits and automorphism group for our codes as well.