Optimal superdense coding of Entangled States

Anura Abeyesinghe, Patrick Hayden, Graeme Smith, Andreas J. Winter

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

In this paper, 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 2l-qubit quantum state could be communicated to a receiver by physically transmitting only l+o(l) qubits in addition to consuming l 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.

Original languageEnglish
Pages (from-to)3635-3641
Number of pages7
JournalIEEE Transactions on Information Theory
Volume52
Issue number8
DOIs
StatePublished - Aug 2006
Externally publishedYes

Keywords

  • Concentration of measure
  • Entanglement
  • Identification
  • Remote state preparation
  • Superdense coding

Fingerprint

Dive into the research topics of 'Optimal superdense coding of Entangled States'. Together they form a unique fingerprint.

Cite this