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

AJ Winter

Research output: Chapter in Book/Report/Conference proceedingChapter in a book

4 Citations (Scopus)

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 generalizes 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
Title of host publicationGeneral Theory of Information Transfer and Combinatorics
EditorsR Ahlswede
PublisherSpringer
Pages486 - 504
Number of pages19
ISBN (Print)9783540462446
Publication statusPublished - 2006

Bibliographical note

Other: doi:10.1007/11889342_27. Lecture Notes in Computer Science vol 4123, ISSN 0302-9743

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