DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation

IF 4.6
IEEE Transactions on Quantum Engineering Pub Date : 2026-01-01 Epub Date: 2026-06-22 DOI:10.1109/TQE.2026.3705783
Shangshu Li;Zheng-An Wang;Heng Fan
{"title":"DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation","authors":"Shangshu Li;Zheng-An Wang;Heng Fan","doi":"10.1109/TQE.2026.3705783","DOIUrl":null,"url":null,"abstract":"Classical simulation remains a practical foundation for developing and evaluating quantum circuits, and state-vector methods are still among the most important exact simulation techniques. In this setting, gate fusion is a widely used optimization that combines multiple gates into a larger operator to reduce repeated state-vector traversal and improve execution efficiency. However, existing fusion methods are often driven by local heuristics or linear gate order, which can miss larger legal fusion opportunities allowed by circuit dependencies. To address this issue, we propose a directed acyclic graph-aware gate fusion method that builds legal fused operators directly from the circuit dependence graph through topological expansion, a configurable fusion-size bound, and a nonblocking rule. Using the <italic>pyquafu</i> state-vector simulator as the execution backend, the method delivers strong end-to-end performance on representative benchmarks and yields high compression ratios. The results also highlight that fusion quality alone is not sufficient: the realized speedup depends on how well the fused blocks match the execution characteristics of the simulator backend.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"7 ","pages":"1-10"},"PeriodicalIF":4.6000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11573203","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Quantum Engineering","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11573203/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/22 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Classical simulation remains a practical foundation for developing and evaluating quantum circuits, and state-vector methods are still among the most important exact simulation techniques. In this setting, gate fusion is a widely used optimization that combines multiple gates into a larger operator to reduce repeated state-vector traversal and improve execution efficiency. However, existing fusion methods are often driven by local heuristics or linear gate order, which can miss larger legal fusion opportunities allowed by circuit dependencies. To address this issue, we propose a directed acyclic graph-aware gate fusion method that builds legal fused operators directly from the circuit dependence graph through topological expansion, a configurable fusion-size bound, and a nonblocking rule. Using the pyquafu state-vector simulator as the execution backend, the method delivers strong end-to-end performance on representative benchmarks and yields high compression ratios. The results also highlight that fusion quality alone is not sufficient: the realized speedup depends on how well the fused blocks match the execution characteristics of the simulator backend.
基于dag感知的门融合高效态向量量子电路仿真
经典模拟仍然是发展和评估量子电路的实用基础,状态向量方法仍然是最重要的精确模拟技术之一。在这种情况下,门融合是一种广泛使用的优化方法,它将多个门组合成一个更大的算子,以减少重复的状态向量遍历,提高执行效率。然而,现有的融合方法往往是由局部启发式或线性门序驱动的,这可能会错过电路依赖所允许的更大的合法融合机会。为了解决这个问题,我们提出了一种有向无环图感知门融合方法,该方法通过拓扑展开、可配置的融合大小边界和非阻塞规则,直接从电路依赖图中构建合法的融合算子。使用pyquafu状态向量模拟器作为执行后端,该方法在代表性基准测试上提供强大的端到端性能,并产生高压缩比。结果还强调,仅融合质量是不够的:实现的加速取决于融合块与模拟器后端执行特性的匹配程度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.00
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书