Full-Rank Noise Forbids Long-Range Entanglement Swapping

• URL: http://arxiv.org/abs/2609.11021v1
• Date: Thu, 10 Sep 2026 02:58:05 GMT
• Title: Full-Rank Noise Forbids Long-Range Entanglement Swapping
• Abstract summary: Quantum repeaters extend entanglement by swapping noisy elementary links.<n>We prove that full-rank noise forbids this at long range.<n>We construct link state families of rank three and rank two that admit postselected measurement outcome branches.
• Score: 8.373057326694193
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum repeaters extend entanglement by swapping noisy elementary links. We prove that full-rank noise forbids this at long range: for any entangled full-rank two-qubit link, there is a finite depth beyond which no end-to-end entanglement can be established regardless of the measurement outcomes on intermediate qubits, even under any adaptive postselected strategy. This limit is set by one spectral parameter of the link, giving a no-go criterion for repeater routing. In contrast, we construct link state families of rank three and rank two that admit postselected measurement outcome branches of exponentially small probability but with strictly positive concurrence at every finite depth. Swapping experiments on a superconducting processor show that links of equal initial concurrence but different rank behave differently under postselected swapping. In the language of many-body physics, the chain is a matrix-product density operator, and full-rank bonds forbid long-range localizable entanglement, while rank-deficient bonds can sustain it.

Related papers

• When Does Low-Bit Quantization Preserve the Decisions of Vector Search? [13.71460633144793]
  Low-bit quantization can achieve high recall on some vector representations and fail sharply on others.<n>We study quantized vector search at the level of the comparisons consumed by ranking and graph-pruning algorithms.<n>Across learned, classical, and synthetic embeddings, standardized exact margins predict held-out ranking and pruning flip rates substantially better than global rank correlation.
  arXiv  Detail & Related papers  (2026-09-09T08:06:50Z)
• Static entanglement structure and adiabatic Bell-state preparation in the tripartite quantum Rabi model [20.740233476359148]
  tripartite quantum Rabi model couples two qubits to a bosonic mode through a collective spin-oscillator interaction.<n>In the zero-detuning limit, the triplet part of the spectrum splits into branches with zero and maximal entanglement.<n>We show how collective spin-oscillator coupling reorganizes spectral entanglement and connects static branch structure to finite-time Bell-state preparation.
  arXiv  Detail & Related papers  (2026-07-11T14:24:18Z)
• Entanglement as a Structural Complexity Axis: A PAC-Bayesian View of Generalization in Quantum Policies and Value Functions [31.082191748525137]
  We give a PACBayesian account in which generalization is governed by the effective dimension of the Fisher geometry induced by the circuit.<n>We find that circuits with larger Fisher effective dimension exhibit larger train-test gaps, while parameter count is a weak predictor.<n>We validate this mechanism across supervised classification, quantum contextual bandits, and value-function generalizations.
  arXiv  Detail & Related papers  (2026-07-07T12:57:46Z)
• Enabling Deterministic Passive Quantum State Transfer with Giant Atoms [30.634025315483466]
  Achieving quantum state transfer in passive ways can become a powerful asset for scalable quantum networks.<n>We show that giant atoms coupled to 1D waveguides provide a platform for such a passive, deterministic transfer.<n>Our results establish giant atoms as a powerful platform for realizing high-fidelity quantum state transfer in a setting without time-dependent control.
  arXiv  Detail & Related papers  (2026-05-12T12:06:28Z)
• Balancing Quantum Memories in Asymmetric Repeaters for High-Fidelity Entanglement Distribution [4.0793518660737]
  At the core of the quantum Internet lie quantum repeaters that enable remote end-to-end entanglement generation.<n>In this paper, we consider the mismatch problem in an asymmetric repeater with different distances to its adjacent nodes.<n>Under the optimal allocation, we derive statistical lower bounds on the achievable rate and fidelity.
  arXiv  Detail & Related papers  (2026-04-27T14:45:27Z)
• Approaching the Limit in Multiparameter AC Magnetometry with Quantum Control [22.22957615478987]
  We introduce a quantum control protocol that resolves the problem of estimating the amplitude and frequency of an AC magnetic field.<n>It not only removes the singularity but also restores the optimal scaling of precision with interrogation time for both parameters simultaneously.<n>We experimentally validate this protocol using a nitrogen-vacancy center in diamond at room temperature, demonstrating the concurrent achievement of the optimal scaling for both parameters.
  arXiv  Detail & Related papers  (2026-02-19T18:55:17Z)
• Polynomial-time certification of fidelity for many-body mixed states and mixed-state universality classes [23.9304612104967]
  We introduce a-time algorithm to compute certified lower and upper bounds for fidelity between matrix product density operators.<n>Our results offer an exponential improvement in precision over known moment-based bounds.
  arXiv  Detail & Related papers  (2026-01-19T19:13:28Z)
• Mathieu Control of the Effective Coupling in Superconducting Qubits [20.610851170086384]
  We present Mathieu control, which uses a non-resonant two-photon drive to create a selective nonlinear frequency shift.<n>This shift modifies interactions while preserving qubit states, enabling continuous tuning of the ZZ coupling.<n>For a qubit-coupler-qubit device, it allows independent ZZ control, facilitating a programmable Heisenberg (XXZ) Hamiltonian.
  arXiv  Detail & Related papers  (2025-12-31T17:37:44Z)
• On the accuracy of twirled approximations in repeater chains [0.0]
  In quantum networks, it is common to approximate bipartite entangled states as either being Bell-diagonal or Werner states.<n>We consider repeater chains where end-to-end entanglement is achieved by performing an entanglement swap at each repeater in the chain.<n>We show that, for non-postselected swapping, the Bell-diagonal approximation is exact for the computation of the Bell-diagonal elements of the end-to-end state.<n>We also find bounds on the difference in end-to-end fidelity from what is obtained with the twirled approximation, for initial states with a general noisy form
  arXiv  Detail & Related papers  (2025-09-20T13:33:26Z)
• Optimal Fidelity-Aware Entanglement Distribution in Linear Quantum Networks [5.136852624384612]
  We study the problem of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network. We propose two algorithms, the Purify-then-Swap (PtS) and Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order.
  arXiv  Detail & Related papers  (2024-07-12T11:09:30Z)
• Maximum tolerable excess noise in continuous-variable quantum key distribution and improved lower bound on two-way capacities [5.188841610098437]
  We find a new lower bound on the energy-constrained and unconstrained two-way quantum and secret-key capacities of all phase-insensitive bosonic Gaussian channels.<n>Ours is the first nonzero lower bound on the two-way quantum capacity in the parameter range where the (reverse) coherent information becomes negative.
  arXiv  Detail & Related papers  (2023-03-22T19:00:05Z)

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.