Please use this identifier to cite or link to this item: https://doi.org/10.1109/tit.2019.2915242
Title: Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
Authors: Anshu, Anurag
Jain, Rahul 
Warsi, Naqueeb Ahmad
Keywords: quant-ph
quant-ph
cs.IT
math.IT
Issue Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: Anshu, Anurag, Jain, Rahul, Warsi, Naqueeb Ahmad (2019). Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction. IEEE Transactions on Information Theory : 1-1. ScholarBank@NUS Repository. https://doi.org/10.1109/tit.2019.2915242
Abstract: We consider the problem of quantum measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Reference and Bob and she performs a measurement on her registers. She wishes to communicate the outcome of this measurement to Bob using shared randomness and classical communication, in such a way that the outcome that Bob receives is correctly correlated with Reference and Bob's own registers. Our goal is to simultaneously minimize the classical communication and randomness cost. We provide a protocol based on convex-split and position based decoding with its communication upper bounded in terms of smooth max and hypothesis testing relative entropies. We also study the randomness cost of our protocol in both one-shot and asymptotic and i.i.d. setting. By generalizing the convex-split technique to incorporate pair-wise independent random variables, we show that our one shot protocol requires small number of bits of shared randomness. This allows us to construct a new protocol in the asymptotic and i.i.d. setting, which is optimal in both the number of bits of communication and the number of bits of shared randomness required. We construct a new protocol for the task of strong randomness extraction in the presence of quantum side information. Our protocol achieves error guarantee in terms of relative entropy (as opposed to trace distance) and extracts close to optimal number of uniform bits. As an application, we provide new achievability result for the task of quantum measurement compression without feedback, in which Alice does not need to know the outcome of the measurement. This leads to the optimal number of bits communicated and number of bits of shared randomness required, for this task in the asymptotic and i.i.d. setting.
Source Title: IEEE Transactions on Information Theory
URI: https://scholarbank.nus.edu.sg/handle/10635/156684
ISSN: 0018-9448
1557-9654
DOI: 10.1109/tit.2019.2915242
Appears in Collections:Elements
Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
1703.02342v5.pdf365.02 kBAdobe PDF

OPEN

Post-printView/Download

Page view(s)

41
checked on Dec 12, 2019

Download(s)

1
checked on Dec 12, 2019

Google ScholarTM

Check

Altmetric


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