A Novel Approach to Quantum Circuit Partitioning
Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1985400
- Resource Relation:
- Conference: IEEE Computer Society Annual Symposium on VLSI - Pafos, , Cyprus - 7/2/2022 4:00:00 AM-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reoptimization of Quantum Circuits via Hierarchical Synthesis
TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Journal Article
·
Mon Nov 01 00:00:00 EDT 2021
· 2021 International Conference on Rebooting Computing (ICRC)
·
OSTI ID:1985400
+1 more
TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits
Conference
·
Thu Jun 01 00:00:00 EDT 2023
·
OSTI ID:1985400
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Technical Report
·
Thu Dec 02 00:00:00 EST 2010
·
OSTI ID:1985400