Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
The capacity of the quantum channel with general signal states
IEEE Transactions on Information Theory
Operational capacity and pseudoclassicality of a quantum channel
IEEE Transactions on Information Theory
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
Strong converse to the quantum channel coding theorem
IEEE Transactions on Information Theory
Identification in the presence of side information with application to watermarking
IEEE Transactions on Information Theory
Strong converse for identification via quantum channels
IEEE Transactions on Information Theory
The capacity of hybrid quantum memory
IEEE Transactions on Information Theory
Identification via quantum channels
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
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.