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

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

A quantum compression algorithm with low complexity by deceasing dimensions

A new quantum compression algorithm i s proposed in this paper,in order to reduce the compression rate.In the meanwhil e the fidelity of quantum information should be maintained or slig htly reduced in a small range.In this algorithm,high-dimension Qquantum information is divided into several sections first,and then these sections are c ompressed by compression algorithm and transmitted through a quantum channel.At the receiver,these section s are recovered by typical quantum decompression algorithm.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-dimension info rmation,Ccomputational complexity is reduced effectively by this new compression algorithm,and the fide lity has declined in an allowable and small range.The 10-dimension quantum information is taken as an example in this paper.Compared with direct compression,the number of the multipl y and add operations is reduced from 190to 94,while the fidelity is only reduced by 2.4%.As for 15-dimensional quantum information,the number of multiply and add operations is 186after using this new compression method,which is reduced from 435,and the fidelity is only reduced by 1.2%.