Codeword stabilized quantum codes: Algorithm and structure

DOI10.1063/1.3086833zbMath1214.94082arXiv0803.3232OpenAlexW2015790182MaRDI QIDQ3650495

John A. Smolin, Bei Zeng, Andrew W. Cross, Isaac Chuang, Graeme Smith

Publication date: 14 December 2009

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.3232

zbMATH Keywords

graph theoryquantum computingerror correction codes

Mathematics Subject Classification ID

Other types of codes (94B60) Quantum coding (general) (81P70)

Related Items (5)

Entanglement-assisted operator codeword stabilized quantum codes ⋮ Non-Pauli observables for CWS codes ⋮ Generalized graph states based on Hadamard matrices ⋮ A non-commuting stabilizer formalism ⋮ Graph concatenation for quantum codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• Permutationally invariant codes for quantum error correction
• Nonadditive Quantum Error-Correcting Code
• Simple Family of Nonadditive Quantum Codes
• Boolean Functions, Projection Operators, and Quantum Error Correcting Codes
• Quantum Error Correction and Orthogonal Geometry
• Polynomial invariants of quantum codes
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Codeword Stabilized Quantum Codes
• A new construction of quantum error-correcting codes

This page was built for publication: Codeword stabilized quantum codes: Algorithm and structure