低复杂度的降维量子压缩算法

• 作 者: 刘欣 梁彦霞 聂敏 魏媛媛
• 机 构: 西安欧亚学院信息工程学院,西安邮电大学通信与信息工程学院,西北工业大学电子信息学院,
• 出 处: 光电子·激光
• 发表日期: 2017年11期
• 关键词: 保真度 量子信息 量子压缩 算法 量子比特 降维 幺正变换 计算复杂度 子空间 量子通信

为了在一定保真度的情况下降低量子信息的压缩率,提出了一种新的量子压缩算法。所提算法将高维的量子信息进行分裂,再对分裂后的信息进行压缩并传输,在接收端以一定的保真度恢复高维信息。相对于直接压缩的情形,所提算法有效地降低了压缩的计算复杂度,而保真度变化程度较小。对于一组10维量子信息,其乘加运算的计算复杂度从190降低到了94,而保真度仅仅降低了2.4%;而对于一组15维量子信息,复杂度从435降低到了186,而保真度仅仅降低了1.2%。

In order to reduce the compression rate of quantum information with a certain degree of fidelity, a new quantum compression algorithm is proposed. The proposed algorithm splits the high-dimensional quantum information and then compresses and transmits the split information, recovering the high-dimensional information with a certain degree of fidelity at the receiving end. Compared with the case of direct compression, the proposed algorithm effectively reduces the computational complexity of compression, while the degree of fidelity changes less. For a set of 10-dimensional quantum information, the computational complexity of its multiply-add operation is reduced from 190 to 94, while the fidelity is reduced by only 2.4%; while for a set of 15-dimensional quantum information, the complexity is reduced from 435 to 186 Fidelity decreased by only 1.2%.