A Decoupling Approach to the Quantum Capacity

We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.

[1]  J. Smolin,et al.  Degenerate quantum codes for Pauli channels. , 2006, Physical review letters.

[2]  Schumacher,et al.  Quantum data processing and error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[3]  Schumacher,et al.  Sending entanglement through noisy quantum channels. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[4]  Benjamin Schumacher,et al.  Approximate Quantum Error Correction , 2002, Quantum Inf. Process..

[5]  Andreas J. Winter,et al.  The Quantum Capacity With Symmetric Side Channels , 2008, IEEE Transactions on Information Theory.

[6]  Andreas J. Winter,et al.  A Resource Framework for Quantum Shannon Theory , 2008, IEEE Transactions on Information Theory.

[7]  A. Winter,et al.  The mother of all protocols: restructuring quantum information’s family tree , 2006, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  P. Shor,et al.  QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS , 1997, quant-ph/9706061.

[10]  David P. DiVincenzo,et al.  Quantum information and computation , 2000, Nature.

[11]  Christoph Dankert,et al.  Exact and Approximate Unitary 2-Designs: Constructions and Applications , 2006, quant-ph/0606161.

[12]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[13]  R. Klesse.  Approximate quantum error correction, random codes, and quantum channel capacity , 2007, quant-ph/0701102.

[14]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[15]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[16]  S. Lloyd.  Capacity of the noisy quantum channel , 1996, quant-ph/9604015.

[17]  Igor Devetak.  The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

[18]  P. Shor,et al.  The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information , 2003, quant-ph/0311131.

[19]  Igor Devetak,et al.  Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions , 2008, IEEE Transactions on Information Theory.

[20]  M. Horodecki,et al.  Quantum State Merging and Negative Information , 2005, quant-ph/0512247.

[21]  Isaac L. Chuang,et al.  Quantum Information And Computation , 1996 .

[22]  A. Uhlmann.  The "transition probability" in the state space of a ∗-algebra , 1976 .

[23]  Zhang Yong-de,et al.  Quantum Multiple Access Channel , 2002 .

[24]  M. Hamada.  Information rates achievable with algebraic codes on quantum discrete memoryless channels , 2005, IEEE Transactions on Information Theory.

[25]  Debbie W. Leung,et al.  Quantum data hiding , 2002, IEEE Trans. Inf. Theory.

[26]  Howard Barnum,et al.  On quantum fidelities and channel capacities , 2000, IEEE Trans. Inf. Theory.