Graph-based identification of qubit network (GidNET) for qubit reuse
Gideon Uchehara, Tor M. Aamodt, Olivia Di Matteo

TL;DR
GidNET is a graph-based algorithm that optimizes qubit reuse in quantum circuits, significantly reducing circuit width and runtime compared to existing methods, thus enhancing quantum resource efficiency.
Contribution
GidNET introduces a novel graph-based approach for qubit reuse optimization that outperforms prior algorithms in both efficiency and scalability.
Findings
Achieves up to 21% reduction in circuit width in larger circuits.
Reduces average execution time by 97.4%, with up to 142.9X speedup.
Outperforms Qiskit in circuit width reduction by 59.3% on average.
Abstract
Quantum computing introduces the challenge of optimizing quantum resources crucial for executing algorithms within the limited qubit availability of current quantum architectures. Existing qubit reuse algorithms face a trade-off between optimality and scalability, with some achieving optimal reuse but limited scalability due to computational complexities, while others exhibit reduced runtime at the expense of optimality. This paper introduces GidNET (Graph-based Identification of qubit NETwork), an algorithm for optimizing qubit reuse in quantum circuits. By analyzing the circuit's Directed Acyclic Graph (DAG) representation and its corresponding candidate matrix, GidNET identifies higher-quality pathways for qubit reuse more efficiently. Through a comparative study with established algorithms, notably QNET [1], GidNET not only achieves a consistent reduction in compiled circuit widths…
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
