• DocumentCode
    3126289
  • Title

    Quantum polar codes for arbitrary channels

  • Author

    Wilde, Mark M. ; Renes, Joseph M.

  • Author_Institution
    Sch. of Comput. Sci., McGill Univ., Montreal, QC, Canada
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    334
  • Lastpage
    338
  • Abstract
    We construct a new entanglement-assisted quantum polar coding scheme which achieves the symmetric coherent information rate by synthesizing “amplitude” and “phase” channels from a given, arbitrary quantum channel. We first demonstrate the coding scheme for arbitrary quantum channels with qubit inputs, and we show that quantum data can be reliably decoded by O(N) rounds of coherent quantum successive cancellation, followed by N controlled-NOT gates (where N is the number of channel uses). We also find that the entanglement consumption rate of the code vanishes for degradable quantum channels. Finally, we extend the coding scheme to channels with multiple qubit inputs. This gives a near-explicit method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels which individually have zero quantum capacity can have a non-zero quantum capacity when used together.
  • Keywords
    channel capacity; channel coding; decoding; logic gates; quantum entanglement; amplitude channels; arbitrary channels; arbitrary quantum channel coding scheme; coherent quantum successive cancellation; controlled-NOT gates; entanglement consumption rate; entanglement-assisted quantum polar coding scheme; multiple qubit inputs; near-explicit method; nonzero quantum capacity; phase channels; quantum information theory; superactivation effect; symmetric coherent information rate; zero quantum capacity; Decoding; Encoding; Logic gates; Protocols; Quantum entanglement; Receivers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6284203
  • Filename
    6284203