pith. sign in

arxiv: 2407.00835 · v1 · pith:XM6C5QUMnew · submitted 2024-06-30 · 🪐 quant-ph

Distributed Quantum Computing across an Optical Network Link

classification 🪐 quant-ph
keywords quantumcomputingdistributedmodulesnetworkqubitsacrossalgorithm
0
0 comments X
read the original abstract

Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, enabling the execution of large quantum circuits without compromising on performance and 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, there has been no demonstration satisfying these requirements. We experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules are separated by $\sim$ 2 m, and each contains dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover's search algorithm - the first implementation of a distributed quantum algorithm comprising multiple non-local two-qubit gates - and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with 2 and 3 instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations. As photons can be interfaced with a variety of systems, this technique has applications extending beyond trapped-ion quantum computers, providing a viable pathway towards large-scale quantum computing for a range of physical platforms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Error-Resilient Fast Entangling Gates for Scalable Ion-Trap Quantum Processors

    quant-ph 2025-08 conditional novelty 6.0

    An error-resilient gate search scheme using multi-objective optimization and pulse symmetries enables microsecond two-qubit gates with fidelities approaching 99.9% in linear ion traps of up to 50 ions.

  2. High-speed and high-connectivity two-qubit gates in long chains of trapped ions

    quant-ph 2025-06 unverdicted novelty 6.0

    Impulsive spin-dependent excitation enables high-fidelity non-local entangling gates between arbitrary ion pairs in chains of up to 40 trapped ions within 1.3-2 center-of-mass oscillation periods.