期刊
PHYSICAL REVIEW LETTERS
卷 113, 期 3, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.113.030502
关键词
-
资金
- NSERC
- DAS
- CRC
- CIFAR
- NSF [CCF-1110961, CCF-1111382]
- DARPA QUEST
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [1110941] Funding Source: National Science Foundation
Privacy is a fundamental feature of quantum mechanics. A coherently transmitted quantum state is inherently private. Remarkably, coherent quantum communication is not a prerequisite for privacy: there are quantum channels that are too noisy to transmit any quantum information reliably that can nevertheless send private classical information. Here, we ask how much private classical information a channel can transmit if it has little quantum capacity. We present a class of channels N-d with input dimension d(2), quantum capacity Q(N-d) <= 1, and private capacity P(N-d) = log d. These channels asymptotically saturate an interesting inequality P(N) <= (1/2) [log d(A) + Q(N)] for any channel N with input dimension d(A) and capture the essence of privacy stripped of the confounding influence of coherence.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据