Dense coding capacity of a quantum channel

Abstract

We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.

arXiv comment4 pages. 3 figures. REVTeX

References in corpus (20)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Gaussian Quantum Information
• Fundamental Limits of Repeaterless Quantum Communications
• General Benchmarks for Quantum Repeaters
• Secure Direct Communication with a Quantum One-Time-Pad
• Secure direct communication using entanglement
• Deterministic Secure Direct Communication Using Entanglement
• Advances in Quantum Teleportation
• Advances in Photonic Quantum Sensing
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Secure Deterministic Communication Without Entanglement
• The ping-pong protocol can be attacked without eavesdropping
• Deterministic secure communication protocol without using entanglement
• Theory of channel simulation and bounds for private communication
• Optimal dense coding with mixed state entanglement
• Quantum Reading Capacity
• Optimal super dense coding over noisy quantum channels
• Optimal super dense coding over memory channels
• A review on super dense coding over covariant noisy channels

Cited by in corpus (12)

• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
• Mixed State Entanglement Classification using Artificial Neural Networks
• Ultimate Limits of Thermal Pattern Recognition
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Superiority in dense coding through non-Markovian stochasticity
• Transmission distance in the space of quantum channels
• On quantum illumination, quantum reading, and the capacity of quantum computation
• Codes for entanglement-assisted classical communication
• Probing multipartite entanglement, coherence and quantum information preservation under classical Ornstein-Uhlenbeck noise
• Dephasing effects on quantum correlations and teleportation in presence of state dependent bath
• When quantum memory is useful for dense coding
• Optimal quantum precision in noise estimation: Is entanglement necessary?