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:1211.4774

Gaussian classical-quantum channels: gain of entanglement-assistance

Alexander Semenovich Holevo

Published Nov 20, 2012• 2 citations
arXivHTMLPDF

Abstract

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C_{ea}=C (where C is the unassisted capacity) for certain class of c-q Gaussian channel under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality C

DOI
10.48550/arxiv.1211.4774

Related papers

Gaussian classical-quantum channels: Gain from entanglement-assistance

Alexander Semenovich Holevo

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; embedding of the classical input in quantum input is always possible, and therefore the classical entanglement-assisted capacity C ea under an appropriate input constraint is well defined. We prove the general property of entropy increase for a weak complementary channel, which implies the equality C = C ea (where C is the unassisted capacity) for a certain class of c-q Gaussian channels under an appropriate energy-type constraint. On the other hand, we show by an explicit example that the inequality C < C ea is not unusual for constrained c-q Gaussian channel.

Problems of Information Transmission•Jan 1, 2014•2 citations

Capacities of Gaussian classical-quantum channels

Alexander Semenovich Holevo

In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity Ceaunder appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C = Cea(where C is the unassisted capacity) for certain class of c-q Gaussian channels under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality Ceais not unusual for constrained c-q Gaussian channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2013•0 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•53 citations

Entanglement-assisted capacity of constrained channels

A. S. Holevo

In this paper we fil a gap in previous work by proving the conjectured formula for the antanglement-assisted capacity of quantum channel with additive input constraint (such as Bosonic Gaussian channel). The main tools are the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for the entanglement-assisted capacity.

arXiv:quant-ph/0211170•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•24 citations

Information capacities of quantum measurement channels

Alexander Semenovich Holevo

We study the relation between the unassisted and entanglement-assisted classical capacities C and C ea of entanglement-breaking channels. We argue that the gain of entanglement assistance C ea / C > 1 generically for measurement channels with unsharp observables; in particular for the measurements with pure posterior states the information loss in the entanglement-assisted protocol is zero, resulting in an arbitrarily large gain for very noisy or weak signal channels. This is illustrated by examples of continuous observables corresponding to state tomography in finite dimensions and heterodyne measurement. In contrast, state preparations are characterized by the property of having no gain of entanglement assistance, C ea / C = 1.

Physica Scripta•Mar 1, 2013•8 citations

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem

C. H. Bennett, Peter W. Shor, John A. Smolin +1 more

The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.

arXiv:quant-ph/0106052•IEEE Transactions on Information Theory•Oct 1, 2002•698 citations
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C_{ea}=C (where C is the unassisted capacity) for certain class of c-q Gaussian channel under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality C
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; embedding of the classical input in quantum input is always possible, and therefore the classical entanglement-assisted capacity C ea under an appropriate input constraint is well defined. We prove the general property of entropy increase for a weak complementary channel, which implies the equality C = C ea (where C is the unassisted capacity) for a certain class of c-q Gaussian channels under an appropriate energy-type constraint. On the other hand, we show by an explicit example that the inequality C < C ea is not unusual for constrained c-q Gaussian channel.
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity Ceaunder appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C = Cea(where C is the unassisted capacity) for certain class of c-q Gaussian channels under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality Ceais not unusual for constrained c-q Gaussian channel.
We study the relation between the unassisted and entanglement-assisted classical capacities C and C ea of entanglement-breaking channels. We argue that the gain of entanglement assistance C ea / C > 1 generically for measurement channels with unsharp observables; in particular for the measurements with pure posterior states the information loss in the entanglement-assisted protocol is zero, resulting in an arbitrarily large gain for very noisy or weak signal channels. This is illustrated by examples of continuous observables corresponding to state tomography in finite dimensions and heterodyne measurement. In contrast, state preparations are characterized by the property of having no gain of entanglement assistance, C ea / C = 1.
The entanglement-assisted classical capacity of a noisy quantum channel (C/sub E/) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity C/sub E/ is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs /spl rho/, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of /spl rho/ after half of it has passed through the channel. We calculate entanglement-assisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglement-assisted communication - communication over a discrete memoryless channel (DMC) between parties who share prior random information - we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency.