Circuit Partitioning for the Quantum Internet
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914279235518464 |
|---|---|
| author | Sünkel, Leo Gabor, Thomas Linnhoff-Popien, Claudia |
| author_facet | Sünkel, Leo Gabor, Thomas Linnhoff-Popien, Claudia |
| contents | In a quantum internet, quantum processing units (QPUs) with varying architectures and capabilities may be connected through quantum communication channels, enabling new applications such as distributed quantum computing (DQC), a paradigm in which multiple QPUs execute a single circuit. However, remote operations between QPUs are expensive as they require the creation and distribution of entanglement throughout the network. It is therefore crucial to assign qubits to QPUs and partition circuits in such a way that the overall communication between QPUs is minimized. In this paper, we apply and evaluate simulated annealing and an evolutionary algorithm for this problem. We consider quantum networks with 25 nodes arranged in different topologies and QPUs with varying qubit capacities. The circuits evaluated contain 50 and 100 qubits. We show that the different metaheuristics all significantly outperform the baselines by drastically reducing the communication cost by over 40%. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_14413 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Circuit Partitioning for the Quantum Internet Sünkel, Leo Gabor, Thomas Linnhoff-Popien, Claudia Quantum Physics In a quantum internet, quantum processing units (QPUs) with varying architectures and capabilities may be connected through quantum communication channels, enabling new applications such as distributed quantum computing (DQC), a paradigm in which multiple QPUs execute a single circuit. However, remote operations between QPUs are expensive as they require the creation and distribution of entanglement throughout the network. It is therefore crucial to assign qubits to QPUs and partition circuits in such a way that the overall communication between QPUs is minimized. In this paper, we apply and evaluate simulated annealing and an evolutionary algorithm for this problem. We consider quantum networks with 25 nodes arranged in different topologies and QPUs with varying qubit capacities. The circuits evaluated contain 50 and 100 qubits. We show that the different metaheuristics all significantly outperform the baselines by drastically reducing the communication cost by over 40%. |
| title | Circuit Partitioning for the Quantum Internet |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.14413 |