Benchmarking Quantum Circuit Transformation With QKNOB Circuits
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 ev...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10833714/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832087914186539008 |
|---|---|
| author | Sanjiang Li Xiangzhen Zhou Yuan Feng |
| author_facet | Sanjiang Li Xiangzhen Zhou Yuan Feng |
| author_sort | Sanjiang Li |
| collection | DOAJ |
| description | 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</sc> 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</sc> 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. |
| format | Article |
| id | doaj-art-102fe327b2e64642b97dd416bc7c85d8 |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-102fe327b2e64642b97dd416bc7c85d82025-02-06T00:00:58ZengIEEEIEEE Transactions on Quantum Engineering2689-18082025-01-01611510.1109/TQE.2025.352739910833714Benchmarking Quantum Circuit Transformation With QKNOB CircuitsSanjiang Li0https://orcid.org/0000-0002-3332-2546Xiangzhen Zhou1Yuan Feng2Centre for Quantum Software and Information, Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW, AustraliaNanjing Tech University, Nanjing, ChinaDepartment of Computer Science and Technology, Tsinghua University, Beijing, ChinaCurrent 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</sc> 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</sc> 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.https://ieeexplore.ieee.org/document/10833714/Architecturehardware/software co-designperformance optimizationplacementrouting |
| spellingShingle | Sanjiang Li Xiangzhen Zhou Yuan Feng Benchmarking Quantum Circuit Transformation With QKNOB Circuits IEEE Transactions on Quantum Engineering Architecture hardware/software co-design performance optimization placement routing |
| title | Benchmarking Quantum Circuit Transformation With QKNOB Circuits |
| title_full | Benchmarking Quantum Circuit Transformation With QKNOB Circuits |
| title_fullStr | Benchmarking Quantum Circuit Transformation With QKNOB Circuits |
| title_full_unstemmed | Benchmarking Quantum Circuit Transformation With QKNOB Circuits |
| title_short | Benchmarking Quantum Circuit Transformation With QKNOB Circuits |
| title_sort | benchmarking quantum circuit transformation with qknob circuits |
| topic | Architecture hardware/software co-design performance optimization placement routing |
| url | https://ieeexplore.ieee.org/document/10833714/ |
| work_keys_str_mv | AT sanjiangli benchmarkingquantumcircuittransformationwithqknobcircuits AT xiangzhenzhou benchmarkingquantumcircuittransformationwithqknobcircuits AT yuanfeng benchmarkingquantumcircuittransformationwithqknobcircuits |