论文标题
在嘈杂的中间尺度量子计算机时代使用Grover搜索的前景
Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
论文作者
论文摘要
为了理解在量子计算机噪声存在下，Grover搜索算法对大型非结构化数据的利用范围，我们通过施加由IBM Qiskit建模的各种噪声来进行一系列模拟。我们采用三种形式的格罗弗（Grover）算法：（1）标准算法，带有4-10个QUBITS，（2）最近发表的修改后的Grover算法，旨在减少电路深度，以及（3）（1）和（2）中的算法，并通过添加Ancilla Qubit进行了多控制Toffoli的修改。基于这些模拟，我们发现这些情况的噪声上限，确定其对电路量子深度的依赖性，并在它们之间进行比较。通过推断拟合阈值，我们预测将Grover的算法应用于搜索数据集中数据集中的数据集时，典型的门误差界限是什么。
In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled by the IBM QISKit. We apply three forms of Grover's algorithms: (1) the standard one, with 4-10 qubits, (2) recently published modified Grover's algorithm, set to reduce the circuit depth, and (3) the algorithms in (1) and (2) with multi-control Toffoli's modified by addition of an ancilla qubit. Based on these simulations, we find the upper bound of noise for these cases, establish its dependence on the quantum depth of the circuit and provide comparison among them. By extrapolation of the fitted thresholds, we predict what would be the typical gate error bounds when apply the Grover's algorithms for the search of a data in a data set as large as thirty two thousands.
