arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.12525quant-ph
收藏

在量子计算机上寻找大小k-团簇

Finding Small and Large k-Clique Instances on a Quantum Computer

Sara Ayman Metwalli, Francois Le Gall, Rodney Van Meter

摘要:

寻找三角形的算法,k团问题的最小非平凡的例子,已经提出了量子计算机。尽管如此,这些算法假设使用固定访问时间量子RAM(QRAM)。我们提出了一个实用的门为基础的方法来寻找三角形的问题和它的NP难k-团推广。我们研究了在噪声中等规模量子计算机(NISQ)设备上短期实现的恒定因素,以及评估量子计算机长期使用的问题的缩放。我们比较的时间复杂度和电路的实用性的理论方法和实际实现。我们提出并应用两种不同的策略的k-团问题,检查Qiskit实现的电路大小。我们分析了我们的实现,通过模拟三角形发现与各种错误模型,观察阻尼正确答案的幅度的影响,并比较六个真正的IBMQ机器上的执行。最后,我们估计的日期时,所提出的方法可以有效地运行在一个实际的设备上基于IBM的量子体积指数增长预测和我们的误差分析的结果。

英文摘要:

Algorithms for triangle-finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM (QRAM). We present a practical gate-based approach to both the triangle-finding problem and its NP-hard k-clique generalization. We examine both constant factors for near-term implementation on a Noisy Intermediate Scale Quantum computer (NISQ) device, and the scaling of the problem to evaluate long-term use of quantum computers. We compare the time complexity and circuit practicality of the theoretical approach and actual implementation. We propose and apply two different strategies to the k-clique problem, examining the circuit size of Qiskit implementations. We analyze our implementations by simulating triangle finding with various error models, observing the effect on damping the amplitude of the correct answer, and compare to execution on six real IBMQ machines. Finally, we estimate the date when the methods proposed can run effectively on an actual device based on IBM's quantum volume exponential growth forecast and the results of our error analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