Scholarlink

<p>In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the algorithm is robust (stable against errors in the phases) if a certain connection between the phases in the traversing coin is preserved, otherwise small errors lead to poor algorithm performance. Here, we investigate how the robustness changes if different phases are used, depending on the current iteration number. We numerically study six different examples with different phase sequences. We show that usage of a particular sequence of phases can make the algorithm more robust even if there is no preserved connection between the phases in the traversing coin.</p>

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

Robustness of quantum random walk search with multi-phase matching

  • 期刊论文

  • 发表日期：

    2025年5月3日

查看全文
  • Hristo Tonchev,
  • Petar Danev

摘要

In our previous works, we have studied quantum random walk search algorithm on hypercube, with traversing coin constructed by using generalized Householder reflection and a phase multiplier. When the same phases are used each iteration, the algorithm is robust (stable against errors in the phases) if a certain connection between the phases in the traversing coin is preserved, otherwise small errors lead to poor algorithm performance. Here, we investigate how the robustness changes if different phases are used, depending on the current iteration number. We numerically study six different examples with different phase sequences. We show that usage of a particular sequence of phases can make the algorithm more robust even if there is no preserved connection between the phases in the traversing coin.