A Decoupling Approach to the Quantum Capacity

DOI10.1142/S1230161208000043MaRDI QIDQ3521585zbMATH OpenOpenAlexWikidataFDO

Authors Patrick Hayden, Andreas Winter, M. Horodecki

Publication date 26 August 2008

Published in Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0702005

Mathematics Subject Classification ID

Quantum computation (81P68) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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's 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.

Recommendations

• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• A Random Coding Based Proof for the Quantum Coding Theorem
• The capacity of the quantum depolarizing channel
• Quantum coding theorems
• scientific article; zbMATH DE number 1406134

Cites work

• A Mathematical Theory of Communication
• Information Rates Achievable With Algebraic Codes on Quantum Discrete Memoryless Channels
• On quantum fidelities and channel capacities
• Quantum data hiding
• The transition probability in the state space of a \(^*\)-algebra
• The capacity of a quantum channel for simultaneous transmission of classical and quantum information
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Cited in

(29)

• Entanglement assisted classical capacity of a class of quantum channels with long-term memory
• Random quantum circuits are approximate 2-designs
• Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
• Algorithmic complexity of quantum capacity
• Entanglement wedge reconstruction and the information paradox
• Hayden-Preskill decoding from noisy Hawking radiation
• One-shot randomized and nonrandomized partial decoupling
• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Approximate unitary 3-designs from transvection Markov chains
• Eigenstate thermalization hypothesis and approximate quantum error correction
• Approximate quantum error correction revisited: introducing the alpha-bit
• One-shot decoupling
• Exponential decay of correlations implies area law
• The capacity of black holes to transmit quantum information
• Decoding quantum information via the Petz recovery map
• Towards the fast scrambling conjecture
• Achieving the Holevo bound via a bisection decoding protocol
• Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels
• Error thresholds for arbitrary Pauli noise
• The apex of the family tree of protocols: optimal rates and resource inequalities
• Decoupling with unitary approximate two-designs
• Distilling entanglement from arbitrary resources
• THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
• Unitary 2-designs from random X- and Z-diagonal unitaries
• RTNI—A symbolic integrator for Haar-random tensor networks
• Quantum convolutional coding with shared entanglement: general structure
• Approximate unitary k-designs from shallow, low-communication circuits
• Quantum communication in Rindler spacetime
• Joint state-channel decoupling and one-shot quantum coding theorem

This page was built for publication: A Decoupling Approach to the Quantum Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521585)