近日,浙江大学王浩华团队研究了104超导量子比特的浅量子电路增强组合优化。相关论文发表在2026年3月2日出版的《国家科学评论》杂志上。
量子计算的一项关键任务是加速解决那些经典计算难以处理且具有实际价值的问题。其中,组合优化问题因其广泛的适用性与伊辛哈密顿量的天然契合性而备受关注。
研究组提出了一种量子采样策略,并基于该策略设计了一种加速求解伊辛模型基态的算法——这类问题属于组合优化中的NP难问题。该算法采用浅层电路的量子采样子程序来导航能量景观。研究组利用多达104个超导量子比特的实验证明,该算法能够输出相较于经过高度优化的经典模拟退火算法更优的解决方案,并基于串行执行下相对于模拟退火的求解时间指标,展示了实现量子加速的路径。这些结果表明,对于组合优化问题,该算法有望成为经典启发式算法的重要替代方案,使得在近期超导量子处理器上实现量子优势成为可能。
附:英文原文
Title: Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits
Author: Zhu, Xuhao, Zou, Zuoheng, Jin, Feitong, Mosharev, Pavel, Luo, Maolin, Wu, Yaozu, Chen, Jiachen, Zhang, Chuanyu, Gao, Yu, Wang, Ning, Zou, Yiren, Zhang, Aosai, Shen, Fanhao, Bao, Zehang, Zhu, Zitian, Zhong, Jiarun, Cui, Zhengyi, Han, Yihang, He, Yiyang, Wang, Han, Yang, Jia-Nan, Wang, Yanzhe, Shen, Jiayuan, Liu, Gongyu, Song, Zixuan, Deng, Jinfeng, Dong, Hang, Zhang, Pengfei, Song, Chao, Wang, Zhen, Li, Hekang, Guo, Qiujiang, Yung, Man-Hong, Wang, H
Issue&Volume: 2026-03-02
Abstract: A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad applicability and natural fitness to Ising Hamiltonians. Here we propose a quantum sampling strategy, based on which we design an algorithm for accelerating solving the ground states of Ising model, a class of NP-hard problems in combinatorial optimization. The algorithm employs a shallow-circuit quantum sampling subroutine to navigate the energy landscape. Using up to 104 superconducting qubits, we experimentally demonstrate that this algorithm outputs favorable solutions against even a highly-optimized classical simulated annealing algorithm and illustrate the path toward quantum speedup based on the time-to-solution metric against simulated annealing under serial execution. Our results indicate a promising alternative to classical heuristics for combinatorial optimization, where quantum advantage might become possible on near-term superconducting quantum processors.
DOI: 10.1093/nsr/nwag124
Source: https://academic.oup.com/nsr/advance-article/doi/10.1093/nsr/nwag124/8503488searchresult=1
National Science Review:《国家科学评论》,创刊于2014年。隶属于牛津学术数据库,最新IF:20.6
官方网址:https://academic.oup.com/nsr/issue?login=false
投稿链接:https://mc.manuscriptcentral.com/nsr_ms
