Additive composition formulation of the iterative Grover algorithm
Additive composition formulation of the iterative Grover algorithm
复制标题
迭代 Grover 算法的加法合成公式
DOI：
10.1139/cjp-2018-0452
复制
发表时间：
2019
影响因子：
1.2
通讯作者：
F.M. Toyama and W. van Dijk
中科院分区：
文献类型：
--
作者：
M. Amaku;F.A B. Coutinho and F.M. Toyama;F.M. Toyama and W. van Dijk
在Grover型量子搜索过程中，搜索算子迭代地应用于初始均匀叠加数据库状态，比如说，k次。我们提出了一个添加剂分解方案，使迭代过程中表示，在计算空间中，作为一个线性组合ofk运营商，其中每一个由一个单一的Grover搜索，其次是一个整体的相位旋转。的值ofk和旋转相位是相同的确定性的搜索框架中确定的。我们讨论了如何添加剂的形式可以有效地利用，我们提出了一个替代门，实现了相同的结果，作为迭代搜索。
In the Grover-type quantum search process a search operator is iteratively applied, say,ktimes, on the initial uniform superposition database state. We present an additive decomposition scheme such that the iteration process is expressed, in the computational space, as a linear combination ofkoperators, each of which consists of a single Grover-search followed by an overall phase-rotation. The value ofkand the rotation phase are the same as those determined in the framework of the search with certainty. We discuss how the additive form can be effectively utilized and we propose an alternative gate that realizes the same outcome as the iterative search.