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 quantumclassical channels, a feedback model for classical-quantum channels, and "coherent feedback" for general channels. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Winter, A. (2006). Identification via quantum channels in the presence of prior correlation and feedback. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4123 LNCS, pp. 486–504). https://doi.org/10.1007/11889342_27
Mendeley helps you to discover research relevant for your work.