Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings - 2022 IEEE Computer Society Annual Symposium on VLSI, ISVLSI 2022 |
Publisher | IEEE Computer Society |
Pages | 450-451 |
Number of pages | 2 |
ISBN (Electronic) | 9781665466059 |
DOIs | |
State | Published - 2022 |
Event | 2022 IEEE Computer Society Annual Symposium on VLSI, ISVLSI 2022 - Pafos, Cyprus Duration: Jul 4 2022 → Jul 6 2022 |
Publication series
Name | Proceedings of IEEE Computer Society Annual Symposium on VLSI, ISVLSI |
---|---|
Volume | 2022-July |
ISSN (Print) | 2159-3469 |
ISSN (Electronic) | 2159-3477 |
Conference
Conference | 2022 IEEE Computer Society Annual Symposium on VLSI, ISVLSI 2022 |
---|---|
Country/Territory | Cyprus |
City | Pafos |
Period | 07/4/22 → 07/6/22 |
Bibliographical note
Publisher Copyright:© 2022 IEEE.
Keywords
- Partitioning
- Quantum Computing Quantum Circuits