Strong converse for the classical capacity of the pure-loss bosonic channel

Strong converse for the classical capacity of the pure-loss bosonic channel This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS, then it is possible to respect this constraint with a code that operates at a rate g(ηNS/(1-p)) where p is the code error probability, η is the channel transmissivity, and g(x) is the entropy of a bosonic thermal state with mean photon number x. Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS, so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Strong converse for the classical capacity of the pure-loss bosonic channel

Loading next page...
 
/lp/springer_journal/strong-converse-for-the-classical-capacity-of-the-pure-loss-bosonic-L4JJgp000Y
Publisher
Pleiades Publishing
Copyright
Copyright © 2014 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S003294601402001X
Publisher site
See Article on Publisher Site

Abstract

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [1]. In particular, we first prove that there exists a trade-off between communication rate and error probability if one imposes only a mean photon number constraint on the channel inputs. That is, if we demand that the mean number of photons at the channel input cannot be any larger than some positive number NS, then it is possible to respect this constraint with a code that operates at a rate g(ηNS/(1-p)) where p is the code error probability, η is the channel transmissivity, and g(x) is the entropy of a bosonic thermal state with mean photon number x. Then we prove that a strong converse theorem holds for the classical capacity of this channel (that such a rate-error trade-off cannot occur) if one instead demands for a maximum photon number constraint, in such a way that mostly all of the “shadow” of the average density operator for a given code is required to be on a subspace with photon number no larger than nNS, so that the shadow outside this subspace vanishes as the number n of channel uses becomes large. Finally, we prove that a small modification of the well-known coherent-state coding scheme meets this more demanding constraint.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jul 16, 2014

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off