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:2407.00835 · Nature

Distributed quantum computing across an optical network link

D. Main, P. Drmota, D. P. Nadlinger, E. M. Ainley, A. Agrawal, B. C. Nichol, R. Srinivas, G. Araneda, D. M. Lucas

Published Feb 5, 2025• 201 citations
arXivHTMLPDF

Abstract

Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover’s search algorithm 5 —to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates—and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.

DOI
10.1038/s41586-024-08404-x

Related papers

Distributed quantum computing across a two-node trapped-ion quantum network

Main, Dougal

Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or connectivity. Photonic networks are well-suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity via quantum gate teleportation (QGT). For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. In this thesis, we report the first experimental demonstration of distributed quantum computing across a quantum network of two photonically interconnected trapped-ion modules. Our experimental apparatus comprises two trapped-ion modules, separated by ∼ 2 m, each co-trapping one 43Ca+ ion and one 88Sr+ ion. The 43Ca+ ions provide a robust quantum memory for the modules, while the 88Sr+ ions provide an interface to the optical quantum network, enabling the remote entanglement of 88Sr+ ions in separate modules. Using local mixed-species operations, we demonstrate the enhanced functionality of the mixed-species trapped-ion quantum network by creating more complex remotely entangled states. These include remote 88Sr+- 43Ca+ and 43Ca+-43Ca+ entanglement, as well as 3- and 4-qubit mixed-species GHZ states. Additionally, we demonstrate the storage of remote entanglement in the 43Ca+ ions for up to 10 s. Utilising these techniques, we demonstrate the distribution of quantum computations across the mixed-species trapped-ion quantum network. Using heralded remote entanglement between the 88Sr+ ions, we deterministically teleport controlled Z gates between two 43Ca+ ions in separate modules, achieving a fidelity of 86 %. We then implement distributed iSWAP and SWAP circuits, compiled with 2 and 3 instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations. Finally, we execute Grover’s search algorithm – the first implementation of a distributed quantum algorithm comprising multiple non-local two-qubit gates – and measure a success rate of 71 %. These results represent a significant step towards realising a large-scale distributed quantum computer.

•Jan 1, 2024•0 citations

Error Correction in a Distributed Quantum Computer

E. M. Ainley, A. Agrawal, T. Araki +12 more

Building fault-tolerant quantum computers with large numbers of logical qubits requires both scalable hardware architectures and error-correcting codes that make efficient use of physical qubits. Photonic interconnects address both of these challenges by allowing the physical qubits to be distributed across multiple processors while providing the non-local connectivity necessary to implement resource-efficient codes such as high-rate quantum low-density parity-check (qLDPC) codes. A key requirement for realising this architecture is the ability to perform stabiliser measurements between remote processors, which has not previously been demonstrated experimentally. Here we report the first experimental demonstration of distributed quantum error detection and correction. We generate entanglement between network qubits in two separate trapped-ion processors and use it to perform remote syndrome measurements on data qubits. We first realise a distributed [[2, 1, 1]] repetition code, detecting phase-flip errors on a logical qubit encoded across the two modules in real time and suppressing logical errors. We then combine these mid-circuit syndrome measurements with real-time feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state. These results provide an experimental foundation for quantum error correction (QEC) across modular quantum architectures.

quant-pharXiv:2609.13065•Sep 14, 2026•0 citations

Simulation-based Analysis of Distributed Quantum Computing with Remote Gates

Benedikt Baier, Wolfgang Kellerer

Quantum computers offer computational advantages for specific problems over classical systems [8], but today's devices are limited by qubit counts and susceptibility to noise. Distributed quantum computing (DQC) addresses these constraints by interconnecting quantum processors via quantum networks to enable cooperative execution of quantum algorithms [4]. DQC can be realized either through quantum teleportation [3], which transfers qubit states across nodes, or through remote gates [7], which enact quantum operations between spatially separated qubits while preserving their physical allocation. Both approaches depend on pre-shared entanglement, which must be distributed across potentially multi-hop quantum networks via entanglement swapping [11]. In realistic settings, DQC performance is influenced by factors such as entanglement fidelity, quantum memory coherence time, and routing path length, yet the impact of these parameters on computational fidelity remains insufficiently understood. This work investigates these effects through simulation of distributed Grover circuits executed over quantum networks with 1-4 routers, incorporating entanglement swapping, network delays, and varying physical constraints to assess how network-level properties affect circuit-level performance.

