|国家预印本平台
| 注册
首页|Low-cost algorithm-to-execution framework for surface-code quantum computing

Low-cost algorithm-to-execution framework for surface-code quantum computing

Yunxin Tang Zixuan Huo Junxiang Huang Zhenai Ding Zhou You Zhirao Wang Yumeng Zeng Yangyu Lu Yiming Huang Zongkang Zhang Haipeng Xie Ying Li Jinzhao Sun Xiao Yuan Yuan Yao

Arxiv_logoArxiv

Low-cost algorithm-to-execution framework for surface-code quantum computing

Yunxin Tang Zixuan Huo Junxiang Huang Zhenai Ding Zhou You Zhirao Wang Yumeng Zeng Yangyu Lu Yiming Huang Zongkang Zhang Haipeng Xie Ying Li Jinzhao Sun Xiao Yuan Yuan Yao

作者信息

Abstract

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

引用本文复制引用

Yunxin Tang,Zixuan Huo,Junxiang Huang,Zhenai Ding,Zhou You,Zhirao Wang,Yumeng Zeng,Yangyu Lu,Yiming Huang,Zongkang Zhang,Haipeng Xie,Ying Li,Jinzhao Sun,Xiao Yuan,Yuan Yao.Low-cost algorithm-to-execution framework for surface-code quantum computing[EB/OL].(2026-09-10)[2026-09-21].https://arxiv.org/abs/2609.10965.

学科分类

计算技术、计算机技术
首发时间 2026-09-10
下载量:0
|
点击量:0
段落导航相关论文