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

IEEE International Symposium on Information Theory (ISIT)

Linear programming bounds for entanglement-assisted quantum codes

Ching–Yi Lai, Alexei Ashikhmin

Published Jun 1, 2017• 0 citations
Publisher

Abstract

In this paper, we define two split weight enumerators for general quantum codes with entanglement assistance, including nonadditive codes. We show that they obey a MacWilliams identity, which allows us to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. On the other hand, we derive additional constraints on the size of Pauli subgroups for quantum codes, which helps to improve the linear programming bounds on the minimum distance of quantum codes of small length.

DOI
10.1109/isit.2017.8007120

Related papers

Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators

Ching–Yi Lai, Alexei Ashikhmin

Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.

arXiv:1602.00413•IEEE Transactions on Information Theory•Jun 2, 2017•107 citations

Complete Weight Distributions and MacWilliams Identities for Asymmetric Quantum Codes

Chuangqiang Hu, Shudi Yang, Stephen S.‐T. Yau

In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.

arXiv:1810.11969•IEEE Access•Jan 1, 2019•7 citations

Upper bounds on the size of quantum codes

Alexei Ashikhmin, S. Litsyu

This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.

IEEE Transactions on Information Theory•May 1, 1999•77 citations

Quantum weight enumerators

Eric M. Rains

In a recent paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-2, 1997) defined two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams transform, and used them to give a linear programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, and to extend the enumerator theory to codes with block size greater than 2.

arXiv:quant-ph/9612015•IEEE Transactions on Information Theory•Jul 1, 1998•139 citations

1Dualities and Identities for Entanglement-Assisted Quantum Codes

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

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.

Civil War Book Review•Jan 1, 2014•32 citations

Semidefinite Programming Bounds on the Size of Entanglement-Assisted Codeword Stabilized Quantum Codes

Ching–Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu

In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. Furthermore, this characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints that lead to SDP bounds on the minimum distance or size of CWS-type quantum codes. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results, while SDP consistently provides tighter and relevant bounds. Finally, we also provide interpretations of the Shor-Laflamme weight enumerators and shadow enumerators for codeword stabilized codes, enhancing our understanding of quantum codes.

arXiv:2311.07111•IEEE Transactions on Information Theory•Jul 25, 2024•2 citations
In this paper, we define two split weight enumerators for general quantum codes with entanglement assistance, including nonadditive codes. We show that they obey a MacWilliams identity, which allows us to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. On the other hand, we derive additional constraints on the size of Pauli subgroups for quantum codes, which helps to improve the linear programming bounds on the minimum distance of quantum codes of small length.
Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.
In 1997, Shor and Laflamme defined the weight enumerators for quantum error-correcting codes and derived a MacWilliams identity. We extend their work by introducing our double weight enumerators and complete weight enumerators for qubit codes and then investigate the MacWilliams identities for these enumerators. Based on the generalized MacWilliams identities, we solve an open problem, namely, the Singleton-type bound for asymmetric quantum codes (AQCs). Besides, the Hamming-type and the first linear-programming-type bounds for the AQCs are deduced similarly.
This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.
In a recent paper, Shor and Laflamme (see Phys. Rev. Lett., vol.78, p.1600-2, 1997) defined two "weight enumerators" for quantum error-correcting codes, connected by a MacWilliams transform, and used them to give a linear programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, clarifying the duality between Shor and Laflamme's enumerators. We also use the new enumerators to give a simpler condition for a quantum code to have specified minimum distance, and to extend the enumerator theory to codes with block size greater than 2.
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.
In this paper, we explore the application of semidefinite programming to the realm of quantum codes, specifically focusing on codeword stabilized (CWS) codes with entanglement assistance. Notably, we utilize the isotropic subgroup of the CWS group and the set of word operators of a CWS-type quantum code to derive an upper bound on the minimum distance. Furthermore, this characterization can be incorporated into the associated distance enumerators, enabling us to construct semidefinite constraints that lead to SDP bounds on the minimum distance or size of CWS-type quantum codes. We illustrate several instances where SDP bounds outperform LP bounds, and there are even cases where LP fails to yield meaningful results, while SDP consistently provides tighter and relevant bounds. Finally, we also provide interpretations of the Shor-Laflamme weight enumerators and shadow enumerators for codeword stabilized codes, enhancing our understanding of quantum codes.