SlackQ : Approaching the Qubit Mapping Problem with A Slack-aware Swap Insertion Scheme
Chi Zhang, Yanhao Chen, Yuwei Jin, Wonsun Ahn, Youtao Zhang, Eddy Z., Zhang

TL;DR
This paper introduces SlackQ, a novel qubit mapping approach that incorporates slack-aware SWAP insertion to optimize quantum circuit execution time on NISQ devices, significantly improving performance.
Contribution
The paper presents a slack-aware SWAP insertion scheme for qubit mapping, addressing execution time considerations often overlooked in prior methods.
Findings
Performance improvement up to 2.36X
Average performance improvement of 1.62X
Effective on diverse benchmark sets
Abstract
The rapid progress of physical implementation of quantum computers paved the way for the design of tools to help users write quantum programs for any given quantum device. The physical constraints inherent in current NISQ architectures prevent most quantum algorithms from being directly executed on quantum devices. To enable two-qubit gates in the algorithm, existing works focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, their schemes lack consideration of the execution time of generated quantum circuits. In this work, we propose a slack-aware SWAP insertion scheme for the qubit mapping problem in the NISQ era. Our experiments show performance improvement by up to 2.36X at maximum, by 1.62X on average, over 106 representative benchmarks from RevLib, IBM Qiskit , and ScaffCC.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Low-power high-performance VLSI design
