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:1209.6325 · Lecture notes in computer science

Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities

Igor Bjelaković, Holger Boche, Gisbert Janßen, Janis Nötzel

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

Related papers

Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels

Holger Boche, Gisbert Janßen, Stephan Kaltenstadler

arXiv:1606.09314•Quantum Information Processing•Feb 17, 2017•22 citations

Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted Communication

Paula Belzig

If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information theory in the context of compound channel models and arbitrarily varying channel models. However, a fully quantum version of system uncertainty allows for an even more challenging coding scenario with entangled channel uses. This type of model has previously been investigated for classical and quantum capacity. Here, we address the problem of entanglement-assisted capacity in the presence of such system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Intriguingly, our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero, a phenomenon that does not occur in regular single-channel coding.

arXiv:2404.08200•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•4 citations

Zero-Error Capacity of Quantum Channels

Elloá B. Guedes, Francisco de Assis, Rex A. C. Medeiros

Springer eBooks•Jan 1, 2016•9 citations

Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy

Holger Boche, Christian Deppe, Janis Nötzel +1 more

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, via a quantum version of the “elimination of of correlation” using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.

arXiv:1801.04572•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•21 citations

Zero-Error Capacity of a Quantum Channel

Rex A. C. Medeiros, Francisco de Assis

arXiv:quant-ph/0403188•Lecture notes in computer science•Jan 1, 2004•8 citations

Capacities of quantum channels and how to find them

Peter W. Shor

arXiv:quant-ph/0304102•Mathematical Programming•Jul 1, 2003•66 citations
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information theory in the context of compound channel models and arbitrarily varying channel models. However, a fully quantum version of system uncertainty allows for an even more challenging coding scenario with entangled channel uses. This type of model has previously been investigated for classical and quantum capacity. Here, we address the problem of entanglement-assisted capacity in the presence of such system uncertainty. We find that, under the assumption of a finite environment dimension, it is equal to a corresponding compound capacity. Intriguingly, our results imply that in certain fully quantum arbitrarily varying channel models, the entanglement-assisted capacity can be positive while the classical capacity is equal to zero, a phenomenon that does not occur in regular single-channel coding.
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, via a quantum version of the “elimination of of correlation” using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.