Entanglement-swapping measurements for deterministic entanglement distribution

• URL: http://arxiv.org/abs/2601.08581v1
• Date: Tue, 13 Jan 2026 14:04:39 GMT
• Title: Entanglement-swapping measurements for deterministic entanglement distribution
• Abstract summary: Entanglement swapping is a key primitive for distributing entanglement across nodes in quantum networks.<n>In standard protocols, the outcome of the intermediate measurement determines the resulting state, making the process inherently probabilistic and requiring postselection.<n>We show that an optimal measurement, maximizing a concurrence-type entanglement measure, is built from complex Hadamard matrices.
• Score: 7.073904707128546
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement swapping is a key primitive for distributing entanglement across nodes in quantum networks. In standard protocols, the outcome of the intermediate measurement determines the resulting state, making the process inherently probabilistic and requiring postselection. In this work, we fully characterize those measurements under which entanglement swapping becomes deterministic: for arbitrary pure inputs, every measurement outcome produces local-unitarily equivalent states. We also show that an optimal measurement, maximizing a concurrence-type entanglement measure, is built from complex Hadamard matrices. For this optimal protocol, we provide a complete, dimension-dependent classification of deterministic entanglement-swapping measurements: unique in dimensions $d=2,3$, infinite for $d=4$, and comprising $72$ inequivalent classes for $d=5$. We further consider a general network with multiple swapping nodes and show that, for $d=2,3$ the resulting end-to-end state is independent of the order in which the repeaters perform the optimal measurements. Our results establish optimal entanglement-swapping schemes that are post-selection free, in the sense that they distribute entanglement across generic quantum network architectures without unfavorable measurement outcomes.

Related papers

• Deterministic distribution of W-class states in quantum networks [0.0]
  Multipartite entangled states possess a number of non-intuitive properties, making them a useful resource for quantum information-processing tasks.<n>Here, we focus on the distribution of a non-symmetric version of such states, namely $W_mathrmmod$ states.<n>We describe a few protocols through which these multipartite entangled states can be distributed it deterministically in a quantum network.
  arXiv  Detail & Related papers  (2025-12-30T14:58:05Z)
• Multidimensional Uncertainty Quantification via Optimal Transport [87.97146725546502]
  We take a multidimensional view on uncertainty quantification (UQ) by stacking complementary UQ measures into a vector.<n>VecUQ-OT shows high efficiency even when individual measures fail.
  arXiv  Detail & Related papers  (2025-09-26T14:09:03Z)
• Classification of joint quantum measurements based on entanglement cost of localization [42.72938925647165]
  We propose a systematic classification of joint measurements based on entanglement cost. We show how to numerically explore higher levels and construct generalizations to higher dimensions and multipartite settings.
  arXiv  Detail & Related papers  (2024-08-01T18:00:01Z)
• 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)
• Optimal Second-Order Rates for Quantum Information Decoupling [14.932939960009605]
  We consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. We find an achievability bound in entanglement distillation protocol, where the objective is for Alice and Bob to transform their quantum state to maximally entangled state with largest possible dimension.
  arXiv  Detail & Related papers  (2024-03-21T12:06:30Z)
• Finding the optimal probe state for multiparameter quantum metrology using conic programming [61.98670278625053]
  We present a conic programming framework that allows us to determine the optimal probe state for the corresponding precision bounds. We also apply our theory to analyze the canonical field sensing problem using entangled quantum probe states.
  arXiv  Detail & Related papers  (2024-01-11T12:47:29Z)
• Entanglement and Teleportation in a 1-D Network with Repeaters [2.624902795082451]
  The flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. In this article we investigate how the concurrence of the final entangled state is connected with the concurrences of the initial entangled states present in a 1-D chain. These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.
  arXiv  Detail & Related papers  (2023-06-02T09:53:56Z)
• Measurement-based Admission Control in Sliced Networks: A Best Arm Identification Approach [68.8204255655161]
  In sliced networks, the shared tenancy of slices requires adaptive admission control of data flows. We devise a joint measurement and decision strategy that returns a correct decision with a certain level of confidence.
  arXiv  Detail & Related papers  (2022-04-14T12:12:34Z)
• Threshold size for the emergence of a classical-like behaviour [68.8204255655161]
  We design a procedure to estimate the minimum size beyond which a system is amenable to a classical-like description. The specific case of a magnetic system is considered, with details of a gedanken experiment presented and thoroughly commented.
  arXiv  Detail & Related papers  (2022-03-25T11:31:14Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Entanglement distance for arbitrary $M$-qudit hybrid systems [0.0]
  We propose a measure of entanglement which can be computed for pure and mixed states of a $M$-qudit hybrid system. We quantify the robustness of entanglement of a state through the eigenvalues analysis of the metric tensor associated with it.
  arXiv  Detail & Related papers  (2020-03-11T15:16:36Z)
• Generalized Sliced Distances for Probability Distributions [47.543990188697734]
  We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs) GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation. We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
  arXiv  Detail & Related papers  (2020-02-28T04:18:00Z)

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.