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:1004.0458 · Quantum Information Processing

The quantum dynamic capacity formula of a quantum channel

Mark M. Wilde, Min-Hsiu Hsieh

Published Sep 23, 2011• 62 citations
arXivHTMLPDF
DOI
10.1007/s11128-011-0310-6

Related papers

Note on quantum capacity in quantum amplifier channel

Shigeru Furuichi, Kunio Oshima

Nonlinear Analysis•Aug 1, 2001•0 citations

Trade-off coding for universal qudit cloners motivated by the Unruh effect

Tomas Jochym-O’Connor, Kamil Brádler, Mark M. Wilde

A 'triple trade-off' capacity region of a noisy quantum channel provides a more complete description of its capabilities than does a single capacity formula. However, few full descriptions of a channel's ability have been given due to the difficult nature of the calculation of such regions—it may demand an optimization of information-theoretic quantities over an infinite number of channel uses. This work analyses the d -dimensional Unruh channel, a noisy quantum channel which emerges in relativistic quantum information theory. We show that this channel belongs to the class of quantum channels whose capacity region requires an optimization over a single channel use, and as such is tractable. We determine two triple-trade off regions, the quantum dynamic capacity region and the private dynamic capacity region, of the d -dimensional Unruh channel. Our results show that the set of achievable rate triples using this coding strategy is larger than the set achieved using a time-sharing strategy. Furthermore, we prove that the Unruh channel has a distinct structure made up of universal qudit cloning channels, thus providing a clear relationship between this relativistic channel and the process of stimulated emission present in quantum optical amplifiers.

arXiv:1103.0286•Journal of Physics A Mathematical and Theoretical•Sep 23, 2011•12 citations

Entanglement-Assisted Capacities of Constrained Quantum Channels

Alexander Semenovich Holevo

In this paper we fill a gap in previous works by proving the conjectured formula for the classical entanglement-assisted capacity of a quantum channel with additive constraint (such as the Bosonic Gaussian channel). Our main tools are the coding theorem for classical-quantum constrained channels and a finite-dimensional approximation of the input density operators for entanglement-assisted capacity. We also give sufficient conditions under which suprema in the capacity formulas are achieved.

Theory of Probability and Its Applications•Jan 1, 2004•51 citations

Capacity of a quantum communication channel

Alexander Semenovich Holevo

•Jan 1, 1979•50 citations

Capacities of quantum channels and how to find them

Peter W. Shor

arXiv:quant-ph/0304102•Mathematical Programming•Jul 1, 2003•66 citations

The classical capacity achievable by a quantum channel assisted by limited entanglement

Peter W. Shor

We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.

arXiv:quant-ph/0402129•Quantum Information and Computation•Dec 1, 2004•60 citations
A 'triple trade-off' capacity region of a noisy quantum channel provides a more complete description of its capabilities than does a single capacity formula. However, few full descriptions of a channel's ability have been given due to the difficult nature of the calculation of such regions—it may demand an optimization of information-theoretic quantities over an infinite number of channel uses. This work analyses the d -dimensional Unruh channel, a noisy quantum channel which emerges in relativistic quantum information theory. We show that this channel belongs to the class of quantum channels whose capacity region requires an optimization over a single channel use, and as such is tractable. We determine two triple-trade off regions, the quantum dynamic capacity region and the private dynamic capacity region, of the d -dimensional Unruh channel. Our results show that the set of achievable rate triples using this coding strategy is larger than the set achieved using a time-sharing strategy. Furthermore, we prove that the Unruh channel has a distinct structure made up of universal qudit cloning channels, thus providing a clear relationship between this relativistic channel and the process of stimulated emission present in quantum optical amplifiers.
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.