Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910799309570048 |
|---|---|
| author | Kaur, Eneet Shapourian, Hassan Zhao, Jiapeng Kilzer, Michael Kompella, Ramana Nejabati, Reza |
| author_facet | Kaur, Eneet Shapourian, Hassan Zhao, Jiapeng Kilzer, Michael Kompella, Ramana Nejabati, Reza |
| contents | This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit and gate teleportation, minimizing the required Einstein-Podolsky-Rosen (EPR) pairs for executing general quantum circuits. Additionally, we formulate an integer linear program to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the quantum network. Finally, we analyze the entanglement cost of implementing the Quantum Fourier Transform (QFT) across multiple QPUs, exploiting the circuit's structure to minimize total entanglement consumption. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14947 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors Kaur, Eneet Shapourian, Hassan Zhao, Jiapeng Kilzer, Michael Kompella, Ramana Nejabati, Reza Quantum Physics This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit and gate teleportation, minimizing the required Einstein-Podolsky-Rosen (EPR) pairs for executing general quantum circuits. Additionally, we formulate an integer linear program to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the quantum network. Finally, we analyze the entanglement cost of implementing the Quantum Fourier Transform (QFT) across multiple QPUs, exploiting the circuit's structure to minimize total entanglement consumption. |
| title | Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2501.14947 |