Strong Converse for Identification via Quantum Channels

Simple item page
dc.creatorAhlswede, R.
dc.creatorWinter, A.
dc.date2000-12-22
dc.date2001-10-22
dc.date.accessioned2026-07-07T06:01:24Z
dc.date.available2026-07-07T06:01:24Z
dc.descriptionIn this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in selfadjoint operators on a Hilbert space. This theory is presented separately in an appendix, and we illustrate it by showing its application to quantum generalizations of classical hypergraph covering problems.
dc.description11 pages, LaTeX2e, requires IEEEtran2e.cls. Some errors and omissions corrected, references updated
dc.identifierhttps://arxiv.org/abs/quant-ph/0012127
dc.identifierhttp://arxiv.org/abs/quant-ph/0012127
dc.identifierIEEE Trans. Inf. Theory 48(3) :569--579, 2002. Addendum ibid 49(1):346, 2003.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89249
dc.subjectQuantum Physics
dc.titleStrong Converse for Identification via Quantum Channels
dc.typetext

Files

Collections

arXiv