Network-assisted collective operations for efficient distributed quantum computing

• URL: http://arxiv.org/abs/2502.19118v2
• Date: Thu, 06 Nov 2025 20:07:47 GMT
• Title: Network-assisted collective operations for efficient distributed quantum computing
• Authors: Iago Fernández Llovo, Guillermo Díaz-Camacho, Natalia Costas Lago, Andrés Gómez Tato,
• Abstract summary: We propose a scheme for the distribution of collective quantum operations among remote quantum processing units.<n>We show that a general diagonal gate can be distributed among any number of nodes and provide the ebit cost bounds.<n>We provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed quantum computing relies on coordinated operations between remote quantum processing units (QPUs), yet most existing work either assumes full connectivity, unrealistic for large networks, or relies on entanglement swapping. To mitigate the overhead of communication, we propose a scheme for the distribution of collective quantum operations among remote quantum processing units by exploiting distributed fan-out operations to a central node in network architectures similar to those used for high-performance computing, which requires only pre-shared entanglement, local operations and classical communication. We show that a general diagonal gate can be distributed among any number of nodes and provide the ebit cost bounds. For a single distributed multicontrolled gate, this amounts to a single additional Bell pair over the theoretically optimal calculation with all-to-all pre-shared entanglement, demonstrating better scalability when compared to current proposals based on entanglement swapping through a network. We provide a recipe for the lumped distribution of gates such as arbitrarily-sized Toffoli and multicontrolled Z, and $R_{zz}(\theta)$ gates. Finally, we provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit, with Bell pair cost growing linearly with the number of Grover iterations and the number of partitions, and show how these techniques can be applied to other algorithms such as QAOA. Our results show that alternative approaches to entanglement swapping can provide major benefits in distributed quantum computing, pointing to promising avenues for future research.

Related papers

• Distributed Quantum Computing with Fan-Out Operations and Qudits: the Case of Distributed Global Gates (a Preliminary Study) [2.720960618356385]
  This paper looks at how multipartite entanglement resources can be useful for distributed fan-out operations.<n>We also consider the use of qudits of dimension four for distributed quantum circuit compression.
  arXiv  Detail & Related papers  (2025-12-03T11:26:47Z)
• COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms [4.584616394519209]
  We introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs.<n>Unlike other schemes, which must choose between optimality in circuit depth or GHZ width, COMPAS achieves both at once.<n>We analyze network-level errors and simulate the effects of circuit-level noise on the architecture.
  arXiv  Detail & Related papers  (2025-11-28T18:31:15Z)
• Network Operations Scheduling for Distributed Quantum Computing [0.0]
  We compare and contrast two approaches to solving the make span minimization problem.<n>One approach is based on the resource constrained project scheduling (RCPSP) framework, and another based on a greedy algorithm.<n>Our results illustrate the effectiveness of the RCPSP framework, while also underlining the relevance and usefulness of greedy algorithms.
  arXiv  Detail & Related papers  (2025-11-17T18:40:50Z)
• Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers [0.0]
  It is crucial to develop methods and software that minimize the number of inter-QPU communications.<n>Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost.<n>We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach.
  arXiv  Detail & Related papers  (2025-07-01T18:00:02Z)
• Multi-Target Rydberg Gates via Spatial Blockade Engineering [47.582155477608445]
  Multi-target gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. We propose single-control-multi-target CZotimes N gates on a single-species neutral-atom platform. We synthesise smooth control pulses for CZZ and CZZZ gates, achieving fidelities of up to 99.55% and 99.24%, respectively.
  arXiv  Detail & Related papers  (2025-04-21T17:59:56Z)
• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates. We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• A Control Architecture for Entanglement Generation Switches in Quantum Networks [1.0282274843007797]
  Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource. Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS) The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement.
  arXiv  Detail & Related papers  (2023-09-05T10:06:48Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Realization of Scalable Cirac-Zoller Multi-Qubit Gates [5.309268373861329]
  The universality in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
  arXiv  Detail & Related papers  (2023-01-18T14:34:24Z)
• Entanglement-efficient bipartite-distributed quantum computing [1.2878452281783466]
  In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit can be extended through distributed quantum computing. To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol. We extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally.
  arXiv  Detail & Related papers  (2022-12-24T08:45:44Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Controlled Gate Networks Applied to Eigenvalue Estimation [0.28106259549258145]
  We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates.
  arXiv  Detail & Related papers  (2022-08-29T12:46:46Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• Approaching the theoretical limit in quantum gate decomposition [0.0]
  We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
  arXiv  Detail & Related papers  (2021-09-14T15:36:22Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.