Optimal superdense coding of entangled states
| dc.creator | Abeyesinghe, Anura | |
| dc.creator | Hayden, Patrick | |
| dc.creator | Smith, Graeme | |
| dc.creator | Winter, Andreas | |
| dc.date | 2004-07-08 | |
| dc.date | 2006-08-09 | |
| dc.date.accessioned | 2026-07-07T06:40:42Z | |
| dc.date.available | 2026-07-07T06:40:42Z | |
| dc.description | 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. | |
| dc.description | Final Version. Several technical issues clarified | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0407061 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0407061 | |
| dc.identifier | IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3635-3641, 2006 | |
| dc.identifier | doi:10.1109/TIT.2006.878174 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101463 | |
| dc.subject | Quantum Physics | |
| dc.title | Optimal superdense coding of entangled states | |
| dc.type | text |