TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits
- University of Tennessee, Knoxville (UTK)
- ORNL
- University of Tennessee (UT)
We propose the Tree-based Directed Acyclic Graph (TDAG) partitioning for quantum circuits, a novel quantum circuit partitioning method which partitions circuits by viewing them as a series of binary trees and selecting the tree containing the most gates. TDAG produces results of comparable quality (number of partitions) to an existing method called ScanPartitioner (an exhaustive search algorithm) with an 95% average reduction in execution time. Furthermore, TDAG improves compared to a faster partitioning method called QuickPartitioner by 38% in terms of quality of the results with minimal overhead in execution time.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE; USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1985363
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning
On partitioning of algorithms for parallel execution on VLSI circuit architectures
A Novel Approach to Quantum Circuit Partitioning
Conference
·
Tue Oct 18 00:00:00 EDT 2022
·
OSTI ID:1900410
On partitioning of algorithms for parallel execution on VLSI circuit architectures
Thesis/Dissertation
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6930573
A Novel Approach to Quantum Circuit Partitioning
Conference
·
Fri Jul 01 00:00:00 EDT 2022
·
OSTI ID:1985400