Identification via Quantum Channels in the Presence of Prior Correlation and Feedback

AJ Winter

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

Abstract

Continuing our earlier work (quant-ph/0401060), we give two alternative proofs of the result that a noiseless qubit channel has identification capacity 2: the first is direct by a "maximal code with random extension" argument, the second is by showing that 1 bit of entanglement (which can be generated by transmitting 1 qubit) and negligible (quantum) communication has identification capacity 2. This generalises a random hashing construction of Ahlswede and Dueck: that 1 shared random bit together with negligible communication has identification capacity 1. We then apply these results to prove capacity formulas for various quantum feedback channels: passive classical feedback for quantum-classical channels, a feedback model for classical-quantum channels, and "coherent feedback" for general channels.
Translated title of the contributionIdentification via Quantum Channels in the Presence of Prior Correlation and Feedback
Original languageEnglish
Pages (from-to)387 - 387
Number of pages1
JournalElectronic Notes in Discrete Mathematics
Volume21
DOIs
Publication statusPublished - Aug 2005

Bibliographical note

Publisher: Elsevier

Fingerprint Dive into the research topics of 'Identification via Quantum Channels in the Presence of Prior Correlation and Feedback'. Together they form a unique fingerprint.

Cite this