Macroscopic entanglement distribution with atomic ensembles

• URL: http://arxiv.org/abs/2603.06085v1
• Date: Fri, 06 Mar 2026 09:38:52 GMT
• Title: Macroscopic entanglement distribution with atomic ensembles
• Abstract summary: A protocol for deterministic long-distance distribution of macroscopic entanglement over a network of ensembles was introduced.<n>We develop improved numerical techniques that allow calculation of realistic ensemble sizes up to 106.<n>We find that moderate dephasing leaves the entanglement largely intact at the magic times, whereas stronger noise monotonically suppresses the entanglement.
• Score: 5.361197392348931
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The distribution of entanglement is a crucial task for quantum communication towards realizing a globe-spanning quantum internet. Recently a protocol for deterministic long-distance distribution of macroscopic entanglement over a network of ensembles of qubits was introduced [Adv. Quantum Technol. 2025, 8, 2400524]. It was shown that this protocol allows for the propagation of macroscopic amounts of entanglement with a protocol complexity that is independent on the ensemble size. However, questions remained on whether the scheme is viable, particularly for a large particle number, which is the case for realistic atomic ensembles. Here we develop improved numerical techniques that allow calculation of realistic ensemble sizes up to 10^6 with a negligible loss of accuracy. We find that moderate dephasing leaves the entanglement largely intact at the magic times, whereas stronger noise monotonically suppresses the entanglement. Our results demonstrate that the protocol retains its functionality towards the macroscopic regime and provides quantitative benchmarks for its robustness under a realistic level of decoherence.

Related papers

• Distributed variational quantum computing with deterministic entanglement tuning [3.9169750999792092]
  Gate teleportation enables universal computation across distributed nodes.<n>We propose a distributed variational quantum computing protocol based on deterministic entanglement tuning.<n>Our results suggest a practical alternative for near-term distributed quantum applications.
  arXiv  Detail & Related papers  (2026-09-10T00:36:39Z)
• Large Scale Entanglement Structure Detection in 100-Qubit Systems via Local Joint Measurements [38.19492379134641]
  We introduce a scalable framework that recognizes large-scale entanglement structures directly from local correlation fingerprints.<n>In noisy simulations, this protocol classifies GHZ-, W-, and cluster-type structures among 30 candidate partitions with a mean accuracy exceeding 95%.<n>We further validate the protocol on a superconducting quantum processor, where it reliably classifies block structures for systems of up to 13 qubits.
  arXiv  Detail & Related papers  (2026-08-20T15:25:03Z)
• Autonomous stabilization of remote entanglement in a cascaded quantum network [0.44970015278813036]
  We show that remote entanglement can be stabilized indefinitely, instead of only periodically regenerated and redistributed after decay.<n>Our results enable on-demand delivery of high-fidelity entanglement in modular quantum processors and networks.
  arXiv  Detail & Related papers  (2025-09-15T12:50:35Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Robust and Indestructible Macroscopic Entanglement [0.0]
  We investigate the possibility of observing macroscopic entanglement, considering realistic factors such as decoherence, particle losses, and measurements of limited precision.<n>We propose an even more resilient concept of macroscopic entanglement, allowing the parties to randomly select their portion of the shared system.
  arXiv  Detail & Related papers  (2025-02-21T09:44:20Z)
• Contractive Unitary and Classical Shadow Tomography [8.406921897932131]
  Full quantum state tomography requires an exponential number of measurements in system size.<n>This work shows that a random-deterministic hybridized protocol can be more efficient than fully random measurements.
  arXiv  Detail & Related papers  (2024-11-28T18:59:12Z)
• Quantum repeater protocol for deterministic distribution of macroscopic entanglement [0.0]
  We present a method to distribute a macroscopic amount of entanglement across long-distances using a number of operations that scales only linearly with the chain length. We show that there are particular magic'' interaction times that allow for distribution of entanglement with perfect fidelity, with no degradation with chain length.
  arXiv  Detail & Related papers  (2024-07-31T20:01:13Z)
• Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain [43.80709028066351]
  Local quantum measurements do not simply disentangle degrees of freedom, but may actually strengthen the entanglement in the system.<n>This paper explores how a finite density of local measurement modifies a given state's entanglement structure.
  arXiv  Detail & Related papers  (2023-10-04T09:51:00Z)
• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits [0.0]
  We study the generation of the simplest long-range order on a 127 superconducting qubit device. By experimentally tuning coherent and incoherent error rates, we demonstrate stability of this decoded long-range order in two spatial dimensions. Our study exemplifies how measurement-based state preparation can be meaningfully explored on quantum processors beyond a hundred qubits.
  arXiv  Detail & Related papers  (2023-09-06T09:43:12Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Dissipative preparation and stabilization of many-body quantum states in a superconducting qutrit array [55.41644538483948]
  We present and analyze a protocol for driven-dissipatively preparing and stabilizing a manifold of quantum manybody entangled states. We perform theoretical modeling of this platform via pulse-level simulations based on physical features of real devices. Our work shows the capacity of driven-dissipative superconducting cQED systems to host robust and self-corrected quantum manybody states.
  arXiv  Detail & Related papers  (2023-03-21T18:02:47Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)

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.