Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.12005 · IEEE International Conference on Quantum Artificial Intelligence (QAI)

Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing

Leo Sünkel, Jonas Stein, Jonas Nüßlein, Tobias Rohe, Claudia Linnhoff–Popien

Published Nov 2, 2025• 4 citations
arXivHTMLPDF

Abstract

Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One approach to scale QPUs is to connect multiple machines through quantum and classical channels to form clusters or even quantum networks. Using this paradigm, several smaller QPUs can collectively execute circuits that each would not be able on its own. However, communication between QPUs is costly as it requires generating and maintaining entanglement, and hence it should be used wisely. In this paper, we evaluate the architectures, and in particular the entanglement patterns, of variational quantum circuits in a distributed quantum computing (DQC) setting. That is, using Qiskit, we simulate the execution of an eight qubit circuit using four QPUs each with two computational and two communication qubits where non-local CX-gates are performed using the remote-CX protocol. We compare the performance of various circuits on a binary classification task where training is executed under ideal and testing under noisy conditions. The study provides initial results on suitable VQC architectures for the DQC paradigm, and indicates that a standard VQC baseline is not always the best choice, and alternative architectures that use entanglement between QPUs sparingly deliver better results under noise.

DOI
10.1109/qai63978.2025.00060

Related papers

An Evaluation of the Remote CX Protocol under Noise in Distributed Quantum Computing

Leo Sünkel, Michael Kölle, Tobias Rohe +1 more

Quantum computers connected through classical and quantum communication channels can be combined to function as a single unit to run large quantum circuits that each device is unable to execute on their own. The distributed quantum computing paradigm is therefore often seen as a potential pathway to scaling quantum computing to capacities necessary for practical and large-scale applications. Whether connecting multiple quantum processing units (QPUs) in clusters or over networks, quantum communication requires entanglement to be generated and distributed over distances. Using entanglement, the remote CX protocol can be performed, which allows the application of the CX gate involving qubits located in different QPUs. In this work, we use a specialized simulation framework for a high-level evaluation of the impact of the protocol when executed under noise in various network configurations using different number of QPUs. We compare naive and graph partitioning qubit assignment strategies and how they affect the fidelity in experiments run on Grover, GHZ, VQC, and random circuits. The results provide insights on how QPU and network configurations or naive scheduling can degrade performance.

quant-pharXiv:2602.03536•International Conference on Communications•Feb 4, 2026•0 citations

Circuit Partitioning for the Quantum Internet

Leo Sünkel, Thomas Gabor, Claudia Linnhoff–Popien

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%.

arXiv:2509.14413•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•0 citations

Towards Reproducible Evaluation of Distributed Quantum Circuit Partitioning Algorithms

Javier Vela-Tambo, Davud Azizov, Tian Guo

Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.

quant-pharXiv:2608.27099•Aug 28, 2026•0 citations

Towards a Distributed Quantum Computing Platform for Algorithm Experiments

Sajjad Kashani, Angadh Singh, Ulrike Stege

Distributed quantum computing (DQC) is a rapidly evolving field with its own unique challenges. Distributing a quantum algorithm involves several key steps and considerations. The steps involve decomposition at various levels of abstraction, given the underlying quantum stack and quantum network capabilities. In our DQC design explorations, we focus on the distribution at the algorithm and circuit levels. Algorithmic distribution involves distributing tasks before compilation, allowing different quantum processing units (QPUs) to receive distinct parts of an algorithm. Circuit distribution involves executing a quantum algorithm in a distributed manner at the circuit execution level using circuit and adaptive quantum technologies. If entanglement across QPUs is supported, then quantum states can be shared between qubits on remote quantum processors. This requires a specialized architecture with data and communication qubits with non-local gates such as telegates and teledata gates. This paper presents our progress towards a framework for exploring quantum distribution at the algorithm and circuit levels. Our implementation and case studies demonstrate the feasibility of our approach and show effective pathways for distributed quantum algorithm experiments.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Simulation of Distributed Quantum Computing based on Teleportation

Benedikt Baier, Leo Sünkel, Wolfgang Kellerer

