低复杂度的降维量子压缩算法
DOI:
CSTR:
作者:
作者单位:

(1.西北欧亚学院 信息工程学院,陕西 西安 710121; 2.西安邮电大学 通信与信息工程学院,陕西 西安 710121; 3.西北工业大学 电子信息学院,陕西 西安 710129)

作者简介:

刘欣(1977-),男,陕西西安人,硕士 ,工程师,主要从事光通信、移动通信方面的研究.

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(61301091)、国家科技重大专项(2012ZX03001025-004)、陕西省自然科学基础研究计划(2014JQ8318)和陕西省教育厅科研计划(2014JK1663)资助项目 (1.西北欧亚学院 信息工程学院,陕西 西安 710121; 2.西安邮电大学 通信与信息工程学院,陕西 西安 710121; 3.西北工业大学 电子信息学院,陕西 西安 710129)


A quantum compression algorithm with low complexity by deceasing dimensions
Author:
Affiliation:

(1.School of Information Engineering,Xi′an Eurasia University,Xi′an 710021,Chi na; 2.School of Telecommunication and Information Engineering,Xi′an University of P osts and Telecommunications,Xi′an 710121,China; 3.School of Electronics and In formation,Northwestern Polytechnical University,Xi′an 710072,China)

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

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

    Abstract:

    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%.

    参考文献
    相似文献
    引证文献
引用本文

刘欣,梁彦霞,聂敏,魏媛媛.低复杂度的降维量子压缩算法[J].光电子激光,2017,28(11):1205~1211

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2017-02-16
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2017-11-17
  • 出版日期:
文章二维码