论文标题
在当今的量子处理器上执行未编码的Grover算法的实施
Performance of Uncoded Implementation of Grover's Algorithm on Today's Quantum Processors
论文作者
论文摘要
这项工作测试了Grover搜索电路在某些IBM超导量子设备上的性能，以防搜索空间$ n = 2^4 $和$ n = 2^5 $。理想情况下，我们希望获得一个明显达到目标（标记）状态的结果概率分布。但是，在实际设备上执行的量子电路很容易受到噪声的影响，这会导致结果波动。因此，本文的贡献如下：a）它以$ n = 16美元的形式提出了两个新的Grover的搜索循环，尚未在最新情况下报告； b）它显示了模拟结果与在实际设备上获得的结果之间的性能差异； c）它表明需要在电路上以$ n \ ge 2^5 $添加错误纠正。
This work tests the performance of Grover's search circuits on some IBM superconducting quantum devices in case of the size of search space $N=2^4$ and $N=2^5$. Ideally, we expect to get an outcome probability distribution that is clearly peaked at the goal (marked) state. However, the quantum circuit executed on real devices is vulnerable to noise which leads to fluctuations in the results. The contributions of the paper are therefore the following: a) it presents two new Grover's search circuits for $N=16$ which were not yet reported in the state of the art; b) it shows performance difference between simulation results and results obtained on real devices; c) it shows the need of adding error-correction on the circuit for $N\ge 2^5$.
