Scholarlink

<p>Many variations of Grover’s algorithm attempt to improve iteration count using a technique known as phase matching, replacing Grover’s phase-flip oracle with an <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\alpha \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>α</mi> </math></EquationSource> </InlineEquation>-rotation oracle that cannot be simulated using only one Grover oracle call. Previously it was shown that phase matching can always achieve 100% success probability with an iteration count within one step from the Grover algorithm. In this paper, we show that this is actually the optimal iteration count, hence finding the first proof of the minimal number of queries to solve the search problem with a known number of solutions whether we use an <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\alpha \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>α</mi> </math></EquationSource> </InlineEquation>-rotation or the Grover flip.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Optimal number of queries for phase-matching quantum search

  • 期刊论文

  • 发表日期：

    2025年11月19日

查看全文
  • Raj Alexandru Guţoiu,
  • Andrei Tănăsescu,
  • Pantelimon George Popescu

摘要

Many variations of Grover’s algorithm attempt to improve iteration count using a technique known as phase matching, replacing Grover’s phase-flip oracle with an \(\alpha \) α -rotation oracle that cannot be simulated using only one Grover oracle call. Previously it was shown that phase matching can always achieve 100% success probability with an iteration count within one step from the Grover algorithm. In this paper, we show that this is actually the optimal iteration count, hence finding the first proof of the minimal number of queries to solve the search problem with a known number of solutions whether we use an \(\alpha \) α -rotation or the Grover flip.