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

Civil War Book Review

1Dualities and Identities for Entanglement-Assisted Quantum Codes

Ching–Yi Lai, Todd A. Brun, Mark M. Wilde

Published Jan 1, 2014• 32 citations
OpenAlex

Abstract

Abstract—The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from ex-changing the original code’s information qubits for its ebits and vice versa. As an introduction to this notion, we show how entanglement-assisted repetition codes and entanglement-assisted accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We obtain linear programming bounds for EAQEC codes, by exploiting general forms of these dualities and corresponding MacWilliams identities. We establish the Gilbert-Varshamov bound and the Plotkin bound for EAQEC codes, and all of these bounds allow us to formulate a table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits. Finally, we provide an upper bound on the block error probability when transmitting maximal-entanglement EAQEC codes through the depolarizing channel. Index Terms—quantum dual code, entanglement-assisted quantum error correction, MacWilliams identity, linear programming bound, entanglement-assisted repetition codes, entanglement-assisted accumulator codes I.

Related papers

Dualities and Identities for Maximal-Entanglement Quantum Codes

Ching–Yi Lai, Todd A. Brun, Mark M. Wilde

The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code’s information qubits for its ebits and vice versa. As an introduction to this notion, we show how entanglement-assisted repetition codes and entanglementassisted accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We obtain linear programming bounds for non-degenerate EAQEC codes, by exploiting general forms of these dualities and corresponding MacWilliams identities. We establish the GilbertVarshamov bound and the Plotkin bound for EAQEC codes, and all of these bounds allow us to formulate a table of upper and lower bounds on the minimum distance of any maximalentanglement EAQEC code with length up to 15 channel qubits. Finally, we provide an upper bound on the block error probability when transmitting maximal-entanglement EAQEC codes through the depolarizing channel.

•Oct 26, 2010•1 citation

Duality in Entanglement-Assisted Quantum Error Correction

Ching–Yi Lai, Todd A. Brun, Mark M. Wilde

The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is defined from the orthogonal group of a simplified stabilizer group. From the Poisson summation formula, this duality leads to the MacWilliams identities and linear programming bounds for EAQEC codes. We establish a table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits.

arXiv:1302.4150•IEEE Transactions on Information Theory•Feb 8, 2013•79 citations

Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes

Francisco Revson F. Pereira, Ruud Pellikaan, Giuliano G. La Guardia +1 more

Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.

arXiv:1907.06357•IEEE Transactions on Information Theory•Sep 16, 2021•4 citations

Entanglement increases the error-correcting ability of quantum error-correcting codes

Ching–Yi Lai, Todd A. Brun

If entanglement is available, the error-correcting ability of quantum codes can be increased. We show how to optimize the minimum distance of an entanglement-assisted quantum error-correcting (EAQEC) code, obtained by adding ebits to a regular quantum stabilizer code, over different encoding operators. By this encoding optimization procedure, we found a number of EAQEC codes, including a family of entanglement-assisted quantum repetition codes and several optimal EAQEC codes.

arXiv:1008.2598•Physical Review A•Jul 19, 2013•94 citations

Entanglement-assisted quantum error-correcting codes and asymmetric entanglement-assisted quantum error-correcting codes of length 5pt over 𝔽pm

Hai Quang Dinh, Bac Trong Nguyen, Van‐Nui Nguyen +1 more

Classical cyclic and constacyclic codes play a fundamental role in coding theory, thanks to their rich algebraic structures and efficient encoding/decoding algorithms. These codes are especially important in the construction of quantum error-correcting codes, since their inherent algebraic properties facilitate the derivation of self-orthogonality or dual-containing conditions that are crucial for ensuring quantum error correction capability. In this paper, we construct entanglement-assisted quantum error-correcting codes (EAQEC codes) of length [Formula: see text] over [Formula: see text]. We compare our EAQEC codes with all known EAQEC codes to see that our EAQEC codes are new in the sense that their parameters are different from all the previous constructions. Moreover, our EAQEC codes have shorter lengths than the known codes, yet exhibit significantly larger quantum distances. This is highly meaningful in the context of quantum error correction, as it enables the construction of codes with small lengths while maintaining large quantum distances. We also construct asymmetric EAQEC (AEAQEC) codes of length [Formula: see text] over [Formula: see text]. We evaluate our AEAQEC codes against all existing ones and find that they are both new and better.

