Building Blocks for Communication Over Noisy Quantum Networks

被引:42
作者
Anshu, Anurag [1 ]
Jain, Rahul [2 ,3 ,4 ]
Warsi, Naqueeb Ahmad [1 ,5 ,6 ,7 ]
机构
[1] Natl Univ Singapore, Ctr Quantum Technol, Singapore 117543, Singapore
[2] Natl Univ Singapore, Dept Comp Sci, Ctr Quantum Technol, Singapore 117543, Singapore
[3] CNRS UNS NUS NTU Int Joint Res Unit, MajuLab, UMI 3654, Singapore, Singapore
[4] Tata Inst Fundamental Res, Sch Technol & Comp Sci, Mumbai 400005, Maharashtra, India
[5] Nanyang Technol Univ, Sch Phys & Math Sci, Singapore 117543, Singapore
[6] Indraprastha Inst Informat Technol Delhi, Dept Elect & Commun Engn, New Delhi 110020, India
[7] Indraprastha Inst Informat Technol Delhi, Dept Appl Math, New Delhi 110020, India
基金
新加坡国家研究基金会;
关键词
Channel coding; quantum entanglement; quantum mechanics; 2ND-ORDER ASYMPTOTICS; CODING THEOREM; CAPACITY; INFORMATION; CONVERSE; CHANNELS; STATE;
D O I
10.1109/TIT.2018.2851297
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information-theoretic question is very well studied specially in the setting of many independent uses of the channel. An important scenario, both from practical and conceptual point of view, is when the channel can be used only once. This is known as the one-shot channel coding problem. We provide a tight characterization of the one-shot entanglement-assisted classical capacity of a quantum channel. We arrive at our result by introducing a simple decoding technique which we refer to as position-based decoding. We also consider two other important quantum network scenarios: quantum channel with a jammer and quantum broadcast channel. For these problems, we use the recently introduced convex split technique in addition to position-based decoding. Our approach exhibits that the simultaneous use of these two techniques provides a uniform and conceptually simple framework for designing communication protocols for quantum networks.
引用
收藏
页码:1287 / 1306
页数:20
相关论文
共 64 条
[31]   General formulas for capacity of classical-quantum channels [J].
Hayashi, M ;
Nagaoka, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) :1753-1768
[33]   The capacity of the quantum channel with general signal states [J].
Holevo, AS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :269-273
[34]   A lower bound for the bounded round quantum communication complexity of set disjointness [J].
Jain, R ;
Radhakrishnan, J ;
Sen, P .
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, :220-229
[35]   A Property of Quantum Relative Entropy with an Application to Privacy in Quantum Communication [J].
Jain, Rahul ;
Radhakrishnan, Jaikumar ;
Sen, Pranab .
JOURNAL OF THE ACM, 2009, 56 (06)
[36]   FIDELITY FOR MIXED QUANTUM STATES [J].
JOZSA, R .
JOURNAL OF MODERN OPTICS, 1994, 41 (12) :2315-2323
[37]   IRREVERSIBILITY AND HEAT GENERATION IN THE COMPUTING PROCESS [J].
LANDAUER, R .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1961, 5 (03) :183-191
[38]   SECOND-ORDER ASYMPTOTICS FOR QUANTUM HYPOTHESIS TESTING [J].
Li, Ke .
ANNALS OF STATISTICS, 2014, 42 (01) :171-189
[39]   COMPLETELY POSITIVE MAPS AND ENTROPY INEQUALITIES [J].
LINDBLAD, G .
COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1975, 40 (02) :147-151
[40]   Unconditional security of quantum key distribution over arbitrarily long distances [J].
Lo, HK ;
Chau, HF .
SCIENCE, 1999, 283 (5410) :2050-2056