Position-based coding and convex splitting for private communication over quantum channels
Position-based coding and convex splitting for private communication over quantum channels
复制标题
DOI：
10.1007/s11128-017-1718-4
复制
发表时间：
2017-03
影响因子：
2.5
通讯作者：
M. Wilde
中科院分区：
文献类型：
--
作者：
M. Wilde
经典输入量子输出（cq）窃听信道是一种涉及经典发送方、合法量子接收方和量子窃听方的通信模型。使用这种通道的私有通信协议的目标是让发送方以合法的接收方可以可靠地解码的方式传输消息，而窃听方基本上不知道传输的是哪条消息。cq窃听信道的单次私有容量等于该信道可以传输的最大比特数，使得隐私错误不大于。本文利用Anshu， Devabathini， Jain和Warsi最近发展的称为基于位置的编码和凸分裂的技术，给出了单次私有经典容量的下界。下界等于检验xandband之间互信息的假设与xande之间“交替”平滑最大信息的差值。然后，单次下界导致在无记忆cq窃听信道上私有经典通信的二阶编码速率的非平凡下界。
The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical senderX, a legitimate quantum receiverB, and a quantum eavesdropperE. The goal of a private communication protocol that uses such a channel is for the senderXto transmit a message in such a way that the legitimate receiverBcan decode it reliably, while the eavesdropperElearns essentially nothing about which message was transmitted. The-one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than. The present paper provides a lower bound on the-one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information betweenXandBand the “alternate” smooth max-information betweenXandE. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.