Distributed quantum computing (DQC) uses quantum communication to pool the computational power of multiple quantum processors (QPU). Since qubits in a DQC system are not necessarily co-located, interactions between non-co-located qubits require quantum teleportation, which relies on entanglement to transfer qubit states between distant nodes. As DQC typically requires many teleportations, quantum networks must efficiently generate and distribute high-fidelity entanglement to enable these teleportations. However, since large-scale quantum networks are not yet available, simulations are essential to understand their impact on DQC performance. This paper presents a simulation-based evaluation of teleportation-based DQC under varying real-world network conditions and two distribution schemes. Network parameters such as maximum connection length, entanglement fidelity, and quantum memory coherence time are evaluated using two small-scale Grover circuits to show the impact on computational fidelity and execution delay. The results show that computation fidelity drops sharply below practical thresholds when entanglement fidelity falls below 0.95 or memory coherence is under 1s. Additionally, a runtime analysis shows a 32 times increase in simulation time when both circuit width and circuit depth are increased.

International Conference on Communications•May 24, 2026•0 citations

A Nonblocking Multistage Switching Network for Distributed Quantum Computing

Yu Liu, Yingling Mao, Xu Xu +3 more

Quantum computing, utilizing the unique properties of quantum mechanics, has the potential to revolutionize various fields. However, current quantum processors face challenges in scaling the number of qubits, limiting their practical applications. In response, Distributed Quantum Computing (DQC) has emerged as a promising paradigm where multiple interconnected Quantum Processing Units (QPUs) collaborate to execute quantum circuits. In this paper, we focus on designing networks to interconnect QPUs for the implementation of DQC. We find that in real-world experiments and systems, the photon collection and coupling efficiency is low, leading to significant performance degradation in direct connection networks. To address this limitation, we propose a novel multistage switching network tailored for DQC, which has low system complexity and high entanglement generation rates. The proposed switching network comprises$\log _{2}(N)$stages and$N/2$binary switches at each stage, where N represents the number of QPUs. We prove that the proposed network is nonblocking and develop an efficient routing algorithm with a time complexity of$\mathcal {O}(N\log (N))$. Additionally, we show the success probability of entanglement generation in the proposed switching network. Extensive simulations demonstrate that our network significantly outperforms the highly efficient circuit-switching Beneš network and three direct connection networks.