Workshop on Quantum Networks and Distributed Quantum Computing (QuNet)•Aug 19, 2025•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

SDQC: Distributed Quantum Computing Architecture Utilizing Entangled Ion Qubit Shuttling

Seunghyun Baek, Seok-Hyung Lee, Dongmoon Min +1 more

We propose Shuttling-based Distributed Quantum Computing (SDQC), a hybrid architecture that combines the strengths of physical qubit shuttling and distributed quantum computing to enable scalable trapped-ion quantum computing. SDQC performs non-local quantum operations by distributing entangled ion qubits via deterministic shuttling, combining the high-fidelity and deterministic operations of shuttling-based architectures with the parallelism and pipelining advantages of distributed quantum computing. We present (1) a practical architecture incorporating quantum error correction (QEC), (2) pipelining strategies to exploit parallelism in entanglement distribution and measurement, and (3) a performance evaluation in terms of logical error rate and clock speed. For a 256-bit elliptic-curve discrete logarithm problem (ECDLP) instance, which requires 2,871 logical qubits at code distance 13, SDQC achieves a logical error rate which is $1.20^{+0.94}_{-0.45}\times10^{-8}$ of Photonic DQC error rate and $3.79^{+5.09}_{-2.84}\times10^{-3}$ of Quantum Charge-Coupled Device (QCCD) error rate, while providing 2.82 times faster logical clock speed than QCCD.

quant-pharXiv:2512.02890•Dec 3, 2025•0 citations

A large-scale reconfigurable multiplexed quantum photonic network

Natalia Herrera Valencia, Annameng Ma, Suraj Goel +5 more

The distribution of entanglement in quantum networks will enable the next generation of technologies in quantum-secured communications, distributed quantum computing and sensing. Future quantum networks will require dense connectivity, allowing multiple users to share entanglement in a reconfigurable and multiplexed manner, while long-distance connections are established through the teleportation of entanglement, or entanglement swapping. Although several recent works have demonstrated fully connected, local multi-user networks based on multiplexing, extending such networks to a global network architecture of interconnected local networks remains an outstanding challenge. Here we demonstrate the next step in the evolution of multiplexed quantum networks-a prototype global reconfigurable network in which entanglement is routed and teleported in a flexible and multiplexed manner between two local four-user networks. At the heart of our network is a programmable 8 × 8-dimensional multi-port circuit that harnesses the natural mode-mixing process inside of a multi-mode fibre to implement on-demand high-dimensional operations on two independent photons carrying eight transverse-spatial modes. Our circuit design allows us to break away from the limited planar geometry and bypass the control and fabrication challenges of conventional integrated photonic platforms. Our demonstration highlights the potential of this architecture for enabling large-scale, global quantum networks that offer versatile connectivity while being fully compatible with an existing communications infrastructure.

