Quantum-network nodes with real-time noise mitigation using spectator qubits

• URL: http://arxiv.org/abs/2505.05582v1
• Date: Thu, 08 May 2025 18:24:32 GMT
• Title: Quantum-network nodes with real-time noise mitigation using spectator qubits
• Authors: S. J. H. Loenen, Y. Wang, N. Demetriou, C. E. Bradley, T. H. Taminiau,
• Abstract summary: Quantum networks might enable quantum communication and distributed quantum computation.<n>We introduce a method that uses spectator' qubits combined with real-time decision making and feedforward to mitigate dephasing of stored quantum states during remote entanglement sequences.<n>Our results show that spectator qubits can improve quantum network memory using minimal overhead and naturally present resources.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum networks might enable quantum communication and distributed quantum computation. Solid-state defects are promising platforms for such networks, because they provide an optical interface for remote entanglement distribution and a nuclear-spin register to store and process quantum information. A key challenge towards larger networks is to improve the storage of previously generated entangled states during new entanglement generation. Here, we introduce a method that uses `spectator' qubits combined with real-time decision making and feedforward to mitigate dephasing of stored quantum states during remote entanglement sequences. We implement the protocol using a single NV center in diamond and demonstrate improved memory fidelity. Our results show that spectator qubits can improve quantum network memory using minimal overhead and naturally present resources, making them a promising addition for near-term testbeds for quantum networks.

Related papers

• Resource Estimation for Delayed Choice Quantum Entanglement Based Sneakernet Networks Using Neutral Atom qLDPC Memories [0.0]
  We design a quantum communication network with a central party connecting the users through delayed-choice quantum entanglement swapping.<n>Our analysis compares this approach with traditional surface codes, demonstrating that qLDPC codes offer superior scaling in terms of resource efficiency and logical qubit count.<n>We show that with near-term attainable patch sizes, one can attain medium-to-high fidelity correlations, paving the way towards large-scale commercial quantum networks.
  arXiv  Detail & Related papers  (2024-10-02T03:39:45Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Quantum networks with neutral atom processing nodes [0.42970700836450487]
  Quantum networks providing shared entanglement over a mesh of quantum nodes will revolutionize the field of quantum information science. Recent experimental progress with individual neutral atoms demonstrates a high potential for implementing the crucial components of such networks. We describe both the functionality requirements and several examples for advanced, large-scale quantum networks composed of neutral atom processing nodes.
  arXiv  Detail & Related papers  (2023-04-04T19:34:13Z)
• 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)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Robust quantum-network memory based on spin qubits in isotopically engineered diamond [0.0]
  We show that a single 13C spin in isotopically engineered diamond offers a long-lived quantum memory that is robust to the optical link operation of an NV centre. Our results pave the way for test-bed quantum networks capable of investigating complex algorithms and error correction.
  arXiv  Detail & Related papers  (2021-11-18T16:13:45Z)
• Qubit teleportation between non-neighboring nodes in a quantum network [0.0]
  Future quantum internet applications will derive their power from the ability to share quantum information across the network. Here we realize quantum teleportation between remote, non-neighboring nodes in a quantum network. We demonstrate that once successful preparation of the teleporter is heralded, arbitrary qubit states can be teleported with fidelity above the classical bound.
  arXiv  Detail & Related papers  (2021-10-21T18:00:01Z)
• Multiplexed telecom-band quantum networking with atom arrays in optical cavities [0.3499870393443268]
  We propose a platform for quantum processors comprising neutral atom arrays with telecom-band photons in a multiplexed network architecture. The use of a large atom array instead of a single atom mitigates the deleterious effects of two-way communication and improves the entanglement rate between two nodes by nearly two orders of magnitude.
  arXiv  Detail & Related papers  (2021-07-09T15:05:57Z)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• 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)

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.