Optimal superdense coding of entangled states
arXiv:quant-ph/0407061 · doi:10.1109/TIT.2006.878174
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.
Final Version. Several technical issues clarified
References in corpus (18)
- Average Entropy of a Subsystem
- Remote State Preparation
- Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
- Minimum cbits for remote preperation and measurement of a qubit
- Coding Theorem and Strong Converse for Quantum Channels
- Aspects of generic entanglement
- Randomizing quantum states: Constructions and applications
- Faithful remote state preparation using finite classical bits and a non-maximally entangled state
- Average Entropy of a Subsystem
- Low-Entanglement Remote State Preparation
- Superdense coding of quantum states
- Remote preparation of quantum states
- Generalized remote state preparation: Trading cbits, qubits and ebits in quantum communication
- A family of quantum protocols
- Coherent Communication of Classical Messages
- Continuity bounds for entanglement
- Resources required for exact remote state preparation
- Trading quantum for classical resources in quantum data compression
Cited by in corpus (17)
- A Survey on Quantum Channel Capacities
- Efficient Generation of Generic Entanglement
- Exact convergence times for generation of random bipartite entanglement
- Emergence of typical entanglement in two-party random processes
- Generic local distinguishability and completely entangled subspaces
- Optimal two-qubit gate for generation of random bipartite entanglement
- Entanglement of Subspaces and Error Correcting Codes
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
- Approximate Quantum Error Correction Revisited: Introducing the Alpha-bit
- Weak Decoupling Duality and Quantum Identification
- The difference between two random mixed quantum states: exact and asymptotic spectral analysis
- Identification Via Quantum Channels
- Entanglement Sudden Death and Sudden Birth in Semiconductor Microcavities
- Superdense Coding using Bragg Diffracted Hyperentangled Atoms
- Quantum circuit for three-qubit random states
- Toward a quantum computing algorithm to quantify classical and quantum correlation of system states
- Rate Reduction of Blind Quantum Data Compression with Local Approximations Based on Unstable Structure of Quantum States