International Journal of Modern Physics C•Feb 27, 2026•0 citations

Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto +1 more

The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors are more probable than qudit-flip errors. Moreover, they use pre-shared entanglement between encoder and decoder to simplify the theory of quantum error correction and increase the communication capacity. Thus, asymmetric EAQECCs can be constructed from any pair of classical linear codes over an arbitrary field. Their parameters are described and a Gilbert-Varshamov bound is presented. Explicit parameters of asymmetric EAQECCs from BCH codes are computed and examples exceeding the introduced Gilbert-Varshamov bound are shown.

arXiv:1911.10031•IEEE Access•Jan 1, 2020•30 citations
Abstract—The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from ex-changing the original code’s information qubits for its ebits and vice versa. As an introduction to this notion, we show how entanglement-assisted repetition codes and entanglement-assisted accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We obtain linear programming bounds for EAQEC codes, by exploiting general forms of these dualities and corresponding MacWilliams identities. We establish the Gilbert-Varshamov bound and the Plotkin bound for EAQEC codes, and all of these bounds allow us to formulate a table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits. Finally, we provide an upper bound on the block error probability when transmitting maximal-entanglement EAQEC codes through the depolarizing channel. Index Terms—quantum dual code, entanglement-assisted quantum error correction, MacWilliams identity, linear programming bound, entanglement-assisted repetition codes, entanglement-assisted accumulator codes I.
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code’s information qubits for its ebits and vice versa. As an introduction to this notion, we show how entanglement-assisted repetition codes and entanglementassisted accumulator codes are dual to each other, much like their classical counterparts, and we give an explicit, general quantum shift-register circuit that encodes both classes of codes. We later show that our constructions are optimal, and this result completes our understanding of these dual classes of codes. We obtain linear programming bounds for non-degenerate EAQEC codes, by exploiting general forms of these dualities and corresponding MacWilliams identities. We establish the GilbertVarshamov bound and the Plotkin bound for EAQEC codes, and all of these bounds allow us to formulate a table of upper and lower bounds on the minimum distance of any maximalentanglement EAQEC code with length up to 15 channel qubits. Finally, we provide an upper bound on the block error probability when transmitting maximal-entanglement EAQEC codes through the depolarizing channel.
Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.
Classical cyclic and constacyclic codes play a fundamental role in coding theory, thanks to their rich algebraic structures and efficient encoding/decoding algorithms. These codes are especially important in the construction of quantum error-correcting codes, since their inherent algebraic properties facilitate the derivation of self-orthogonality or dual-containing conditions that are crucial for ensuring quantum error correction capability. In this paper, we construct entanglement-assisted quantum error-correcting codes (EAQEC codes) of length [Formula: see text] over [Formula: see text]. We compare our EAQEC codes with all known EAQEC codes to see that our EAQEC codes are new in the sense that their parameters are different from all the previous constructions. Moreover, our EAQEC codes have shorter lengths than the known codes, yet exhibit significantly larger quantum distances. This is highly meaningful in the context of quantum error correction, as it enables the construction of codes with small lengths while maintaining large quantum distances. We also construct asymmetric EAQEC (AEAQEC) codes of length [Formula: see text] over [Formula: see text]. We evaluate our AEAQEC codes against all existing ones and find that they are both new and better.
The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors are more probable than qudit-flip errors. Moreover, they use pre-shared entanglement between encoder and decoder to simplify the theory of quantum error correction and increase the communication capacity. Thus, asymmetric EAQECCs can be constructed from any pair of classical linear codes over an arbitrary field. Their parameters are described and a Gilbert-Varshamov bound is presented. Explicit parameters of asymmetric EAQECCs from BCH codes are computed and examples exceeding the introduced Gilbert-Varshamov bound are shown.