research-article

TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits

Authors:

Joseph Clark,

Travis Humble,

Himanshu ThapliyalAuthors Info & Claims

GLSVLSI '23: Proceedings of the Great Lakes Symposium on VLSI 2023

Pages 587 - 592

https://doi.org/10.1145/3583781.3590234

Published: 05 June 2023 Publication History

Get Access

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.

References

[1]

Pablo Andres-Martinez and Chris Heunen. 2019. Automated distribution of quantum circuits via hypergraph partitioning. Physical Review A, Vol. 100, 3 (2019), 032308.

Crossref

Google Scholar

[2]

Jonathan M Baker, Casey Duckering, Alexander Hoover, and Frederic T Chong. 2020. Time-sliced quantum circuit partitioning for modular architectures. In Proceedings of the 17th ACM International Conference on Computing Frontiers. 98--107.

Digital Library

Google Scholar

[3]

Elena Barcucci and M Cecilia Verri. 1992. Some more properties of Catalan numbers. Discrete Mathematics, Vol. 102, 3 (1992), 229--237.

Digital Library

Google Scholar

[4]

Joseph Clark, Himanshu Thapliyal, and Travis S Humble. 2022. A Novel Approach to Quantum Circuit Partitioning. In 2022 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). IEEE, 450--451.

Crossref

Google Scholar

[5]

Davood Dadkhah, Mariam Zomorodi, Seyed Ebrahim Hosseini, Pawel Plawiak, and Xujuan Zhou. 2022. Reordering and partitioning of distributed quantum circuits. IEEE Access, Vol. 10 (2022), 70329--70341.

Crossref

Google Scholar

[6]

Omid Daei, Keivan Navi, and Mariam Zomorodi-Moghadam. 2020. Optimized quantum circuit partitioning. International Journal of Theoretical Physics, Vol. 59, 12 (2020), 3804--3820.

Crossref

Google Scholar

[7]

Zohreh Davarzani, Mariam Zomorodi-Moghadam, Mahboobeh Houshmand, and Mostafa Nouri-baygi. 2020. A dynamic programming approach for distributing quantum circuits by bipartite graphs. Quantum Information Processing, Vol. 19, 10 (2020), 1--18.

Digital Library

Google Scholar

[8]

Bo Fang, M Yusuf Özkaval, Ang Li, Ümit V Catalyürek, and Sriram Krishnamoorthy. 2022. Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning. In 2022 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 289--300.

Crossref

Google Scholar

[9]

Berkeley National Laboratory. 2022. BQSKit. https://github.com/BQSKit/bqskit.

Google Scholar

[10]

Eesa Nikahd, Naser Mohammadzadeh, Mehdi Sedighi, and Morteza Saheb Zamani. 2021. Automated window-based partitioning of quantum circuits. Physica Scripta, Vol. 96, 3 (2021), 035102.

Crossref

Google Scholar

[11]

Tirthak Patel, Ed Younis, Costin Iancu, Wibe de Jong, and Devesh Tiwari. 2021. Robust and Resource-Efficient Quantum Circuit Approximation. https://doi.org/10.48550/ARXIV.2108.12714

Crossref

Google Scholar

[12]

Wei Tang, Teague Tomesh, Martin Suchara, Jeffrey Larson, and Margaret Martonosi. 2021. Cutqc: using small quantum computers for large quantum circuit evaluations. In Proceedings of the 26th ACM International conference on architectural support for programming languages and operating systems. 473--486.

Digital Library

Google Scholar

[13]

Xin-Chuan Wu, Marc Grau Davis, Frederic T Chong, and Costin Iancu. 2021. Reoptimization of quantum circuits via hierarchical synthesis. In 2021 International Conference on Rebooting Computing (ICRC). IEEE, 35--46.

Crossref

Google Scholar

Cited By

View all

Charrwi MIoannou GYounis Ede Jong WSaeed S(2024)Quantum Circuit Partitioning for Scalable Noise-Aware Quantum Circuit Re-Synthesis2024 IEEE International Conference on Quantum Computing and Engineering (QCE)10.1109/QCE60285.2024.10306(359-364)Online publication date: 15-Sep-2024
https://doi.org/10.1109/QCE60285.2024.10306
Mousavi SMohammadzadeh N(2024)Physical Synthesis in Distributed Quantum ArchitecturesPhysica Scripta10.1088/1402-4896/ada18bOnline publication date: 19-Dec-2024
https://doi.org/10.1088/1402-4896/ada18b

Index Terms

TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits
1. Hardware
  1. Emerging technologies
    1. Quantum technologies
      1. Quantum computation

Recommendations

Recognition of directed acyclic graphs by spanning tree automata

In this paper, we study tree automata for directed acyclic graphs (DAGs). We define the movement of a tree automaton on a DAG so that a DAG is accepted by a tree automaton if and only if the DAG has a spanning tree accepted by the tree automaton. We ...
Acyclic Partitioning of Large Directed Acyclic Graphs
CCGrid '17: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

Finding a good partition of a computational directed acyclic graph associated with an algorithm can help find an execution pattern improving data locality, conduct an analysis of data movement, and expose parallel steps. The partition is required to be ...
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs

We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as ...

Comments

Information & Contributors

Information

Published In

GLSVLSI '23: Proceedings of the Great Lakes Symposium on VLSI 2023

June 2023

731 pages

ISBN:9798400701252

DOI:10.1145/3583781

General Chairs:
Himanshu Thapliyal
University of Tennessee, Knoxville, USA
,
Ronald DeMara
University of Central Florida, USA
,
Program Chairs:
Inna Partin-Vaisband
University of Illinois Chicago, USA
,
Srinivas Katkoori
University of South Florida, USA

Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 2023

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GLSVLSI '23

Sponsor:

SIGDA

GLSVLSI '23: Great Lakes Symposium on VLSI 2023

June 5 - 7, 2023

TN, Knoxville, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Upcoming Conference

GLSVLSI '25

Sponsor:
sigda

Great Lakes Symposium on VLSI 2025

June 30 - July 2, 2025

New Orleans , LA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
151
Total Downloads

Downloads (Last 12 months)60
Downloads (Last 6 weeks)4

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Charrwi MIoannou GYounis Ede Jong WSaeed S(2024)Quantum Circuit Partitioning for Scalable Noise-Aware Quantum Circuit Re-Synthesis2024 IEEE International Conference on Quantum Computing and Engineering (QCE)10.1109/QCE60285.2024.10306(359-364)Online publication date: 15-Sep-2024
https://doi.org/10.1109/QCE60285.2024.10306
Mousavi SMohammadzadeh N(2024)Physical Synthesis in Distributed Quantum ArchitecturesPhysica Scripta10.1088/1402-4896/ada18bOnline publication date: 19-Dec-2024
https://doi.org/10.1088/1402-4896/ada18b

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Recognition of directed acyclic graphs by spanning tree automata

Acyclic Partitioning of Large Directed Acyclic Graphs

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations