Grover Auto-Control Searching Algorithm

ZHU Wan-ning; CHEN Han-wu

doi:10.3969/j.issn.0372-2112.2016.12.023

您当前的位置：

首页 >

文章列表页 >

Grover Auto-Control Searching Algorithm

更新时间：2025-07-16

- Grover Auto-Control Searching Algorithm
- Acta Electronica Sinica Vol. 44, Issue 12, Pages: 2975-2980(2016)
- 作者机构：
  
  1. 金陵科技学院软件工程学院,江苏,南京,211199
  2. 东南大学计算机科学与工程学院,江苏,南京,210096
  3. 东南大学计算机网络和信息集成教育部重点实验室,江苏,南京,210096
  4. 金陵科技学院软件工程学院,江苏,南京,211199
  5. 东南大学计算机科学与工程学院,江苏,南京,210096
  6. 东南大学计算机网络和信息集成教育部重点实验室,江苏,南京,210096
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2016.12.023
  CLC： TP387TN911.73
- Published：2016
- 稿件说明：
移动端阅览
ZHU Wan-ning, CHEN Han-wu. Grover Auto-Control Searching Algorithm[J]. Acta Electronica Sinica, 2016, 44(12): 2975-2980.
DOI：

ZHU Wan-ning, CHEN Han-wu. Grover Auto-Control Searching Algorithm[J]. Acta Electronica Sinica, 2016, 44(12): 2975-2980. DOI： 10.3969/j.issn.0372-2112.2016.12.023.

摘要

本文提出了利用相位门自动控制Grover搜索算法迭代次数的算法.Grover搜索算法最终得到目标分量的概率非常依赖于酉算子迭代的次数.迭代次数的计算依赖于目标分量的数量.因此当目标分量数未知时，该方法无法以高概率测量到目标分量.在以往的解决方案中需要较高的Oracle查询复杂度才能以一定概率得到目标分量的数量.本文提出了一种通过判断叠加态相位正负性，可自动控制Grover搜索算法迭代次数的方法.只需要添加一个判断相位的门电路，仅增加一次Oracle查询次数就可以精确的在最优迭代次数时停止Grover搜索算法，在搜索空间较小时可比原算法有更大的概率得到目标分量.

Abstract

This paper presents an improved Grover searching algorithm which can automatically control the iterative processing when the number of target states is unknown.The probability of success of Grover searching algorithm depends on the number of iteration times and the number of the time of iterations relies on the number of target states.Therefore

it is hard to get the target state with high probability when the number of target states is unknown.To this question

the time complexity of conventional solution is high and the answer is non-deterministic.This paper shows an improved Grover searching algorithm

which is based on the sign for the phases of superposition state.Compared to existing research results

this algorithm can always stop the Grover iterations when the number of iteration times is optimal by the cost where just one more gate

and one more time Oracle call are needed to judge the sign of phase.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

User Identifying Algorithm Based on Quantum Computing

Related Author

ZHU Wan-ning

LIU Zhi-hao

Related Institution

Institute of Software Engineering, Jinling Institute of Technology

Institute of Computer Science and Engineering, Southeast University

Institute of Software Engineering Jinling Institute of Technology Nanjing Jiangsu China

Institute of Computer Science and Engineering Southeast University Nanjing Jiangsu China

⁰