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

A quantum compression algorithm with low complexity by deceasing dimensions

作　　者：刘欣 梁彦霞 聂敏 魏媛媛 

机构地区：[1]西北欧亚学院信息工程学院,陕西西安710121 [2]西安邮电大学通信与信息工程学院,陕西西安710121 [3]西北工业大学电子信息学院,陕西西安710129

出　　处：《光电子．激光》2017年第11期1205-1211,共7页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金(61301091);国家科技重大专项(2012ZX03001025-004);陕西省国际科技合作与交流计划面上项目(2017KW-011);陕西省教育厅科研计划专项项目(2014JK1663)资助项目

摘　　要：为了在一定保真度的情况下降低量子信息的压缩率,提出了一种新的量子压缩算法。所提算法将高维的量子信息进行分裂,再对分裂后的信息进行压缩并传输,在接收端以一定的保真度恢复高维信息。相对于直接压缩的情形,所提算法有效地降低了压缩的计算复杂度,而保真度变化程度较小。对于一组10维量子信息,其乘加运算的计算复杂度从190降低到了94,而保真度仅仅降低了2.4%;而对于一组15维量子信息,复杂度从435降低到了186,而保真度仅仅降低了1.2%。A new quantum compression algorithm is proposed in this paper, in order to reduce the com- pression rate. In the meanwhile the fidelity of quantum information should be maintained or slightly re- duced in a small range. In this algorithm, high-dimension Qquantum information is divided into several sections first, and then these sections are compressed by compression algorithm and transmitted through a quantum channel. At the receiver, these sections are recovered by typical quantum decompression algo- rithrrL After that,they are recombined together to form the recovered high-dimensional information. All of these are conducted under some allowable fidelity, ompared with direct compression of the high-di- mension information, Ccomputational complexity is reduced effectively by this new compression algo- rithm,and the fidelity has declined in an allowable and small range. The 10-dimension quantum informa- tion is taken as an example in this paper. Compared with direct compression,the number of the multiply and add operations is reduced from 190 to 94,while the fidelity is only reduced by 2.4%. As for 15-di- mensional quantum information,the number of multiply and add operations is 186 after using this new compression method,which is reduced from 435 ,and the fidelity is only reduced by 1.2%.

关 键 词：量子压缩 高维 分裂 低复杂度 保真度 

分 类 号：TN919[电子电信—通信与信息系统] TN915[电子电信—信息与通信工程]