arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.1366quant-phcs.CCcs.ITmath.IT
收藏

新的一次性量子协议及其在通信复杂性中的应用

New one shot quantum protocols with application to communication complexity

Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao

摘要:

本文提出了如下量子压缩协议:P:设$ρ,σ$是满足$S(ρ|| σ) = \text{Tr} (ρ\log ρ- ρ\log σ)$的量子态,即$ρ$和$σ$之间的相对熵是有限的.爱丽丝知道了$ρ$的特征分解。Bob了解了$σ$的特征分解。Alice和Bob都知道$S(ρ|| σ)$和错误参数$ε$。Alice和Bob使用共享纠缠,并且在从Alice向Bob传送$\mathcal{O}((S(ρ|| σ)+1)/ε^4)$比特之后,Bob最终得到量子状态$\tildeρ$,使得$F(ρ, \tildeρ) \geq 1 - 5ε$,其中$F(\cdot)$表示保真度。该结果可以被认为是Braverman和Rao [2011]的结果的非交换推广,其中他们考虑了当$ρ$和$σ$是经典概率分布(或彼此交换)并且使用共享随机性而不是共享纠缠时的特殊情况。利用P,我们得到了Jain,Radhakrishnan和Sen [2005,2008]首次证明的纠缠辅助量子单向通信复杂度的直和结果的另一种证明.我们还提出了协议P的一个变体,其中鲍勃与爱丽丝的状态有一些边信息。我们表明,在这种情况下,通信量可以进一步减少,基于边信息,鲍勃。我们的第二个结果提供了广泛使用的经典相关采样协议的量子模拟。例如,Holenstein [2007]在证明两人单轮游戏的平行重复定理时使用了经典的相关采样协议。

英文摘要:

In this paper we present the following quantum compression protocol: P : Let $ρ,σ$ be quantum states such that $S(ρ|| σ) = \text{Tr} (ρ\log ρ- ρ\log σ)$, the relative entropy between $ρ$ and $σ$, is finite. Alice gets to know the eigen-decomposition of $ρ$. Bob gets to know the eigen-decomposition of $σ$. Both Alice and Bob know $S(ρ|| σ)$ and an error parameter $ε$. Alice and Bob use shared entanglement and after communication of $\mathcal{O}((S(ρ|| σ)+1)/ε^4)$ bits from Alice to Bob, Bob ends up with a quantum state $\tildeρ$ such that $F(ρ, \tildeρ) \geq 1 - 5ε$, where $F(\cdot)$ represents fidelity. This result can be considered as a non-commutative generalization of a result due to Braverman and Rao [2011] where they considered the special case when $ρ$ and $σ$ are classical probability distributions (or commute with each other) and use shared randomness instead of shared entanglement. We use P to obtain an alternate proof of a direct-sum result for entanglement assisted quantum one-way communication complexity for all relations, which was first shown by Jain, Radhakrishnan and Sen [2005,2008]. We also present a variant of protocol P in which Bob has some side information about the state with Alice. We show that in such a case, the amount of communication can be further reduced, based on the side information that Bob has. Our second result provides a quantum analogue of the widely used classical correlated-sampling protocol. For example, Holenstein [2007] used the classical correlated-sampling protocol in his proof of a parallel-repetition theorem for two-player one-round games.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