University of Gdańsk（格但斯克大学）；Quantumz.io Sp. z o.o.（Quantumz.io有限公司）；Wrocław University of Science and Technology（弗罗茨瓦夫科技大学）；Polish Academy of Sciences（波兰科学院）
J. Tuziemski, J. Pawłowski, P. Tarasiuk, Ł. Pawela, B. Gardas
备注：
22 pages
发表信息：
Published as "Limits of quantum run-time advantage" Phys. Rev. Applied 25, 044084 2026
A robust definition of quantum runtime is essential for assessing the performance of quantum algorithms and claims of quantum advantage. While for most classical hardware the total runtime is well approximated by computation plus a weakly varying constant, on current quantum hardware a clean experimental separation between "pure computation" and "overhead" is often not justified. Consequently, conventional quantum runtime analyses excluding substantial system-level overheads can lead to biased performance assessments. In this work we introduce experimentally grounded, end-to-end definitions of quantum runtime for digital and analogue quantum computers, together with a methodology for selecting strong classical baselines for quantum-classical runtime comparisons. Within this framework, we evaluate recent claims of quantum advantage in annealing and gate-based algorithms. We examine three representative case studies. First, we revisit annealing for approximate QUBO problems PRL 134, 160601 (2025), which employs a well-motivated time-to-$ε$ metric but effectively uses annealing time as a proxy for runtime. Second, we analyze a restricted implementation of Simon's problem PRX 15, 021082 (2025), where the favorable scaling in oracle calls is undisputed; however, we show that the estimated runtime of the quantum experiment is approximately two orders of magnitude slower than a tuned classical baseline at the tested sizes. Finally, we find that the runtime advantage of the BF-DCQO hybrid algorithm arXiv:2505.08663 is not observed under more comprehensive benchmarking. Therefore, on current NISQ hardware, runtime-based quantum advantage has not yet been demonstrated under experimentally grounded performance metrics, and credible claims require careful time accounting, appropriate performance measures, and properly chosen classical reference implementations, as discussed in this work.
From Hope to Heuristic: Realistic Runtime Estimates for Quantum Optimisation in NHEP
Technical University of Applied Sciences Regensburg（雷根斯堡应用科学技术大学）；Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院）；Complutense University of Madrid（马德里康普顿斯大学）；Jefferson Lab（杰斐逊国家加速器实验室）；Siemens AG, Technology（西门子股份公司技术部门）
The Quest for Quantum Advantage in Combinatorial Optimization: End-to-end Benchmarking of Quantum Solvers vs. Multi-core Classical Solvers
Kipu Quantum GmbH（基普量子有限公司）；Department of Physical Chemistry, University of the Basque Country UPV/EHU（巴斯克大学物理化学系）；Zuse Institute Berlin（柏林祖斯研究所）；Technische Universität Berlin（柏林工业大学）；IBM Quantum, IBM Research Europe – Zurich（IBM量子，IBM欧洲苏黎世研究院）；IDAL, Electronic Engineering Department, ETSE-UV, University of Valencia（瓦伦西亚大学电子工程学院IDAL）
Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology（慕尼黑量子科学与技术中心）；National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies（量子技术中心）
Approximate sampling from decoded quantum interferometry via Markov chain Monte Carlo methods
Freie Universität Berlin（柏林自由大学）；Fraunhofer Heinrich Hertz Institute（弗劳恩霍夫海因里希赫兹研究所）；IBM Research（IBM研究院）；Helmholtz-Zentrum Berlin für Materialien und Energie（柏林亥姆霍兹材料能源研究中心）
Accuracy-Cost Trade-offs for Reference VQE Calculations of H$_2$ on IBM Quantum Hardware
Fraunhofer Institute for Manufacturing Technology and Advanced Materials IFAM（弗劳恩霍夫制造技术与先进材料研究所）；Fraunhofer Institute for Cognitive Systems IKS（弗劳恩霍夫认知系统研究所）
Quantum-Inspired Tensor-Network Fractional-Step Method for Incompressible Flow in Curvilinear Coordinates
University of Hamburg（汉堡大学）；German Aerospace Center (DLR)（德国航空航天中心）；Hamburg University of Technology（汉堡工业大学）；The Hamburg Centre for Ultrafast Imaging（汉堡超快成像中心）；University of Oxford（牛津大学）
Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation
量子化学与材料是量子计算最有前途的应用领域之一。然而，在将这些领域的行业相关问题与可以解决这些问题的量子算法相匹配方面，还有很多工作要做。大多数以前的努力已经进行了资源估计的量子算法运行在大规模的容错架构，其中包括量子相位估计算法。相比之下，很少有人评估近期量子算法的性能，其中包括变分量子本征求解器（VQE）算法。最近，一项大规模基准研究[Gonthier et al. 2020]发现，有证据表明，一组工业相关分子的变分量子本征求解器的性能可能过于低效，无法实际使用。这就需要制定和评估提高自愿量化教育效率的方法。在这项工作中，我们预测的运行时间的能量估计子程序的VQE时，使用鲁棒幅度估计（RAE）估计泡利期望值。在保守的假设下，我们的资源估计预测，RAE可以减少运行时间在VQE的标准估计方法由一到两个数量级。尽管有这种改进，我们发现，运行时仍然太大，是实用的。这些发现激发了两种互补的努力，以实现量子优势：1）更有效的近期方法的调查基态能量估计和2）的问题实例，是工业价值和经典的挑战，但更适合量子计算的发展。
Do quantum linear solvers offer advantage for networks-based system of linear equations?
Centre for Quantum Engineering, Research and Education, TCG CREST（TCG CREST 量子工程、研究与教育中心）；National Institute of Technology Agartala（阿加塔拉国立技术学院）；Qilimanjaro Quantum Tech（基利马贾罗量子科技）；Universitat Politècnica de Catalunya（加泰罗尼亚理工大学）；Deloitte Tohmatsu Financial Advisory LLC（德勤冢田财务咨询有限公司）；Academy of Scientific and Innovative Research (AcSIR)（科学与创新研究学院）
