论文标题
基于几何考虑的Grover算法的描述
Description of the Grover algorithm based on geometric considerations
论文作者
论文摘要
本文涉及允许对先前由Oracle标记的量子状态进行放大的Grover算法。 Grover的算法允许在N条目的非结构数据库中进行搜索，以找到具有二次加速的标记元素。该算法需要以接近1的概率成功进行预定义的运行才能成功。本文以非常短的计算方式提供了幅度放大量子算法机制的描述，基于张量，并提供了连续系统状态的几何形式。所有基础变化都得到充分描述，以提供仅基于矩阵和复杂张量计算的广泛的Grover描述的替代方法。我们的实验涵盖了符合理论考虑的IBM的Qiskit库对电路的数值评估
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure database of n entries finding a marked element with a quadratic speedup. The algorithm requires a predefined number of runs to succeed with probability close to one.This article provides a description of the amplitude amplification quantum algorithm mechanism in a very short computational way, based on tensor products and provides a geometric presentation of the successive system states. All the basis changes are fully described to provide an alternative to the wide spread Grover description based only on matrices and complex tensor computation. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM that meet the theoretical considerations
