Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10374226/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832584000387940352 |
|---|---|
| author | Sebastian Brandhofer Ilia Polian Kevin Krsulich |
| author_facet | Sebastian Brandhofer Ilia Polian Kevin Krsulich |
| author_sort | Sebastian Brandhofer |
| collection | DOAJ |
| description | A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individually require fewer qubits, lower qubit connectivity, and typically incur less error. However, as partitioning generally increases the duration of a quantum computation exponentially in the required partitioning effort, it is crucial to select optimal partitioning points, so-called cuts, and to use optimal cut realizations. In this work, we develop the first optimal partitioning method relying on quantum circuit knitting for optimal cut realizations and an optimal selection of wire cuts and gate cuts that trades off ancilla qubit insertions for a decrease in quantum computing time. Using this combination, the developed method demonstrates a reduction in quantum computing runtime by 41% on average compared to previous quantum circuit partitioning methods. Furthermore, the qubit requirement of the evaluated quantum circuits was reduced by 40% on average for a runtime budget of one hour and a sampling frequency of 1 kHz. These results highlight the optimality gap of previous quantum circuit partitioning methods and the possible extension in the computational reach of near-term quantum computers. |
| format | Article |
| id | doaj-art-c39dc4991f5f4a469559f0da4d30fb2f |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-c39dc4991f5f4a469559f0da4d30fb2f2025-01-28T00:02:22ZengIEEEIEEE Transactions on Quantum Engineering2689-18082024-01-01511010.1109/TQE.2023.334710610374226Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire CutsSebastian Brandhofer0https://orcid.org/0000-0002-6010-5643Ilia Polian1https://orcid.org/0000-0002-6563-2725Kevin Krsulich2https://orcid.org/0000-0002-7222-5722Institute of Computer Architecture and Computer Engineering and Center for Integrated Quantum Science and Technology, University of Stuttgart, Stuttgart, GermanyInstitute of Computer Architecture and Computer Engineering and Center for Integrated Quantum Science and Technology, University of Stuttgart, Stuttgart, GermanyIBM Quantum, IBM T. J. Watson Research Center, Yorktown Heights, NY, USAA limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individually require fewer qubits, lower qubit connectivity, and typically incur less error. However, as partitioning generally increases the duration of a quantum computation exponentially in the required partitioning effort, it is crucial to select optimal partitioning points, so-called cuts, and to use optimal cut realizations. In this work, we develop the first optimal partitioning method relying on quantum circuit knitting for optimal cut realizations and an optimal selection of wire cuts and gate cuts that trades off ancilla qubit insertions for a decrease in quantum computing time. Using this combination, the developed method demonstrates a reduction in quantum computing runtime by 41% on average compared to previous quantum circuit partitioning methods. Furthermore, the qubit requirement of the evaluated quantum circuits was reduced by 40% on average for a runtime budget of one hour and a sampling frequency of 1 kHz. These results highlight the optimality gap of previous quantum circuit partitioning methods and the possible extension in the computational reach of near-term quantum computers.https://ieeexplore.ieee.org/document/10374226/Quantum circuitquantum circuit compilationquantum circuit partitioningquantum computingquantum state teleportationqubit |
| spellingShingle | Sebastian Brandhofer Ilia Polian Kevin Krsulich Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts IEEE Transactions on Quantum Engineering Quantum circuit quantum circuit compilation quantum circuit partitioning quantum computing quantum state teleportation qubit |
| title | Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts |
| title_full | Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts |
| title_fullStr | Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts |
| title_full_unstemmed | Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts |
| title_short | Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts |
| title_sort | optimal partitioning of quantum circuits using gate cuts and wire cuts |
| topic | Quantum circuit quantum circuit compilation quantum circuit partitioning quantum computing quantum state teleportation qubit |
| url | https://ieeexplore.ieee.org/document/10374226/ |
| work_keys_str_mv | AT sebastianbrandhofer optimalpartitioningofquantumcircuitsusinggatecutsandwirecuts AT iliapolian optimalpartitioningofquantumcircuitsusinggatecutsandwirecuts AT kevinkrsulich optimalpartitioningofquantumcircuitsusinggatecutsandwirecuts |