arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.08985quant-ph
收藏

使用面向应用的性能基准测试进行量子算法探索

Quantum Algorithm Exploration using Application-Oriented Performance Benchmarks

Thomas Lubinski, Joshua J. Goings, Karl Mayer, Sonika Johri, Nithin Reddy, Aman Mehta, Niranjan Bhatia, Sonny Rappaport, Daniel Mills, Charles H. Baldwin, Lunin… 展开作者

Thomas Lubinski, Joshua J. Goings, Karl Mayer, Sonika Johri, Nithin Reddy, Aman Mehta, Niranjan Bhatia, Sonny Rappaport, Daniel Mills, Charles H. Baldwin, Luning Zhao, Aaron Barbosa, Smarak Maity, Pranav S. Mundada

AI总结:

本文研究了扩展QED-C量子基准测试套件以应对更复杂应用的挑战,通过新增HHL求解器、VQE氢晶格模拟、机器学习分类基准及错误缓解方法,全面评估了量子算法的性能与成本权衡。

摘要:

QED-C 面向应用基准测试套件提供了评估量子计算机在现实世界应用中的性能特征的能力。其基准测试程序在一系列问题规模和输入上进行扫描,捕获与结果质量、总执行时间和消耗的量子门资源相关的关键性能指标。在本文中,我们研究了将这种基准测试方法的适用性扩展到更复杂应用时所面临的挑战。首先,我们引入了一种通过系统改变算法参数来改善全景覆盖的方法,并在一个新的可扩展 HHL 线性方程求解器基准测试中展示了此功能。其次,我们向 QED-C 套件添加了氢晶格模拟的 VQE 实现,并引入了一种分析结果质量与运行时间成本之间权衡的方法。我们观察到,随着量子比特数量的增加,准确性会下降,但执行时间仅略微增加。第三,探索了监督机器学习分类应用的独特特征,作为评估该框架对新应用类别可扩展性的基准。将其应用于二分类问题揭示了更大的 ansatz 电路所需的训练时间增加,以及显著的经典计算开销。第四,我们在基准测试工作流程中添加了包含优化和错误缓解的方法,这使我们能够:识别近似门合成与门噪声之间的有利权衡;观察测量错误缓解和一种确定性错误缓解算法的益处;并将性能改进与产生的时间开销进行对比。展望未来,我们讨论了基准测试框架如何有助于促进算法选项的探索及其对性能的影响。

英文摘要:

The QED-C suite of Application-Oriented Benchmarks provides the ability to gauge performance characteristics of quantum computers as applied to real-world applications. Its benchmark programs sweep over a range of problem sizes and inputs, capturing key performance metrics related to the quality of results, total time of execution, and quantum gate resources consumed. In this manuscript, we investigate challenges in broadening the relevance of this benchmarking methodology to applications of greater complexity. First, we introduce a method for improving landscape coverage by varying algorithm parameters systematically, exemplifying this functionality in a new scalable HHL linear equation solver benchmark. Second, we add a VQE implementation of a Hydrogen Lattice simulation to the QED-C suite, and introduce a methodology for analyzing the result quality and run-time cost trade-off. We observe a decrease in accuracy with increased number of qubits, but only a mild increase in the execution time. Third, unique characteristics of a supervised machine-learning classification application are explored as a benchmark to gauge the extensibility of the framework to new classes of application. Applying this to a binary classification problem revealed the increase in training time required for larger anzatz circuits, and the significant classical overhead. Fourth, we add methods to include optimization and error mitigation in the benchmarking workflow which allows us to: identify a favourable trade off between approximate gate synthesis and gate noise; observe the benefits of measurement error mitigation and a form of deterministic error mitigation algorithm; and to contrast the improvement with the resulting time overhead. Looking ahead, we discuss how the benchmark framework can be instrumental in facilitating the exploration of algorithmic options and their impact on performance.

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

↑