一句话：指出现有量子候选识别依赖试错与专家直觉，耗时从分钟到天不等，呼吁研究经典到混合量子软件的演化。
本文关注从经典软件向混合量子软件演进的过程中，如何识别适合量子执行的代码部分（quantum candidates）。量子计算虽在理论上具有数量级加速潜力，但并非所有计算任务都适合在量子机器上高效执行，因此混合系统需要将部分应用保留在经典机器，部分迁移到量子资源。现有识别量子候选的方法多依赖计算机科学家的直觉与专家经验，采用试错方式，导致单个应用的识别耗时从数分钟到数天不等，缺乏系统化、可复用的指导。从标题看，论文旨在刻画这一从经典到混合量子软件的演化，为构建混合量子程序提供认识基础；但摘要未给出具体方法、工具或量化评估结果。
Quantum computing exhibits the unique capability to natively and efficiently encode various natural phenomena, promising theoretical speedups of several orders of magnitude. However, not all computational tasks can be efficiently executed on quantum machines, giving rise to hybrid systems, where some portions of an application run on classical machines, while others utilize quantum resources. However, existing methods often to identify candidates to quantum execution (quantum candidates) involve a trial-and-error approach, relying on the intuition and expertise of computer scientists, resulting in varying identification durations ranging from minutes to days for a single application.
@inproceedings{paperbot9049,
title = {The Road to Hybrid Quantum Programs: Characterizing the Evolution from Classical to Hybrid Quantum Software},
author = {Vincenzo De Maio and Ivona Brandic and Ewa Deelman and Jürgen Cito},
booktitle = {FSE},
year = {2025},
doi = {10.1145/3696630.3731623}
}