TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits
Open Access
- 5 June 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 587-592
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning2022
- Reordering and Partitioning of Distributed Quantum CircuitsIEEE Access, 2022
- Reoptimization of Quantum Circuits via Hierarchical Synthesis2021
- CutQC: using small Quantum computers for large Quantum circuit evaluations2021
- Automated window-based partitioning of quantum circuitsPhysica Scripta, 2021
- Optimized Quantum Circuit PartitioningInternational Journal of Theoretical Physics, 2020
- A dynamic programming approach for distributing quantum circuits by bipartite graphsQuantum Information Processing, 2020
- Time-sliced quantum circuit partitioning for modular architectures2020
- Automated distribution of quantum circuits via hypergraph partitioningPhysical Review A, 2019
- Some more properties of Catalan numbersDiscrete Mathematics, 1992