Please use this identifier to cite or link to this item: https://doi.org/10.1063/1.5039796
DC FieldValue
dc.titleOn the near-optimality of one-shot classical communication over quantum channels
dc.contributor.authorAnshu, Anurag
dc.contributor.authorRAHUL JAIN
dc.contributor.authorNAQUEEB AHMAD WARSI
dc.date.accessioned2019-09-25T04:00:26Z
dc.date.available2019-09-25T04:00:26Z
dc.date.issued2019-01-01
dc.identifier.citationAnshu, Anurag, RAHUL JAIN, NAQUEEB AHMAD WARSI (2019-01-01). On the near-optimality of one-shot classical communication over quantum channels. JOURNAL OF MATHEMATICAL PHYSICS 60 (1) : 012204. ScholarBank@NUS Repository. https://doi.org/10.1063/1.5039796
dc.identifier.issn0022-2488
dc.identifier.issn1089-7658
dc.identifier.urihttps://scholarbank.nus.edu.sg/handle/10635/159545
dc.description.abstract© 2019 Author(s). We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assisted and unassisted cases for the point to point quantum channel, the quantum multiple-access channel, the quantum channel with a state, and the quantum broadcast channel. We show that it is possible to near-optimally characterize the amount of communication that can be transmitted in these scenarios, using the position-based decoding strategy introduced in a prior study (A. Anshu, R. Jain, and N. Warsi, https://ieee.org/document/8399830). In the process, we provide a short and elementary proof of the converse for entanglement-assisted quantum channel coding in terms of the quantum hypothesis testing divergence [obtained earlier in the work of W. Matthews and S. Wehner, IEEE Trans. Inf. Theory 60, 7317-7329 (2014)]. Our proof has the additional utility that it naturally extends to various network scenarios mentioned above. Furthermore, none of our achievability results require a simultaneous decoding strategy, existence of which is an important open question in quantum Shannon theory.
dc.language.isoen
dc.publisherAMER INST PHYSICS
dc.sourceElements
dc.subjectScience & Technology
dc.subjectPhysical Sciences
dc.subjectPhysics, Mathematical
dc.subjectPhysics
dc.subjectENTANGLEMENT-ASSISTED CAPACITY
dc.subjectCONVERSE BOUNDS
dc.subjectCODING THEOREM
dc.typeArticle
dc.date.updated2019-09-25T03:47:56Z
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.contributor.departmentDEPT OF COMPUTER SCIENCE
dc.description.doi10.1063/1.5039796
dc.description.sourcetitleJOURNAL OF MATHEMATICAL PHYSICS
dc.description.volume60
dc.description.issue1
dc.description.page012204
dc.published.statePublished
Appears in Collections:Elements
Staff Publications

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
1804.09644v1.pdf283.73 kBAdobe PDF

OPEN

Post-printView/Download

Page view(s)

52
checked on Jan 23, 2020

Download(s)

1
checked on Jan 23, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.