Distributed Quantum Computing with Fan-Out Operations and Qudits: the Case of Distributed Global Gates (a Preliminary Study)

• URL: http://arxiv.org/abs/2512.03685v1
• Date: Wed, 03 Dec 2025 11:26:47 GMT
• Title: Distributed Quantum Computing with Fan-Out Operations and Qudits: the Case of Distributed Global Gates (a Preliminary Study)
• Authors: Seng W. Loke,
• Abstract summary: 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.
• Score: 2.720960618356385
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Much recent work on distributed quantum computing have focused on the use of entangled pairs and distributed two qubit gates. But there has also been work on efficient schemes for achieving multipartite entanglement between nodes in a single shot, removing the need to generate multipartite entangled states using many entangled pairs. This paper looks at how multipartite entanglement resources (e.g., GHZ states) can be useful for distributed fan-out operations; we also consider the use of qudits of dimension four for distributed quantum circuit compression. In particular, we consider how such fan-out operations and qudits can be used to implement circuits which are challenging for distributed quantum computation, involving pairwise qubit interactions, i.e., what has been called global gates (a.k.a. global Mølmer-Sørensen gates). Such gates have been explored to possibly yield more efficient computations via reduced circuit depth, and can be carried out efficiently in some types of quantum hardware (e.g., trapped-ion quantum computers); we consider this as an exploration of an ``extreme'' case for distribution given the global qubit-qubit interactions. We also conclude with some implications for future work on quantum circuit compilation and quantum data centre design.

Related papers

• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Scalable modular architecture for universal quantum computation [45.989522481082986]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Universal distributed blind quantum computing with solid-state qubits [0.0]
  Blind quantum computing is a promising application of distributed quantum systems.<n>We experimentally demonstrate a universal quantum gate set consisting of single- and two-qubit blind gates over a distributed two-node network.<n>We perform a distributed algorithm with blind operations across our two-node network, paving the way towards blind quantum computation with matter qubits in distributed, modular architectures.
  arXiv  Detail & Related papers  (2024-12-04T04:13:46Z)
• 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)
• 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)
• Towards Distributed Quantum Computing by Qubit and Gate Graph Partitioning Techniques [1.211184870567714]
  We propose two techniques for partitioning large quantum circuits and for distribution to small quantum computers. Our techniques map a quantum circuit to a graph representation. We use the SeQUeNCe quantum communication simulator to measure the time required for generating all the entanglements required to execute the distributed circuit.
  arXiv  Detail & Related papers  (2023-10-05T23:21:18Z)
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits [11.881366909450376]
  Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. One of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. We propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits.
  arXiv  Detail & Related papers  (2022-06-22T16:33:58Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Separation of gates in quantum parallel programming [1.4821822452801385]
  Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming. Main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. We theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems.
  arXiv  Detail & Related papers  (2021-10-28T09:11:41Z)
• 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)
• Efficient quantum programming using EASE gates on a trapped-ion quantum computer [1.9610635155358869]
  We focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. We show an $n$-qubit Clifford circuit can be implemented using $6log(n)$ EASE gates, an $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and an $n$-qubit permutation can be implemented using six EASE gates.
  arXiv  Detail & Related papers  (2021-07-15T20:03:23Z)
• 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.