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

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.

[1]  I Devetak,et al.  Relating quantum privacy and quantum coherence: an operational approach. , 2004, Physical review letters.

[2]  A. Winter,et al.  Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.

[3]  Akio Fujiwara,et al.  Operational Capacity and Pseudoclassicality of a Quantum Channel , 1998, IEEE Trans. Inf. Theory.

[4]  Peter Löber.  Quantum channels and simultaneous ID coding , 1999 .

[5]  Garry Bowen.  Quantum feedback channels , 2004, IEEE Transactions on Information Theory.

[6]  V. Balakirsky,et al.  Identification under random processes , 1996 .

[7]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[8]  A. Jamiołkowski.  Linear transformations which preserve trace and positive semidefiniteness of operators , 1972 .

[9]  Tomohiro Ogawa,et al.  Strong converse to the quantum channel coding theorem , 1999, IEEE Trans. Inf. Theory.

[10]  A. Winter,et al.  Distillation of secret key and entanglement from quantum states , 2003, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[11]  P. Shor.  Equivalence of Additivity Questions in Quantum Information Theory , 2003, quant-ph/0305035.

[12]  Charles H. Bennett,et al.  Concentrating partial entanglement by local operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[13]  Rudolf Ahlswede,et al.  A General Theory of Information Transfer , 1993, Proceedings. IEEE International Symposium on Information Theory.

[14]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.

[15]  Christian Kleinewächter,et al.  On identification , 2005, Electron. Notes Discret. Math..

[16]  Debbie W. Leung,et al.  Remote preparation of quantum states , 2005, IEEE Transactions on Information Theory.

[17]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[18]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[19]  Greg Kuperberg,et al.  The capacity of hybrid quantum memory , 2002, IEEE Trans. Inf. Theory.

[20]  Aram Harrow.  Coherent communication of classical messages. , 2004, Physical review letters.

[21]  E. Lubkin.  Entropy of an n‐system from its correlation with a k‐reservoir , 1978 .

[22]  Rudolf Ahlswede,et al.  Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.

[23]  Rudolf Ahlswede,et al.  Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.

[24]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[25]  Rajagopal Nagarajan,et al.  On feedback and the classical capacity of a noisy quantum channel , 2005, IEEE Transactions on Information Theory.

[26]  Aram W. Harrow,et al.  A family of quantum protocols , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[27]  Andreas J. Winter.  Quantum and classical message identification via quantum channels , 2005, Quantum Inf. Comput..

[28]  Rudolf Ahlswede,et al.  Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[29]  A. Harrow,et al.  Superdense coding of quantum states. , 2003, Physical review letters.

[30]  A. Holevo.  Problems in the mathematical theory of quantum communication channels , 1977 .

[31]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[32]  Andreas J. Winter,et al.  Coding theorem and strong converse for quantum channels , 1999, IEEE Trans. Inf. Theory.

[33]  Rudolf Ahlswede,et al.  Identification via channels , 1989, IEEE Trans. Inf. Theory.