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

集体噪声下的高效量子通信

Efficient quantum communication under collective noise

Michael Skotiniotis, Wolfgang Dür, Barbara Kraus

摘要:

针对集体噪声下量子信息的传输,提出了一种新的量子通信协议.我们的协议利用了一个消相干的子空间,在这样一种方式,实现了最佳的渐近传输速率,而在同一时间的编码和解码操作可以有效地实现。编码和解码电路需要多个基本门,这些基本门与传输的qudit的数量m成线性比例。我们的编码和解码操作的逻辑深度是恒定的,并且仅取决于所讨论的信道。对于由任意离散群G描述的信道,即具有离散数量|G|的可能噪声算子,以速率m/(m+r)的完美传输是以最多缩放为$\mathcal{O}(d^r)$的开销实现的,其中辅助qudit的数量r仅取决于所讨论的群。此外,该开销与所传输的qudit的数量m无关。对于某些群,例如循环群,我们发现开销仅与群元素|G|的数量线性地缩放。

英文摘要:

We introduce a new quantum communication protocol for the transmission of quantum information under collective noise. Our protocol utilizes a decoherence-free subspace in such a way that an optimal asymptotic transmission rate is achieved, while at the same time encoding and decoding operations can be efficiently implemented. The encoding and decoding circuit requires a number of elementary gates that scale linearly with the number of transmitted qudits, m. The logical depth of our encoding and decoding operations is constant and depends only on the channel in question. For channels described by an arbitrary discrete group G, i.e. with a discrete number, |G|, of possible noise operators, perfect transmission at a rate m/(m+r) is achieved with an overhead that scales at most as $\mathcal{O}(d^r)$ where the number of auxiliary qudits, r, depends solely on the group in question. Moreover, this overhead is independent of the number of transmitted qudits, m. For certain groups, e.g. cyclic groups, we find that the overhead scales only linearly with the number of group elements |G|.

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

↑