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.

中文翻译：

---

在嘈杂的中型量子计算机时代中使用格罗弗搜索的前景

为了了解存在量子计算机噪声的情况下对大型非结构化数据使用Grover搜索算法的界限，我们通过施加各种类型的噪声（由IBM QISKit建模）来进行一系列模拟。我们应用了三种形式的Grover算法：（1）标准格式，具有4-10量子比特；（2）最近发布的修改过的Grover算法，其设置为减小电路深度；（3）（1）和（2）中的算法），并通过添加ancilla qubit修改了多控件Toffoli。基于这些仿真，我们找到了这些情况下的噪声上限，建立了其对电路量子深度的依赖性，并进行了比较。通过外推拟合的阈值，