Stabilizer formalism for generalized concatenated quantum codes

@article{Wang2013StabilizerFF,
  title={Stabilizer formalism for generalized concatenated quantum codes},
  author={Yun-Jiang Wang and Bei Zeng and Markus Grassl and Barry C. Sanders},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={529-533}
}
The concept of generalized concatenated quantum codes (GCQC) provides a systematic way for constructing good quantum codes from short component codes. We introduce a stabilizer formalism for GCQCs, which is achieved by defining quantum coset codes. This formalism offers a new perspective for GCQCs and enables us to derive a lower bound on the code distance of stabilizer GCQCs from component codes parameters, for both non-degenerate and degenerate component codes. Our formalism also shows how to… 

Figures from this paper

Codeword stabilized quantum codes for asymmetric channels
In this study we present a method that adapts the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. Making use of the the corresponding Pauli error
Degenerate Codes and Capacities of Quantum Channels
TLDR
This thesis outlines the work completed looking into the construction of good codes for the amplitude damping channel and the difficult problem of determining if a quantum channel has capacity; the ultimate use of QECCs in a sense.
Tensor-Network Codes.
TLDR
It is shown that the exact tensor-network decoder (with no bond-dimension truncation) has polynomial complexity in the number of physical qubits, even for locally correlated noise, making this the first efficient decoder for holographic codes against Pauli noise and a rare example of a decoder that is both efficient and exact.
Local tensor-network codes
TLDR
This work shows how to write some topological codes, including the surface code and colour code, as simple tensor-network codes and proves that this method is efficient in the case of stabilizer codes encoded via local log-depth circuits in one dimension and holographic codes.
On the parity-check matrix of generalized concatenated code
TLDR
This research presents a novel and scalable approach to solve the challenge of integrating mobile phone networks to provide real-time information about the location of faults in the network.

References

SHOWING 1-10 OF 19 REFERENCES
Generalized concatenated quantum codes
TLDR
This work constructs families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.
Stabilizer Codes and Quantum Error Correction
TLDR
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Generalized concatenation for quantum codes
TLDR
It is shown how good quantum error-correcting codes can be constructed using generalized concatenation, including both stabilizer codes as well as so-called non-additive codes.
Nonbinary quantum stabilizer codes
TLDR
This work defines and shows how to construct nonbinary quantum stabilizer codes, a relationship between self-orthogonal codes over F(q/sup 2/) and q-ary quantum codes for any prime power q, based on nonbinary error bases.
Concatenated Quantum Codes
TLDR
A method is given which has the property that to store or transmit a qubit with maximum error $c$ requires gates with error at most $c\epsilon$ and storage or channel elements witherror at most c, independent of how long the authors wish to store the state or how far they wish to transmit it.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Coset Codes-Part 11: Binary Lattices and Related Codes
TLDR
The family of Barnes-Wall lattices and their principal sublattices, which are useful in con- structing coset codes, are generated by iteration of a simple construction called the "squaring construction," and the closely related Reed-Muller codes are generate by the same construction.
Coset codes-I: Introduction and geometrical classification
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1988
TLDR
The known types of coset codes, as well as a number of new classes that systematize and generalize known codes, are classified and compared in terms of these parameters.
Coset codes-II: Binary lattices and related codes
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1988
TLDR
The family of Barnes-Wall lattices and their principal sublattices, which are useful in constructing coset codes, are generated by iteration of a simple construction called the squaring construction, and are represented by trellis diagrams that display their structure and interrelationships and that lead to efficient maximum-likelihood decoding algorithms.
Error control coding - fundamentals and applications
  • Shu Lin, D. Costello
  • Computer Science, Business
    Prentice Hall computer applications in electrical engineering series
  • 1983
TLDR
This book explains coding for Reliable Digital Transmission and Storage using Trellis-Based Soft-Decision Decoding Algorithms for Linear Block Codes and Convolutional Codes, and some of the techniques used in this work.
...
...