Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
arXiv:2311.07111 · doi:10.1109/TIT.2024.3433550
Abstract
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.
15 pages, 2 tables
References in corpus (21)
- Stabilizer Codes and Quantum Error Correction
- Correcting Quantum Errors with Entanglement
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Codeword Stabilized Quantum Codes
- Entanglement required in achieving entanglement-assisted channel capacities
- A nonadditive quantum code
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Duality in Entanglement-Assisted Quantum Error Correction
- Entropic proofs of Singleton bounds for quantum error-correcting codes
- Nonadditive quantum error-correcting code
- Quantum Codes of Maximal Distance and Highly Entangled Subspaces
- A simple family of nonadditive quantum codes
- Information-theoretic interpretation of quantum error-correcting codes
- Codeword stabilized quantum codes: algorithm and structure
- Entanglement-assisted codeword stabilized quantum codes
- A Family of Quantum Codes with Exotic Transversal Gates
- Low-complexity quantum codes designed via codeword-stabilized framework
- Concatenated quantum codes can attain the quantum Gilbert-Varshamov bound
- Linear programming bounds for quantum channels acting on quantum error-correcting codes
- Heuristic construction of codeword stabilized codes
- The Diagonal Distance of CWS Codes