Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/146923
Title: ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS
Authors: ANURAG ANSHU
Keywords: Quantum Information, Source compression, Channel coding, Entanglement assistance, Expected communication, Lower bounds
Issue Date: 15-May-2018
Citation: ANURAG ANSHU (2018-05-15). ONE-SHOT PROTOCOLS FOR COMMUNICATION OVER QUANTUM NETWORKS: ACHIEVABILITY AND LIMITATIONS. ScholarBank@NUS Repository.
Abstract: This thesis studies the problems of source compression and channel coding in the one-shot entanglement-assisted quantum setting. The main contribution of the first part of the thesis is to systematically develop one-shot protocols for various quantum tasks, using two unified tools of `convex-split' and `position-based decoding'. Convex-split is used for the encoding operations and position-based decoding, which can also be viewed as a dual to the convex-split, is used for decoding operation. Our protocols and achievability results closely resemble the corresponding protocols and results in the classical case. Furthermore, position-based decoding gives near optimal one-shot results for the point to point channel. In the second part of the thesis, we exhibit some limitations on how well quantum messages can be compressed. We show that efficient classical schemes, such as the Huffman coding scheme, are not possible in the quantum domain. As a complementary result, we show an exponential separation between quantum communication complexity and quantum information complexity. This shows the existence of a hard to compress interactive quantum protocol.
URI: http://scholarbank.nus.edu.sg/handle/10635/146923
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
AnshuA.pdf1.42 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

149
checked on Nov 20, 2020

Download(s)

69
checked on Nov 20, 2020

Google ScholarTM

Check


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