IEEE Transactions on Networking•Feb 27, 2025•6 citations
Scaling quantum computers, i.e., quantum processing units (QPUs) to enable the execution of large quantum circuits is a major challenge, especially for applications that should provide a quantum advantage over classical algorithms. One approach to scale QPUs is to connect multiple machines through quantum and classical channels to form clusters or even quantum networks. Using this paradigm, several smaller QPUs can collectively execute circuits that each would not be able on its own. However, communication between QPUs is costly as it requires generating and maintaining entanglement, and hence it should be used wisely. In this paper, we evaluate the architectures, and in particular the entanglement patterns, of variational quantum circuits in a distributed quantum computing (DQC) setting. That is, using Qiskit, we simulate the execution of an eight qubit circuit using four QPUs each with two computational and two communication qubits where non-local CX-gates are performed using the remote-CX protocol. We compare the performance of various circuits on a binary classification task where training is executed under ideal and testing under noisy conditions. The study provides initial results on suitable VQC architectures for the DQC paradigm, and indicates that a standard VQC baseline is not always the best choice, and alternative architectures that use entanglement between QPUs sparingly deliver better results under noise.
Quantum computers connected through classical and quantum communication channels can be combined to function as a single unit to run large quantum circuits that each device is unable to execute on their own. The distributed quantum computing paradigm is therefore often seen as a potential pathway to scaling quantum computing to capacities necessary for practical and large-scale applications. Whether connecting multiple quantum processing units (QPUs) in clusters or over networks, quantum communication requires entanglement to be generated and distributed over distances. Using entanglement, the remote CX protocol can be performed, which allows the application of the CX gate involving qubits located in different QPUs. In this work, we use a specialized simulation framework for a high-level evaluation of the impact of the protocol when executed under noise in various network configurations using different number of QPUs. We compare naive and graph partitioning qubit assignment strategies and how they affect the fidelity in experiments run on Grover, GHZ, VQC, and random circuits. The results provide insights on how QPU and network configurations or naive scheduling can degrade performance.
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%.
Distributed Quantum Computing (DQC) addresses the physical scaling limitations of monolithic quantum processors by networking modular Quantum Processing Units (QPUs). Efficient execution of quantum algorithms on DQC architectures requires compiling them across QPUs while minimizing inter-QPU communication bottlenecks, primarily through circuit partitioning. However, current evaluations of state-of-the-art partitioning heuristics focus primarily on the total entanglement cost of the partitions, failing to capture the broader structural and temporal overheads introduced by distributed network constraints. This paper addresses this evaluation gap by applying established monolithic benchmarking metrics to partitioned distributed circuits to quantify the performance impact of network constraints. Using an open-source, automated evaluation pipeline, we systematically assess diverse partitioning algorithms across standardized workloads and quantum network topologies. Our empirical results reveal that partitioning algorithms with comparable entanglement costs can still introduce drastically different physical execution penalties. By exposing these hidden trade-offs, such as severe increases in circuit depth and substantial reductions in gate density, this study demonstrates that comprehensive circuit-level metrics are essential for guiding the future design of DQC compilers.
Distributed quantum computing (DQC) is a rapidly evolving field with its own unique challenges. Distributing a quantum algorithm involves several key steps and considerations. The steps involve decomposition at various levels of abstraction, given the underlying quantum stack and quantum network capabilities. In our DQC design explorations, we focus on the distribution at the algorithm and circuit levels. Algorithmic distribution involves distributing tasks before compilation, allowing different quantum processing units (QPUs) to receive distinct parts of an algorithm. Circuit distribution involves executing a quantum algorithm in a distributed manner at the circuit execution level using circuit and adaptive quantum technologies. If entanglement across QPUs is supported, then quantum states can be shared between qubits on remote quantum processors. This requires a specialized architecture with data and communication qubits with non-local gates such as telegates and teledata gates. This paper presents our progress towards a framework for exploring quantum distribution at the algorithm and circuit levels. Our implementation and case studies demonstrate the feasibility of our approach and show effective pathways for distributed quantum algorithm experiments.
Distributed quantum computing (DQC) uses quantum communication to pool the computational power of multiple quantum processors (QPU). Since qubits in a DQC system are not necessarily co-located, interactions between non-co-located qubits require quantum teleportation, which relies on entanglement to transfer qubit states between distant nodes. As DQC typically requires many teleportations, quantum networks must efficiently generate and distribute high-fidelity entanglement to enable these teleportations. However, since large-scale quantum networks are not yet available, simulations are essential to understand their impact on DQC performance. This paper presents a simulation-based evaluation of teleportation-based DQC under varying real-world network conditions and two distribution schemes. Network parameters such as maximum connection length, entanglement fidelity, and quantum memory coherence time are evaluated using two small-scale Grover circuits to show the impact on computational fidelity and execution delay. The results show that computation fidelity drops sharply below practical thresholds when entanglement fidelity falls below 0.95 or memory coherence is under 1s. Additionally, a runtime analysis shows a 32 times increase in simulation time when both circuit width and circuit depth are increased.
Quantum computing, utilizing the unique properties of quantum mechanics, has the potential to revolutionize various fields. However, current quantum processors face challenges in scaling the number of qubits, limiting their practical applications. In response, Distributed Quantum Computing (DQC) has emerged as a promising paradigm where multiple interconnected Quantum Processing Units (QPUs) collaborate to execute quantum circuits. In this paper, we focus on designing networks to interconnect QPUs for the implementation of DQC. We find that in real-world experiments and systems, the photon collection and coupling efficiency is low, leading to significant performance degradation in direct connection networks. To address this limitation, we propose a novel multistage switching network tailored for DQC, which has low system complexity and high entanglement generation rates. The proposed switching network compriseslog⁡2(N)\log _{2}(N)log2​(N)stages andN/2N/2N/2binary switches at each stage, where N represents the number of QPUs. We prove that the proposed network is nonblocking and develop an efficient routing algorithm with a time complexity ofO(Nlog⁡(N))\mathcal {O}(N\log (N))O(Nlog(N)). Additionally, we show the success probability of entanglement generation in the proposed switching network. Extensive simulations demonstrate that our network significantly outperforms the highly efficient circuit-switching Beneš network and three direct connection networks.