Graphical Quantum Error-Correcting Codes

Abstract

We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are potentially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.

7 pages and 3 figures

Cited by in corpus (16)

• Codeword Stabilized Quantum Codes
• Codeword stabilized quantum codes: algorithm and structure
• Quantum Goethals-Preparata Codes
• Low-complexity quantum codes designed via codeword-stabilized framework
• Non-Additive Quantum Codes from Goethals and Preparata Codes
• Location of quantum information in additive graph codes
• Near-term $n$ to $k$ distillation protocols using graph codes
• Quantum Error Correction Code in the Hamiltonian Formulation
• Scheme for constructing graphs associated with stabilizer quantum codes
• Symmetries of Codeword Stabilized Quantum Codes
• The geometry of non-additive stabiliser codes
• A new approach to codeword stabilized quantum codes using the algebraic structure of modules
• Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes
• On the Fourier Transform Approach to Quantum Error Control
• Separable Operations, Graph Codes and the Location of Quantum Information
• Logic Functions and Quantum Error Correcting Codes