Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1212.0494 · Lecture notes in computer science

Identification via Quantum Channels

Andreas Winter

Published Jan 1, 2013• 12 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-36899-8_9

Related papers

Quantum Channel Identification Problem

Akio Fujiwara

WORLD SCIENTIFIC eBooks•Feb 1, 2005•5 citations

On “Quantum and Classical Message Identification via Quantum Channels”

Andreas Winter

Quantum Information and Computation•Nov 1, 2005•23 citations

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

Andreas Winter

Lecture notes in computer science•Jan 1, 2006•12 citations

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

Andreas Winter

Electronic Notes in Discrete Mathematics•Aug 1, 2005•5 citations

Zero-Entropy Encoders and Simultaneous Decoders in Identification via Quantum Channels

Pau Colomer, Christian Deppe, Holger Boche +1 more

Lecture notes in computer science•Jan 1, 2025•1 citation

Secure and Robust Identification via Classical-Quantum Channels

Holger Boche, Christian Deppe, Andreas Winter

We study the identification capacity of classical-quantum channels (“cq-channels”) under channel uncertainty and privacy constraints. To be precise, we first consider compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper by considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case (without privacy), we find the identification capacity always equal to the transmission capacity. In the second case, we find a dichotomy: either the secrecy capacity (also known as private capacity) of the channel is zero, and then the secrecy identification capacity is also zero, or the secrecy capacity is positive and then the secrecy identification capacity equals the transmission capacity of the main channel without the wiretapper. We perform the same analysis for the case of arbitrarily varying wiretap cqq-channels (cqq-AVWC) with analogous findings, and make several observations regarding the continuity and super-additivity of the identification capacity in the latter case.

arXiv:1801.09967•IEEE Transactions on Information Theory•Jun 5, 2019•24 citations
We study the identification capacity of classical-quantum channels (“cq-channels”) under channel uncertainty and privacy constraints. To be precise, we first consider compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper by considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case (without privacy), we find the identification capacity always equal to the transmission capacity. In the second case, we find a dichotomy: either the secrecy capacity (also known as private capacity) of the channel is zero, and then the secrecy identification capacity is also zero, or the secrecy capacity is positive and then the secrecy identification capacity equals the transmission capacity of the main channel without the wiretapper. We perform the same analysis for the case of arbitrarily varying wiretap cqq-channels (cqq-AVWC) with analogous findings, and make several observations regarding the continuity and super-additivity of the identification capacity in the latter case.