Codeword stabilized quantum codes: algorithm and structure
From MaRDI portal
Abstract: The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find there does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank (arXiv:cs/0610159).
Recommendations
Cites work
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A new construction of quantum error-correcting codes
- Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
- Codeword Stabilized Quantum Codes
- Nonadditive quantum error-correcting code
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Optimal binary one-error-correcting codes of length 10 have 72 codewords
- Permutationally invariant codes for quantum error correction
- Polynomial invariants of quantum codes
- Quantum Error Correction and Orthogonal Geometry
- Simple Family of Nonadditive Quantum Codes
Cited in
(10)- New constructions of quantum stabilizer codes based on difference sets
- A non-commuting stabilizer formalism
- Entanglement-assisted operator codeword stabilized quantum codes
- Stabilizer quantum codes over the Clifford algebra
- Symmetries of codeword stabilized quantum codes
- Non-Pauli observables for CWS codes
- Graph concatenation for quantum codes
- [[:Publication:1955881|Efficient quantum circuit for encoding and decoding of the 8,3,5 stabilizer code]]
- Stabilizer quantum codes defined by trace-depending polynomials
- Generalized graph states based on Hadamard matrices
This page was built for publication: Codeword stabilized quantum codes: algorithm and structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650495)
