基于超立方体的多目标量子行走搜索算法  

Multi-objective Searching Algorithm Based on the Quantum Walk on the Hypercube

作　　者：朱皖宁[1] ZHU Wan-ning(Jinling Institute of Technology,Nanjing 211169, Chin)

机构地区：[1]金陵科技学院软件工程学院,江苏南京211169

出　　处：《金陵科技学院学报》2018年第2期5-9,共5页Journal of Jinling Institute of Technology

基　　金：金陵科技学院高层次人才科研启动基金(jit-b-201624)

摘　　要：提出了可以解决多目标搜索的量子行走算法。量子行走是一种通用的量子计算工具,理论上可以实现任意量子算法。当前提出的基于量子行走的无结构数据库搜索算法只能进行单目标搜索。多目标搜索是一种更常见的问题。为了求解多目标搜索算法,基于超立方体上量子行走框架提出了新的硬币算子,通过对目标节点入边的幅度扩大,增加测量到目标节点的概率,最终解决了多目标搜索问题。最后证明了算法的查询复杂度为O(N/M)。This paper presents a multi-objective searching algorithm based on the quantum walk.Quantum walk is a universal instrument in quantum computing.In theory,quantum walk can realize arbitrary quantum algorithm.At present,quantum walk searching algorithm on the unstructured database can only search single object.Multi-objective searching is able to solve more common problems.In order to solve the multi-objective searching problem by the quantum walk way,this paper presents a novel quantum algorithm by constructing a new quantum coin operator.This new coin operator can amplify the amplitude of the incoming edges of the target vertex,and then the amplitude of the target vertex will increase by performing the migration operator S.At last,this paper proves the query complexity of the algorithm is O（N/M）.

关 键 词：量子行走 超立方体 无结构数据库搜索算法 

分 类 号：O413[理学—理论物理] TP301[理学—物理]