arXiv:2501.07272•Nature Photonics•Nov 26, 2025•6 citations
Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover’s search algorithm 5 —to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates—and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms.
Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or connectivity. Photonic networks are well-suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity via quantum gate teleportation (QGT). For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. In this thesis, we report the first experimental demonstration of distributed quantum computing across a quantum network of two photonically interconnected trapped-ion modules. Our experimental apparatus comprises two trapped-ion modules, separated by ∼ 2 m, each co-trapping one 43Ca+ ion and one 88Sr+ ion. The 43Ca+ ions provide a robust quantum memory for the modules, while the 88Sr+ ions provide an interface to the optical quantum network, enabling the remote entanglement of 88Sr+ ions in separate modules. Using local mixed-species operations, we demonstrate the enhanced functionality of the mixed-species trapped-ion quantum network by creating more complex remotely entangled states. These include remote 88Sr+- 43Ca+ and 43Ca+-43Ca+ entanglement, as well as 3- and 4-qubit mixed-species GHZ states. Additionally, we demonstrate the storage of remote entanglement in the 43Ca+ ions for up to 10 s. Utilising these techniques, we demonstrate the distribution of quantum computations across the mixed-species trapped-ion quantum network. Using heralded remote entanglement between the 88Sr+ ions, we deterministically teleport controlled Z gates between two 43Ca+ ions in separate modules, achieving a fidelity of 86 %. We then implement distributed iSWAP and SWAP circuits, compiled with 2 and 3 instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations. Finally, we execute Grover’s search algorithm – the first implementation of a distributed quantum algorithm comprising multiple non-local two-qubit gates – and measure a success rate of 71 %. These results represent a significant step towards realising a large-scale distributed quantum computer.
Building fault-tolerant quantum computers with large numbers of logical qubits requires both scalable hardware architectures and error-correcting codes that make efficient use of physical qubits. Photonic interconnects address both of these challenges by allowing the physical qubits to be distributed across multiple processors while providing the non-local connectivity necessary to implement resource-efficient codes such as high-rate quantum low-density parity-check (qLDPC) codes. A key requirement for realising this architecture is the ability to perform stabiliser measurements between remote processors, which has not previously been demonstrated experimentally. Here we report the first experimental demonstration of distributed quantum error detection and correction. We generate entanglement between network qubits in two separate trapped-ion processors and use it to perform remote syndrome measurements on data qubits. We first realise a distributed [[2, 1, 1]] repetition code, detecting phase-flip errors on a logical qubit encoded across the two modules in real time and suppressing logical errors. We then combine these mid-circuit syndrome measurements with real-time feedforward to actively correct arbitrary single-qubit Pauli errors on a distributed Bell state. These results provide an experimental foundation for quantum error correction (QEC) across modular quantum architectures.
Quantum computers offer computational advantages for specific problems over classical systems [8], but today's devices are limited by qubit counts and susceptibility to noise. Distributed quantum computing (DQC) addresses these constraints by interconnecting quantum processors via quantum networks to enable cooperative execution of quantum algorithms [4]. DQC can be realized either through quantum teleportation [3], which transfers qubit states across nodes, or through remote gates [7], which enact quantum operations between spatially separated qubits while preserving their physical allocation. Both approaches depend on pre-shared entanglement, which must be distributed across potentially multi-hop quantum networks via entanglement swapping [11]. In realistic settings, DQC performance is influenced by factors such as entanglement fidelity, quantum memory coherence time, and routing path length, yet the impact of these parameters on computational fidelity remains insufficiently understood. This work investigates these effects through simulation of distributed Grover circuits executed over quantum networks with 1-4 routers, incorporating entanglement swapping, network delays, and varying physical constraints to assess how network-level properties affect circuit-level performance.
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.
We propose Shuttling-based Distributed Quantum Computing (SDQC), a hybrid architecture that combines the strengths of physical qubit shuttling and distributed quantum computing to enable scalable trapped-ion quantum computing. SDQC performs non-local quantum operations by distributing entangled ion qubits via deterministic shuttling, combining the high-fidelity and deterministic operations of shuttling-based architectures with the parallelism and pipelining advantages of distributed quantum computing. We present (1) a practical architecture incorporating quantum error correction (QEC), (2) pipelining strategies to exploit parallelism in entanglement distribution and measurement, and (3) a performance evaluation in terms of logical error rate and clock speed. For a 256-bit elliptic-curve discrete logarithm problem (ECDLP) instance, which requires 2,871 logical qubits at code distance 13, SDQC achieves a logical error rate which is 1.20−0.45+0.94×10−81.20^{+0.94}_{-0.45}\times10^{-8}1.20−0.45+0.94​×10−8 of Photonic DQC error rate and 3.79−2.84+5.09×10−33.79^{+5.09}_{-2.84}\times10^{-3}3.79−2.84+5.09​×10−3 of Quantum Charge-Coupled Device (QCCD) error rate, while providing 2.82 times faster logical clock speed than QCCD.
The distribution of entanglement in quantum networks will enable the next generation of technologies in quantum-secured communications, distributed quantum computing and sensing. Future quantum networks will require dense connectivity, allowing multiple users to share entanglement in a reconfigurable and multiplexed manner, while long-distance connections are established through the teleportation of entanglement, or entanglement swapping. Although several recent works have demonstrated fully connected, local multi-user networks based on multiplexing, extending such networks to a global network architecture of interconnected local networks remains an outstanding challenge. Here we demonstrate the next step in the evolution of multiplexed quantum networks-a prototype global reconfigurable network in which entanglement is routed and teleported in a flexible and multiplexed manner between two local four-user networks. At the heart of our network is a programmable 8 × 8-dimensional multi-port circuit that harnesses the natural mode-mixing process inside of a multi-mode fibre to implement on-demand high-dimensional operations on two independent photons carrying eight transverse-spatial modes. Our circuit design allows us to break away from the limited planar geometry and bypass the control and fabrication challenges of conventional integrated photonic platforms. Our demonstration highlights the potential of this architecture for enabling large-scale, global quantum networks that offer versatile connectivity while being fully compatible with an existing communications infrastructure.