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

Quantum capacity for a compound channel with memory

Antonio D’Arrigo, Paladino, falci, Elena De Leo

Published Jan 1, 2009• 0 citations
OpenAlex

Related papers

Quantum capacity of an amplitude-damping channel with memory

Rabia Jahangir, Nigum Arshed, A. H. Toor

arXiv:1207.5612•Quantum Information Processing•Nov 28, 2014•15 citations

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

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

Igor Bjelaković, Holger Boche, Gisbert Janßen +1 more

arXiv:1209.6325•Lecture notes in computer science•Jan 1, 2013•39 citations

Quantum capacity of a class of compound channels

Igor Bjelaković, Holger Boche, Janis Nötzel

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider a memoryless communication scenario with channel uncertainty which is an analog of the compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with an informed decoder. Our approach in the finite case is based on the observation that perfect channel knowledge at the decoder does not increase the capacity of finite quantum compound channels. As a consequence, we obtain a coding theorem for finite quantum averaged channels, the simplest class of channels with long-term memory. The extension of these results to quantum compound channels with uninformed encoder and decoder and infinitely many constituents remains an open problem.

arXiv:0808.1007•Physical Review A•Oct 28, 2008•25 citations

Quantum Channel Capacities

John Watrous

Cambridge University Press eBooks•May 17, 2018•5 citations

Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels

Minglai Cai, Ning Cai, Christian Deppe

We determine the capacity of the classical compound quantum wiretapper channel with channel state information at the transmitter. Moreover we derive a lower bound on the capacity of this channel without channel state information and determine the capacity of the classical quantum compound wiretap channel with channel state information at the transmitter.

arXiv:1202.0773•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•6 citations
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider a memoryless communication scenario with channel uncertainty which is an analog of the compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with an informed decoder. Our approach in the finite case is based on the observation that perfect channel knowledge at the decoder does not increase the capacity of finite quantum compound channels. As a consequence, we obtain a coding theorem for finite quantum averaged channels, the simplest class of channels with long-term memory. The extension of these results to quantum compound channels with uninformed encoder and decoder and infinitely many constituents remains an open problem.