基于IBM Q平台的量子算法研究  

Research of Quantum Algorithm Based on IBM Q Platform

作　　者：卫佳 倪明[1] 周明 江文兵 WEI Jia;NI Ming;ZHOU Ming;JIANG Wenbing(The 32nd Research Institute of China Electronics Technology Group Corporation,Shanghai 201808,China)

机构地区：[1]中国电子科技集团公司第三十二研究所,上海201808

出　　处：《计算机工程》2018年第12期6-12,共7页Computer Engineering

基　　金：中国电子科技集团公司创新基金(CQ170386-00);中国电子科技集团公司第三十二研究所创新基金(EX170410-00)

摘　　要：为探究多比特量子算法在量子芯片和模拟器中的实现现状,分别在IBM量子芯片和模拟器上运行Grover搜索算法、量子随机行走算法以及量子傅里叶变换算法。针对2 bit Grover搜索算法和2 bit量子随机行走算法,分析测量次数对运行结果的影响并选用最高可模拟次数对量子芯片和模拟器的运算结果进行比对。设计并运行5 bit量子傅里叶变换算法和3 bit Grover搜索算法,分别采用IBM Q模拟器进行最高次数的模拟。实验结果表明,量子芯片测试结果并没有随测量次数的增加而优化,模拟器计算结果的准确度明显优于量子芯片。To explore the implementation status of multi-bit quantum algorithm in quantum chips and simulators,Grover search algorithm,quantum random walk algorithm and quantum Fourier transform algorithm are run on IBM quantum chips and simulators respectively.For 2 bit Grover search algorithm and 2 bit quantum random walk algorithm,the influence of measurement times on operation results is analyzed and the maximum number of simulation times is selected to compare the operation results of quantum chip and simulator.A 5 bit quantum Fourier transform algorithm and a 3 bit Grover search algorithm are designed and run,and the IBM Q simulator is used to simulate the maximum number of times respectively.Experimental results show that the quantum chip test results are not optimized with the increase of the number of measurements,and the accuracy of the simulation results is obviously better than that of the quantum chip.

关 键 词：IBM Q云平台 量子模拟 量子傅里叶变换 Grover搜索算法 量子随机行走算法 量子计算 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]