Codeword Stabilized Quantum Codes

DOI10.1109/TIT.2008.2008136MaRDI QIDQ4975707zbMATH OpenOpenAlexFDO

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

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Abstract: We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10,18,3)) and ((10,20,3)) codes. We also show how to construct encoding circuits for all codes within our framework.

Cited in

(14)

• Non-Pauli observables for CWS codes
• Stabilizer quantum codes defined by trace-depending polynomials
• Key ideas in quantum error correction
• Entanglement-assisted operator codeword stabilized quantum codes
• Quantum memories and error correction
• Codeword stabilized quantum codes: algorithm and structure
• Quantum Serial Turbo Codes
• Magic state distillation with the ternary Golay code
• A non-commuting stabilizer formalism
• Graph concatenation for quantum codes
• Stabilizer quantum codes over the Clifford algebra
• Generalized graph states based on Hadamard matrices
• Non-trivial area operators require non-local magic
• Local equivalence of stabilizer states: a graphical characterisation

This page was built for publication: Codeword Stabilized Quantum Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975707)