Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels
We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called an arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede’s dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity.
These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In the final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.
Unable to display preview. Download preview PDF.
- 10.Bjelaković, I., Boche, H., Nötzel, J.: Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding. Commun. Math. Phys. 292, 55–97 (2009); Bjelaković, I., Boche, H., Nötzel, J.: Erratum to ‘Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding’. Coummn. Math. Phys.Google Scholar
- 13.Csiszar, I., Körner, J.: Information Theory; Coding Theorems for Discrete Memoryless Systems. Budapest, New York: Akadémiai Kiadó, Academic Press Inc., 1981Google Scholar
- 16.Duan, R., Severini, S., Winter, A.: Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovász θ function. http://arxiv.org/abs/1002.2514v2 [quant-ph], 2010
- 19.Gilbert E.N.: A comparison of signaling alphabets. Bell System Tech. J. 31, 504–522 (1952)Google Scholar
- 24.Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics 47, Providence, RI: Amer. Math. Soc., 2002Google Scholar
- 29.Matousek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics. 212, Berlin-Heidelberg-New York: Springer, 2002Google Scholar
- 30.Milman, V.D., Schechtman, G.: Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Mathematics, 1200, Berlin-Heidelberg-New York: Springer-Verlag, 1986Google Scholar
- 31.Paulsen, V.: Completely Bounded Maps and Operator Algebras. Cambridge Studies in Advanced Mathematics 78, Cambridge: Cambridge University Press, 2002Google Scholar
- 32.Pólya G., Szegö V. Problems and Theorems in Analysis I. Berlin-Heidelberg-New York: Springer, 1998Google Scholar
- 34.Shannon, C.E.: The zero error capacity of a noisy channel. IRE Trans. Inf. Th. IT-2, 8–19 (1956)Google Scholar