• DocumentCode
    2513883
  • Title

    Subsystem code constructions

  • Author

    Aly, Salah A. ; Klappenecker, Andreas

  • Author_Institution
    Dept. of Comput. Sci., Texas A&M Univ., College Station, TX
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    369
  • Lastpage
    373
  • Abstract
    Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor product of two vector spaces: the subsystem and the co-subsystem. A generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. The existence of numerous families of MDS subsystem codes is established. Propagation rules are derived that allow one to obtain longer and shorter subsystem codes from given subsystem codes. Furthermore, propagation rules are derived that allow one to construct a new subsystem code by combining two given subsystem codes.
  • Keywords
    error correction codes; quantum communication; MDS subsystem codes; quantum error-correcting codes; quantum state space; subsystem code constructions; Computer errors; Computer science; Error correction; Error correction codes; Fault tolerance; Quantum computing; State-space methods; Tensile stress; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595010
  • Filename
    4595010