Identification Via Quantum Channels
arXiv:1212.0494 · doi:10.1007/978-3-642-36899-8_9
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.
arXiv commentReview 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 (13)
- Quantum fingerprinting
- User-friendly tail bounds for sums of random matrices
- Aspects of generic entanglement
- Randomizing quantum states: Constructions and applications
- Quantum Reverse Shannon Theorem
- Hastings' additivity counterexample via Dvoretzky's theorem
- Locking classical information
- Optimal superdense coding of entangled states
- Approximate quantum error correction
- Limitations on quantum dimensionality reduction
- Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
- Quantum Channels and Simultaneous ID Coding
- Approximate Quantum Error Correction via Complementary Observables