Show simple item record

dc.contributor.authorShor, Peter Williston
dc.date.accessioned2020-08-19T12:28:22Z
dc.date.available2020-08-19T12:28:22Z
dc.date.issued2019-07
dc.identifier.urihttps://hdl.handle.net/1721.1/126673
dc.description.abstractWe prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we conclude that a classical feedback channel does not improve the classical capacity of a quantum erasure channel, and by taking into account energy constraints, we conclude the same for a pure-loss bosonic channel. The method for establishing the aforementioned entropy bound involves identifying an information measure having two key properties: 1) it does not increase under a one-way local operations and classical communication channel from the receiver to the sender and 2) a quantum channel from sender to receiver cannot increase the information measure by more than the maximum output entropy of the channel. This information measure can be understood as the sum of two terms, with one corresponding to classical correlation and the other to entanglement.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1525130)en_US
dc.description.sponsorshipNational Science Foundation (U.S.). Science Technology Center for Science of Information (Grant CCF0-939370)en_US
dc.language.isoen
dc.publisherIEEEen_US
dc.relation.isversionof10.1109/ISIT.2019.8849604en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleEntropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedbacken_US
dc.typeArticleen_US
dc.identifier.citationDing, Dawei et al. “Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback.” Paper presented at the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 7-12 July 2019, IEEE © 2019 The Author(s)en_US
dc.contributor.departmentMassachusetts Institute of Technology. Center for Theoretical Physicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.relation.journal2019 IEEE International Symposium on Information Theory (ISIT)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-11-20T13:59:14Z
dspace.date.submission2019-11-20T13:59:18Z
mit.journal.volume2019en_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record