Optimal Superdense Coding of Entangled States
From MaRDI portal
Abstract: We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a 2n-qubit quantum state could be communicated to a receiver by physically transmitting only n+o(n) qubits in addition to consuming n ebits of entanglement and some shared randomness. When the states to be prepared are entangled, we find that there is a reduction in the number of qubits that need to be transmitted, interpolating between no communication at all for maximally entangled states and the earlier two-for-one result of the unentangled case, all without the use of any shared randomness. We also present two applications of our result: a direct proof of the achievability of the optimal superdense coding protocol for entangled states produced by a memoryless source, and a demonstration that the quantum identification capacity of an ebit is two qubits.
Recommendations
Cited in
(19)- Toward a quantum computing algorithm to quantify classical and quantum correlation of system states
- Approximate quantum error correction revisited: introducing the alpha-bit
- Thermal field and intrinsic decoherence effects on the dynamics of \(N\)-level moving atomic system
- Deterministic mediated superdense coding with linear optics
- Optimal dense coding with mixed state entanglement
- The difference between two random mixed quantum states: exact and asymptotic spectral analysis
- Locally unextendible non-maximally entangled basis
- A SUFFICIENT AND NECESSARY CONDITION FOR SUPERDENSE CODING OF QUANTUM STATES
- Superdense coding with multi-particle GHZ state via local measurement
- ENTANGLEMENT AND SUPERDENSE CODING WITH LINEAR OPTICS
- Identification via quantum channels
- Optimal super dense coding over noisy quantum channels
- Optimal trading of classical communication, quantum communication, and entanglement
- Superdense coding with uniformly accelerated particle
- Discreteness of asymptotic tensor ranks (extended abstract)
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
- Efficient superdense coding with W states
- Entanglement sudden death and sudden birth in semiconductor microcavities
- Aspects of generic entanglement
This page was built for publication: Optimal Superdense Coding of Entangled States
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548180)