{ "id": "quant-ph/0407061", "version": "v2", "published": "2004-07-08T18:49:29.000Z", "updated": "2006-08-09T14:14:34.000Z", "title": "Optimal superdense coding of entangled states", "authors": [ "Anura Abeyesinghe", "Patrick Hayden", "Graeme Smith", "Andreas Winter" ], "comment": "Final Version. Several technical issues clarified", "journal": "IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3635-3641, 2006", "doi": "10.1109/TIT.2006.878174", "categories": [ "quant-ph" ], "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.", "revisions": [ { "version": "v2", "updated": "2006-08-09T14:14:34.000Z" } ], "analyses": { "keywords": [ "entangled states", "quantum identification capacity", "optimal superdense coding protocol", "earlier two-for-one result", "shared randomness" ], "tags": [ "journal article" ], "note": { "typesetting": "TeX", "pages": 0, "language": "en", "license": "arXiv", "status": "editable", "adsabs": "2004quant.ph..7061A" } } }