arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.06539quant-phcs.DS
收藏

超导量子处理器上的16元量子搜索算法基准测试

Benchmarking 16-element quantum search algorithms on superconducting quantum processors

Jan Gwinner, Marcin Briański, Wojciech Burkot, Łukasz Czerwiński, Vladyslav Hlembotskyi

摘要:

我们提出了在IBM量子处理器上运行4量子位非结构化搜索的实验结果。我们最好的尝试达到了24.5%左右的成功概率。我们尝试了几种算法,并使用量子搜索的最新发展来减少纠缠门的数量,这些纠缠门目前被认为是量子计算中错误的主要来源。将算法性能的理论预期与实际数据进行比较,我们探索了硬件限制,显示了量子处理器上性能的急剧,相变式退化。我们的结论是,这是非常重要的设计硬件感知算法,并包括任何其他低层次的优化NISQ设备。

英文摘要:

We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We try several algorithms and use the most recent developments in quantum search to reduce the number of entangling gates that are currently considered the main source of errors in quantum computations. Comparing theoretical expectations of an algorithm performance with the actual data, we explore the hardware limits, showing sharp, phase-transition-like degradation of performance on quantum processors. We conclude that it is extremely important to design hardware-aware algorithms and to include any other low level optimizations on NISQ devices.

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

↑