Identification Via Quantum Channels

Abstract

We review the development of the quantum version of Ahlswede and Dueck's theory of identification via channels. As is often the case in quantum probability, there is not just one but several quantizations: we know at least two different concepts of identification of classical information via quantum channels, and three different identification capacities for quantum information. In the present summary overview we concentrate on conceptual points and open problems, referring the reader to the small set of original articles for details.

Review article for the LNCS volume in memory of Rudolf Ahlswede. 17 pages, requires Springer llncs class. V2 corrects a few annoying little errors and reports on recent progress regarding simultaneous vs non-simultaneous ID

References in corpus (7)

• Aspects of generic entanglement
• Randomizing quantum states: Constructions and applications
• Hastings' additivity counterexample via Dvoretzky's theorem
• Locking classical information
• Optimal superdense coding of entangled states
• Limitations on quantum dimensionality reduction
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels

Cited by in corpus (3)

• Secure and Robust Identification via Classical-Quantum Channels
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels