arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.00155quant-ph
收藏

量子随机存取码中Bloch空间的几何性质

The geometry of Bloch space in the context of quantum random access codes

Laura Mančinska, Sigurd A. L. Storgaard

摘要:

我们研究的通信协议称为量子随机存取码(QRAC),它编码$n$经典位到$m$量子位($m<n$)的概率恢复任何初始的$n$位至少$p>\tfrac{1}{2}$。这种代码由$(n,m,p)$ -QRAC表示。如果允许通过共享随机字符串进行合作,我们称之为具有共享随机性的QRAC。我们证明了对于任何具有共享随机性的$(n,m,p)$,参数$p$的上界是由$ \tfrac{1}{2}+\tfrac{1}{2}\sqrt{\tfrac{2^{m-1}}{n}}$给出的.对于$m=2$,这给出了$p\le \tfrac{1}{2}+\tfrac{1}{\sqrt{2n}}$的一个新的界,证实了Imamichi和Raymond(AQIS'18)的一个猜想。我们的界限意味着,以前已知的分析结构的$(3,2,\tfrac{1}{2}+\tfrac{1}{\sqrt{6}})$ -,$(4,2,\tfrac{1}{2}+\tfrac{1}{2\sqrt{2}})$ -和$(6,2,\tfrac{1}{2}+\tfrac{1}{2\sqrt{3}})$ -QRAC是最佳的。为了得到我们的界限,我们调查的几何量子态的布洛赫矢量表示,并利用几何解释的事实,任何两个量子态有一个非负的重叠。

英文摘要:

We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes $n$ classical bits into $m$ qubits ($m<n$) with a probability of recovering any of the initial $n$ bits of at least $p>\tfrac{1}{2}$. Such a code is denoted by $(n,m,p)$-QRAC. If cooperation is allowed through a shared random string we call it a QRAC with shared randomness. We prove that for any $(n,m,p)$-QRAC with shared randomness the parameter $p$ is upper bounded by $ \tfrac{1}{2}+\tfrac{1}{2}\sqrt{\tfrac{2^{m-1}}{n}}$. For $m=2$ this gives a new bound of $p\le \tfrac{1}{2}+\tfrac{1}{\sqrt{2n}}$ confirming a conjecture by Imamichi and Raymond (AQIS'18). Our bound implies that the previously known analytical constructions of $(3,2,\tfrac{1}{2}+\tfrac{1}{\sqrt{6}})$- , $(4,2,\tfrac{1}{2}+\tfrac{1}{2\sqrt{2}})$- and $(6,2,\tfrac{1}{2}+\tfrac{1}{2\sqrt{3}})$-QRACs are optimal. To obtain our bound we investigate the geometry of quantum states in the Bloch vector representation and make use of a geometric interpretation of the fact that any two quantum states have a non-negative overlap.

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

↑