@inproceedings{b990446b4af84c34bc00b1b4a03080a8,
title = "TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits",
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 = "circuit partitioning, directed acyclic graph, quantum computing",
author = "Joseph Clark and Travis Humble and Himanshu Thapliyal",
note = "Publisher Copyright: {\textcopyright} 2023 ACM.; 33rd Great Lakes Symposium on VLSI, GLSVLSI 2023 ; Conference date: 05-06-2023 Through 07-06-2023",
year = "2023",
month = jun,
day = "5",
doi = "10.1145/3583781.3590234",
language = "English",
series = "Proceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI",
publisher = "Association for Computing Machinery",
pages = "587--592",
booktitle = "GLSVLSI 2023 - Proceedings of the Great Lakes Symposium on VLSI 2023",
}