Adaptable Weighted Token Swapping Algorithm for Optimal Multi-Qubit Pathfinding
Gary J Mooney

TL;DR
This paper introduces an adaptable weighted token swapping algorithm for multi-qubit pathfinding in quantum circuit mapping, significantly improving runtime and error minimization on hardware graphs.
Contribution
It presents a novel binary integer linear programming approach to optimize multi-qubit routing, outperforming existing methods in runtime and error reduction.
Findings
Improved runtime scaling over state-of-the-art methods.
Lower accumulated errors in quantum circuit mapping.
Effective routing solutions across various hardware layouts.
Abstract
Quantum computing promises breakthroughs in simulating and solving complex, classically intractable problems. However, current noisy intermediate-scale quantum (NISQ) devices are relatively small and error-prone, prohibiting large-scale computations. To achieve quantum advantage in this regime, it is crucial to minimise the impact of noise from qubit decoherence and two-qubit gates. A direct approach is to optimise quantum circuit compilation, particularly by improving how circuits are mapped onto hardware. This work targets multi-qubit pathfinding (MQPF), a key subproblem in quantum circuit mapping, formulated as a variant of the token swapping problem. We propose an adaptable algorithm, modelled as a binary integer linear program, that routes teams of qubits on hardware graphs using swap operations. The algorithm minimises SWAP-gate depth and accumulated gate and idle errors,…
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-Dot Cellular Automata · Quantum Information and Cryptography
