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

量子信道的多级极化

Multilevel Polarization for Quantum Channels

Ashutosh Goswami, Mehdi Mhalla, Valentin Savin

AI总结:

本文研究固定两量子比特 Clifford 幺正下的量子极化码构造,证明 Pauli 信道呈现多级极化现象,并利用该性质设计高效译码方案,通过冻结半噪声信道减少预共享 EPR 对数量,同时提出极化速度更快的替代构造。

摘要:

最近,文献[1]基于量子信道合并与分裂过程提出了一种纯量子版本的极化码,其中随机选择的两量子比特 Clifford 幺正作为信道合并操作。本文考虑使用与[1]相同的信道合并与分裂过程来构造量子极化码,但采用固定的两量子比特 Clifford 幺正。对于 Pauli 信道族,我们证明极化在多个层级上发生,其中合成的量子虚拟信道趋于完全噪声、半噪声或无噪声。进一步,我们提出了一种利用极化多级性质的量子极化码,并为该码提供了高效译码方法。我们证明半噪声信道可以通过将其输入固定在振幅基或相位基上来冻结,从而与[1]中的构造相比减少了预共享 EPR 对的数量。我们给出了预共享 EPR 对数量的上界,在量子擦除信道情形下该上界为等式。为了提高极化速度,我们提出了一种替代构造,该构造同样在多级上极化,且先前关于预共享 EPR 对数量的上界仍然成立。对于量子擦除信道,我们通过数值分析确认替代构造的多级极化发生得相对更快。

英文摘要:

Recently, a purely quantum version of polar codes has been proposed in [1] based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as channel combining operation. Here, we consider the quantum polar code construction using the same channel combining and splitting procedure as in [1], but with a fixed two-qubit Clifford unitary. For the family of Pauli channels, we show that polarization happens in multi-levels, where synthesized quantum virtual channels tend to become completely noisy, half-noisy, or noiseless. Further, we present a quantum polar code exploiting the multilevel nature of polarization, and provide an efficient decoding for this code. We show that half-noisy channels can be frozen by fixing their inputs in either the amplitude or the phase basis, which allows reducing the number of preshared EPR pairs compared to the construction in [1]. We provide an upper bound on the number of preshared EPR pairs, which is an equality in the case of the quantum erasure channel. To improve the speed of polarization, we propose an alternative construction, which again polarizes in multi-levels, and the previous upper bound on the number of preshared EPR pairs also holds. For a quantum erasure channel, we confirm by numerical analysis that the multilevel polarization happens relatively faster for the alternative construction.

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

↑