Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing

• URL: http://arxiv.org/abs/2509.12005v1
• Date: Mon, 15 Sep 2025 14:50:30 GMT
• Title: Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
• Authors: Leo Sünkel, Jonas Stein, Jonas Nüßlein, Tobias Rohe, Claudia Linnhoff-Popien,
• Abstract summary: We evaluate the architectures, and in particular the entanglement patterns, of variational quantum circuits in a distributed quantum computing setting.<n>We simulate the execution of an eight qubit circuit using four QPUs each with two computational and two communication qubits.<n>We compare the performance of various circuits on a binary classification task where training is executed under ideal and testing under noisy conditions.
• Score: 3.1224202646855894
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• An Evaluation of the Remote CX Protocol under Noise in Distributed Quantum Computing [2.829895203841271]
  We use a specialized simulation framework for a high-level evaluation of the impact of the protocol when executed under noise.<n>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.
  arXiv  Detail & Related papers  (2026-02-03T13:52:13Z)
• Circuit Partitioning for the Quantum Internet [3.8516680239451744]
  In a quantum internet, quantum processing units (QPUs) with varying architectures and capabilities may be connected through quantum communication channels.<n>Remote operations between QPUs are expensive as they require the creation and distribution of entanglement throughout the network.<n>It is therefore crucial to assign qubits to QPUs and partition circuits in such a way that the overall communication between QPUs is minimized.
  arXiv  Detail & Related papers  (2025-09-17T20:28:36Z)
• A Framework for Quantum Data Center Emulation Using Digital Quantum Computers [4.4249067508724815]
  We propose a framework that emulates a distributed quantum computing system using a single quantum processor.<n>We introduce an experimentally grounded noise model based on quantum collision dynamics to quantify the interconnect-induced noise.<n>The framework is validated using IBM's quantum hardware, demonstrating the successful execution of remote gates.
  arXiv  Detail & Related papers  (2025-09-04T09:04:54Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A Modular Quantum Compilation Framework for Distributed Quantum Computing [0.0]
  Distributed Quantum Computing is a scalable approach for increasing the number of available qubits for computational tasks. We present a modular quantum compilation framework for DQC that takes into account both network and device constraints. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations.
  arXiv  Detail & Related papers  (2023-05-04T16:13:23Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering [3.187381965457262]
  We develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the quantum steering effect. Our findings provide a meaningful connection between steering, entanglement, quantum algorithms, and quantum computational complexity theory.
  arXiv  Detail & Related papers  (2023-03-14T13:55:06Z)
• ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors [25.18520278107402]
  Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits. Quantum circuit cutting techniques cut and distribute a large quantum circuit into multiple smaller subcircuits feasible for less powerful QPUs. Our tool, called ScaleQC, addresses the bottlenecks by developing novel algorithmic techniques.
  arXiv  Detail & Related papers  (2022-07-03T01:44:31Z)
• Cutting Quantum Circuits to Run on Quantum and Classical Platforms [25.18520278107402]
  CutQC is a scalable hybrid computing approach that distributes a large quantum circuit onto quantum (QPU) and classical platforms ( CPU or GPU) for co-processing. It achieves much higher quantum circuit evaluation fidelity than the large NISQ devices achieve in real-system runs.
  arXiv  Detail & Related papers  (2022-05-12T02:09:38Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.