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

IEEE International Symposium on Information Theory (ISIT)

Capacity of Quantum Arbitrarily Varying Channels

Rudolf Ahlswede, Vladimir M. Blinovsky

Published Jul 1, 2006• 0 citations
Publisher

Abstract

We prove that the average error capacity Cqof a quantum arbitrarily varying channel (QAVC) equals 0 or else the random code capacity lowbarC (Ahlswede's dichotomy). We also establish a necessary and sufficient condition for Cq> 0
DOI
10.1109/isit.2006.261710

Related papers

Classical Capacity of Classical-Quantum Arbitrarily Varying Channels

Rudolf Ahlswede, Vladimir M. Blinovsky

We prove that the average error classical capacity C(W) of a classicalquantum arbitrarily varying channel (cq-AVC) W equals 0 or else the random code capacity C (Ahlswede's dichotomy). We also establish a necessary and sufficient condition for C(W)>0

IEEE Transactions on Information Theory•Jan 23, 2007•47 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

Entanglement transmission over arbitrarily varying quantum channels

Rudolf Ahlswede, Igor Bjelaković, Holger Boche +1 more

We derive a regularized formula for the common randomness assisted entanglement transmission capacity of finite arbitrarily varying quantum channels (AVQC's). For finite AVQC's with positive capacity for classical message transmission we show, by derandomization through classical forward communication, that the random capacity for entanglement transmission equals the deterministic capacity for entanglement transmission. This is a quantum version of the famous Ahlswede dichotomy. In the infinite case, we derive a similar result for certain classes of AVQC's. At last, we give two possible definitions of symmetrizability of an AVQC.

arXiv:1004.5551•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•3 citations

Classical-quantum arbitrarily varying wiretap channel—A capacity formula with Ahlswede Dichotomy—Resources

Holger Boche, Minglai Cai, Christian Deppe

We establish the Ahlswede Dichotomy for arbitrarily varying classical-quantum wiretap channels, i.e., either the deterministic secrecy capacity of an arbitrarily varying classical-quantum wiretap channel is zero, or it equals its randomness assisted secrecy capacity. We analyze the secrecy capacity of arbitrarily varying classical-quantum wiretap channels when the sender and the receiver use various resources. It turns out that having randomness, common randomness, and correlation as resources are very helpful for achieving a positive deterministic secrecy capacity of arbitrarily varying classical-quantum wiretap channels. We prove the phenomenon “super-activation” for arbitrarily varying classical-quantum wiretap channels, i.e., two arbitrarily varying classical-quantum wiretap channels, both with zero deterministic secrecy capacity, if used together allow perfect secure transmission.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•1 citation

Quantum communication under channel uncertainty

Janis Nötzel

This work contains results concerning transmission of entanglement and subspaces as well as generation of entanglement in the limit of arbitrary many uses of compound- and arbitrarily varying quantum channels (CQC, AVQC). In both cases, the channel is described by a set of memoryless channels. Only forward communication between one sender and one receiver is allowed. A code is said to be „good“ only, if it is „good“ for every channel out of the set. Both settings describe a scenario, in which sender and receiver have only limited channel knowledge. For different amounts of information about the channel available to sender or receiver, coding theorems are proven for the CQC. For the AVQC, both deterministic and randomised coding schemes are considered. Coding theorems are proven, as well as a quantum analogue of the Ahlswede-dichotomy. The connection to zero-error capacities of stationary memoryless quantum channels is investigated. The notion of symmetrisability is defined and used for both classes of channels.

•Jan 1, 2012•0 citations

Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation

Holger Boche, Minglai Cai, Janis Nötzel +1 more

We determine the secrecy capacities of arbitrarily varying quantum channels (AVQCs). Both secrecy capacities with average error probability and with maximal error probability are derived. Both derivations are based on one common code construction. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. As an application of our result for secret message transmission over AVQCs, we determine when the secrecy capacity is a continuous function of the system parameters and completely characterize its discontinuity points both for average error criterion and for maximal error criterion. Furthermore, we prove the phenomenon “superactivation” for secrecy capacities of arbitrarily varying quantum channels, i.e., two quantum channels both with zero secrecy capacity, which, if used together, allow secure transmission with positive capacity. We give therewith an answer to the question “When is the secrecy capacity a continuous function of the system parameters?,” which has been listed as an open problem in quantum information problem page of the Institut für Theoretische Physik (ITP) Hannover. We also discuss the relations between the entanglement distillation capacity, the entanglement generating capacity, and the strong subspace transmission capacity for AVQCs. Ahlswede et al. made in 2013 the conjecture that the entanglement generating capacity of an AVQC is equal to its entanglement generating capacity under shared randomness assisted quantum coding. We demonstrate that the validity of this conjecture implies that the entanglement generating capacity, the entanglement distillation capacity, and the strong subspace transmission capacity of an AVQC are continuous functions of the system parameters. Consequently, under the premise of this conjecture, the secrecy capacities of an AVQC differ significantly from the general quantum capacities.

arXiv:1712.05702•Journal of Mathematical Physics•Jun 1, 2019•12 citations
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.
We derive a regularized formula for the common randomness assisted entanglement transmission capacity of finite arbitrarily varying quantum channels (AVQC's). For finite AVQC's with positive capacity for classical message transmission we show, by derandomization through classical forward communication, that the random capacity for entanglement transmission equals the deterministic capacity for entanglement transmission. This is a quantum version of the famous Ahlswede dichotomy. In the infinite case, we derive a similar result for certain classes of AVQC's. At last, we give two possible definitions of symmetrizability of an AVQC.
We establish the Ahlswede Dichotomy for arbitrarily varying classical-quantum wiretap channels, i.e., either the deterministic secrecy capacity of an arbitrarily varying classical-quantum wiretap channel is zero, or it equals its randomness assisted secrecy capacity. We analyze the secrecy capacity of arbitrarily varying classical-quantum wiretap channels when the sender and the receiver use various resources. It turns out that having randomness, common randomness, and correlation as resources are very helpful for achieving a positive deterministic secrecy capacity of arbitrarily varying classical-quantum wiretap channels. We prove the phenomenon “super-activation” for arbitrarily varying classical-quantum wiretap channels, i.e., two arbitrarily varying classical-quantum wiretap channels, both with zero deterministic secrecy capacity, if used together allow perfect secure transmission.
This work contains results concerning transmission of entanglement and subspaces as well as generation of entanglement in the limit of arbitrary many uses of compound- and arbitrarily varying quantum channels (CQC, AVQC). In both cases, the channel is described by a set of memoryless channels. Only forward communication between one sender and one receiver is allowed. A code is said to be „good“ only, if it is „good“ for every channel out of the set. Both settings describe a scenario, in which sender and receiver have only limited channel knowledge. For different amounts of information about the channel available to sender or receiver, coding theorems are proven for the CQC. For the AVQC, both deterministic and randomised coding schemes are considered. Coding theorems are proven, as well as a quantum analogue of the Ahlswede-dichotomy. The connection to zero-error capacities of stationary memoryless quantum channels is investigated. The notion of symmetrisability is defined and used for both classes of channels.
We determine the secrecy capacities of arbitrarily varying quantum channels (AVQCs). Both secrecy capacities with average error probability and with maximal error probability are derived. Both derivations are based on one common code construction. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. As an application of our result for secret message transmission over AVQCs, we determine when the secrecy capacity is a continuous function of the system parameters and completely characterize its discontinuity points both for average error criterion and for maximal error criterion. Furthermore, we prove the phenomenon “superactivation” for secrecy capacities of arbitrarily varying quantum channels, i.e., two quantum channels both with zero secrecy capacity, which, if used together, allow secure transmission with positive capacity. We give therewith an answer to the question “When is the secrecy capacity a continuous function of the system parameters?,” which has been listed as an open problem in quantum information problem page of the Institut für Theoretische Physik (ITP) Hannover. We also discuss the relations between the entanglement distillation capacity, the entanglement generating capacity, and the strong subspace transmission capacity for AVQCs. Ahlswede et al. made in 2013 the conjecture that the entanglement generating capacity of an AVQC is equal to its entanglement generating capacity under shared randomness assisted quantum coding. We demonstrate that the validity of this conjecture implies that the entanglement generating capacity, the entanglement distillation capacity, and the strong subspace transmission capacity of an AVQC are continuous functions of the system parameters. Consequently, under the premise of this conjecture, the secrecy capacities of an AVQC differ significantly from the general quantum capacities.