Optimal superdense coding of entangled states

A Abeyesinghe, P Hayden, G Smith, AJ Winter

Research output: Contribution to journalArticle (Academic Journal)peer-review

20 Citations (Scopus)

Abstract

We present a one-shot method for preparing 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.
Translated title of the contributionOptimal superdense coding of entangled states
Original languageEnglish
Pages (from-to)3635 - 3641
Number of pages7
JournalIEEE Transactions on Information Theory
Volume52 (8)
DOIs
Publication statusPublished - Aug 2006

Bibliographical note

Publisher: IEEE

Fingerprint Dive into the research topics of 'Optimal superdense coding of entangled states'. Together they form a unique fingerprint.

Cite this