Benchmarking Quantum Circuit Transformation With QKNOB Circuits

Sanjiang Li;Xiangzhen Zhou;Yuan Feng
{"title":"Benchmarking Quantum Circuit Transformation With QKNOB Circuits","authors":"Sanjiang Li;Xiangzhen Zhou;Yuan Feng","doi":"10.1109/TQE.2025.3527399","DOIUrl":null,"url":null,"abstract":"Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for QCT. <monospace>QKNOB</monospace> circuits have built-in transformations with near-optimal (close to the theoretical optimum) <sc>swap</small> count and depth overhead. <monospace>QKNOB</monospace> provides general and unbiased evaluation of QCT algorithms. Using <monospace>QKNOB</monospace>, we demonstrate that <monospace>SABRE</monospace>, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices for both <sc>swap</small> count and depth objectives. Our results also reveal significant performance gaps relative to the near-optimal transformation costs of <monospace>QKNOB</monospace>. Our construction algorithm and benchmarks are open-source.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10833714","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Quantum Engineering","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10833714/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for QCT. QKNOB circuits have built-in transformations with near-optimal (close to the theoretical optimum) swap count and depth overhead. QKNOB provides general and unbiased evaluation of QCT algorithms. Using QKNOB, we demonstrate that SABRE, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices for both swap count and depth objectives. Our results also reveal significant performance gaps relative to the near-optimal transformation costs of QKNOB. Our construction algorithm and benchmarks are open-source.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用 QKNOB 电路为量子电路转换建立基准
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
8.00
自引率
0.00%
发文量
0
期刊最新文献
Front Cover 2024 Index IEEE Transactions on Quantum Engineering Vol. 5 Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement Benchmarking Quantum Circuit Transformation With QKNOB Circuits
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1