Dynamic Hypergraph Partitioning of Quantum Circuits with Hybrid Execution
Shane Sweeney, Krishnendu Guha

TL;DR
This paper introduces a dynamic hypergraph partitioning method for quantum circuits that leverages hybrid classical-quantum execution to reduce noise, qubit requirements, and improve scalability on NISQ devices.
Contribution
It presents a novel dynamic partitioning approach for quantum circuits that effectively minimizes noise, time, and cost by combining classical and quantum computation.
Findings
Achieved a 42.30% reduction in noise.
Reduced qubit requirements by 40%.
Demonstrated improved scalability and efficiency.
Abstract
Quantum algorithms offer an exponential speedup over classical algorithms for a range of computational problems. The fundamental mechanisms underlying quantum computation required the development and construction of quantum computers. These devices are referred to as NISQ (Noisy Intermediate-Scale Quantum) devices. Not only are NISQ devices extremely limited in their qubit count but they also suffer from noise during computation and this problem only gets worse as the size of the circuit increases which limits the practical use of quantum computers for modern day applications. This paper will focus on utilizing quantum circuit partitioning to overcome the inherent issues of NISQ devices. Partitioning a quantum circuit into smaller subcircuits has allowed for the execution of quantum circuits that are too large to fit on one quantum device. There have been many previous approaches to…
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 · Low-power high-performance VLSI design
