Graph Concatenation for Quantum Codes
arXiv:0910.4129 · doi:10.1063/1.3534799
Abstract
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good quantum codes of relatively large block length, concatenated quantum codes and their generalizations play an important role. We develop a systematic method for constructing concatenated quantum codes based on "graph concatenation", where graphs representing the inner and outer codes are concatenated via a simple graph operation called "generalized local complementation." Our method applies to both binary and non-binary concatenated quantum codes as well as their generalizations.
26 pages, 12 figures. Figures of concatenated [[5,1,3]] and [[7,1,3]] are added. Submitted to JMP
References in corpus (3)
Cited by in corpus (11)
- Linear and logarithmic time compositions of quantum many-body operators
- On Weak Odd Domination and Graph-based Quantum Secret Sharing
- Generalized Graph States Based on Hadamard Matrices
- Codeword Stabilized Quantum Codes for Asymmetric Channels
- Edge local complementation for logical cluster states
- On the Minimum Degree up to Local Complementation: Bounds and Complexity
- Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
- Generating and verifying graph states for fault-tolerant topological measurement-based quantum computing in 2D optical lattices
- Engineering holography with stabilizer graph codes
- Universal graph representation of stabilizer codes
- Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes