arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.04449quant-phcs.ITmath.IT
收藏

通过Petz恢复映射解码量子信息

Decoding quantum information via the Petz recovery map

Salman Beigi, Nilanjana Datta, Felix Leditzky

AI总结:

本文通过选用Petz恢复映射作为解码器,推导出量子信道n次使用下最大可传输量子比特数的下界,并证明相干信息是量子信息传输的可达速率,还在50-50擦除信道上发现超过尖锐错误阈值后容量按√n增长。

摘要:

我们得到了在给定的非零错误阈值ε下,经过量子信道N的n次使用所能传输的最大量子比特数Q^{n, ε}(N)的一个下界。为得到这一结果,我们首先推导出该信道的一次性纠缠传输容量的一个界,然后计算其渐近展开至二阶。在我们证明这一可达界的方法中,接收方对信道输出所使用的解码映射被选为Petz恢复映射(也称为转置信道)。我们的结果特别表明,这种解码器的选择可用于确立相干信息作为量子信息传输的可达速率。将我们的可达界应用于50-50擦除信道(其量子容量为零),我们发现存在一个尖锐的错误阈值,超过该阈值后Q^{n, ε}(N)按√n的比例增长。

英文摘要:

We obtain a lower bound on the maximum number of qubits, $Q^{n, ε}(\mathcal{N})$, which can be transmitted over $n$ uses of a quantum channel $\mathcal{N}$, for a given non-zero error threshold $ε$. To obtain our result, we first derive a bound on the one-shot entanglement transmission capacity of the channel, and then compute its asymptotic expansion up to the second order. In our method to prove this achievability bound, the decoding map, used by the receiver on the output of the channel, is chosen to be the \emph{Petz recovery map} (also known as the \emph{transpose channel}). Our result, in particular, shows that this choice of the decoder can be used to establish the coherent information as an achievable rate for quantum information transmission. Applying our achievability bound to the 50-50 erasure channel (which has zero quantum capacity), we find that there is a sharp error threshold above which $Q^{n, ε}(\mathcal{N})$ scales as $\sqrt{n}$.

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

↑