Classical information capacity of superdense coding

Abstract

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum classical channel capacity for states that are not maximally entangled is derived. Particular schemes are then shown to attain this capacity, firstly for pairs of qubits, and secondly for pairs of qutrits.

3 pages, ReVTeX

Cited by in corpus (45)

• The Role of Relative Entropy in Quantum Information Theory
• Teleportation as a Depolarizing Quantum Channel, Relative Entropy and Classical Capacity
• On the capacities of bipartite Hamiltonians and unitary gates
• The states of W-class as shared resources for perfect teleportation and superdense coding
• Uncertainty, Monogamy, and Locking of Quantum Correlations
• Deterministic and Unambiguous Dense Coding
• Distributed quantum dense coding with two receivers in noisy environments
• Disorder overtakes Order in Information Concentration over Quantum Networks
• Encoding classical information into quantum resources
• Exclusion Principle for Quantum Dense Coding
• Multipartite Dense Coding vs. Quantum Correlation: Noise Inverts Relative Capability of Information Transfer
• Quantum dense coding over Bloch channels
• Maximally dense coding capable quantum states
• Simultaneous Dense Coding
• Effects of quantum noises and noisy quantum operations on entanglement and special dense coding
• Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
• Quantum coding in non-inertial frames
• Stochastic resonance effects in quantum channels
• Beating no-go theorems by engineering defects in quantum spin models
• Deterministic Quantum Dense Coding Networks
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• One-shot conclusive multiport quantum dense coding capacities
• Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources
• Non-optimality of unitary operations for dense coding
• Optimal probabilistic dense coding schemes
• Secure $N$-dimensional Simultaneous Dense Coding and Applications
• Minimal control power of controlled dense coding and genuine tripartite entanglement
• Every entangled state provides an advantage in classical communication
• Uncertainty Relation for Mutual Information
• Deterministic distributed dense coding with stabilizer states
• Rating the performance of noisy teleportation using fluctuations in fidelity
• Fault-tolerant Coding for Entanglement-Assisted Communication
• Dimensional advantage in secure information trading via the noisy dense coding protocol
• Role of complementarity in superdense coding
• Genuine Multiparty Quantum Entanglement Suppresses Multiport Classical Information Transmission
• Dynamics of Bloch vectors and the channel capacity of a non identical charged qubit pair
• Superiority in dense coding through non-Markovian stochasticity
• How efficient is transport of quantum cargo through multiple highways?
• Extended Weyl-Heisenberg algebra, phase operator, unitary depolarizers and generalized Bell states
• Resource reduction via repeaters in entanglement distribution
• An entanglement measure based on the capacity of dense coding
• Superdense Coding with Uniformly Accelerated Particle
• Quantum Wiretap Channel Coding Assisted by Noisy Correlation
• Classical capacity of a noiseless quantum channel assisted by noisy entanglement
• When quantum memory is useful for dense coding