Low-complexity quantum codes designed via codeword-stabilized framework
arXiv:1108.5490 · doi:10.1103/PhysRevA.84.062319
Abstract
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.
12 pages, 3 figures, 1 table
References in corpus (13)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Codeword Stabilized Quantum Codes
- Quantum Error Correcting Codes Using Qudit Graph States
- Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
- Nonadditive quantum error-correcting code
- A simple family of nonadditive quantum codes
- Generalized Concatenated Quantum Codes
- On the logical operators of quantum codes
- Graphical Quantum Error-Correcting Codes
- Quantum Goethals-Preparata Codes
- Non-Additive Quantum Codes from Goethals and Preparata Codes
- Towards Large-Scale Quantum Computation
Cited by in corpus (16)
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Improved quantum hypergraph-product LDPC codes
- Generalized Toric Codes Coupled to Thermal Baths
- On maximum-likelihood decoding with circuit-level errors
- On the Hardness of the Minimum Distance Problem of Quantum Codes
- Comparison of 2D topological codes and their decoding performances
- Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity
- Low-overhead quantum error correction codes with a cyclic topology
- On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
- A graph-based formalism for surface codes and twists
- Degenerate quantum erasure decoding
- Semidefinite programming bounds on the size of entanglement-assisted codeword stabilized quantum codes
- Universal set of Dynamically Protected Gates for Bipartite Qubit Networks II: Soft Pulse Implementation of the [[5,1,3]] Quantum Error Correcting Code
- Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
- Increasing the distance of topological codes with time vortex defects