Unconditionally teleported quantum gates between remote solid-state qubit registers

• URL: http://arxiv.org/abs/2601.04848v1
• Date: Thu, 08 Jan 2026 11:38:08 GMT
• Title: Unconditionally teleported quantum gates between remote solid-state qubit registers
• Authors: Mariagrazia Iuliano, Nicolas Demetriou, H. Benjamin van Ommen, Constantijn Karels, Tim H. Taminiau, Ronald Hanson,
• Abstract summary: Quantum networks connecting quantum processing nodes via photonic links enable distributed and modular quantum computation.<n>In this framework, quantum gates between remote qubits can be realized using quantum teleportation protocols.<n>We demonstrate an unconditional Controlled-NOT quantum gate between remote diamond-based qubit devices.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum networks connecting quantum processing nodes via photonic links enable distributed and modular quantum computation. In this framework, quantum gates between remote qubits can be realized using quantum teleportation protocols. The essential requirements for such non-local gates are remote entanglement, local quantum logic within each processor, and classical communication between nodes to perform operations based on measurement outcomes. Here, we demonstrate an unconditional Controlled-NOT quantum gate between remote diamond-based qubit devices. The control and target qubits are Carbon-13 nuclear spins, while NV electron spins enable local logic, readout, and remote entanglement generation. We benchmark the system by creating a Greenberger-Horne-Zeilinger state, showing genuine 4-partite entanglement shared between nodes. Using deterministic logic, single-shot readout, and real-time feed-forward, we implement non-local gates without post-selection. These results demonstrate a key capability for solid-state quantum networks, enabling exploration of distributed quantum computing and testing of complex network protocols on fully integrated systems.

Related papers

• Realization of Thread Level Parallelism on Quantum Devices [0.052118759008482306]
  We introduce a classical linkage scheme that merges multiple independent quantum processing units (QPUs) into a single logical device.<n>We validate this architecture on clusters comprising up to sixteen benchtop nuclear magnetic resonance (NMR) quantum nodes.<n>Our results demonstrate that classical links suffice to scale up the logical size of quantum computations and realize general, non-unitary channels on today's hardware.
  arXiv  Detail & Related papers  (2025-11-07T17:12:41Z)
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks [37.23288214515363]
  It is critically important to analyze the achievability of quantum advantage under realistic imperfections.<n>We show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only distribute noisy entangled states.
  arXiv  Detail & Related papers  (2024-09-25T16:55:07Z)
• Distributed Quantum Computing in Silicon [40.16556091789959]
  We present preliminary demonstrations of some key distributed quantum computing protocols on silicon T centres in isotopically-enriched silicon. We demonstrate the distribution of entanglement between modules and consume it to apply a teleported gate sequence.
  arXiv  Detail & Related papers  (2024-06-03T18:02:49Z)
• Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback [14.314126139226314]
  In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths which grow with the number of entangled qubits.<n>In teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits.
  arXiv  Detail & Related papers  (2024-03-27T17:06:00Z)
• Universal Quantum Computing with Field-Mediated Unruh--DeWitt Qubits [0.0]
  A set of universal quantum gates is a vital part of the theory of quantum computing. UDW detectors in simple settings enable a collection of gates known to provide universal quantum computing.
  arXiv  Detail & Related papers  (2024-02-15T18:19:45Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Location qubits in a multi-quantum-dot system [0.0]
  We introduce novel location qubits, describe a method to construct a universal set of all-optical quantum gates, and simulate their performance in realistic structures. Our results show that location qubits can maintain coherence 5 orders of magnitude longer than single-qubit operation time, and single-qubit gate errors do not exceed 0.01%.
  arXiv  Detail & Related papers  (2021-07-13T10:00:16Z)
• A Quantum-Logic Gate between Distant Quantum-Network Modules [2.810625954925815]
  Quantum networks promise a solution by integrating smaller qubit modules to a larger computing cluster. Here we experimentally realize such a gate over a distance of 60m. Our non-local quantum-logic gate could be extended both to multiple qubits and many modules for a tailor-made multi-qubit computing register.
  arXiv  Detail & Related papers  (2021-03-24T11:13:44Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)
• A P4 Data Plane for the Quantum Internet [68.97335984455059]
  A new -- quantum -- network stack will be needed to account for the fundamentally new properties of quantum entanglement. In the non-quantum world, programmable data planes have broken the pattern of ossification of the protocol stack. We demonstrate how we use P4$_16$ to explore abstractions and device architectures for quantum networks.
  arXiv  Detail & Related papers  (2020-10-21T19:37:23Z)

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.