Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1506.08396 · Physical Review A

Systematics of entanglement distribution by separable states

Vahid Karimipour, Laleh Memarzadeh, Najmeh Tabe Bordbar

Published Sep 25, 2015• 2 citations
arXivHTMLPDF

Abstract

We show that three distant parties, $A$, $B$, and $C$, having no prior entanglement can establish a shared GHZ state by mediating two particles which remain separable from each other and from all the other parties throughout the process. The success probability is $1/7$. We prove this in a general framework for systematic distribution of entangled states between two and more parties with separable states in $d$ dimensions. The proposed method may facilitate the construction of multinode quantum networks and many other processes which use multipartite entangled states.

DOI
10.1103/physreva.92.032325

Related papers

Experimental Entanglement Distribution by Separable States

Christina E. Vollmer, Daniela Schulze, T. Eberle +3 more

Distribution of entanglement between macroscopically separated parties is crucial for future quantum information networks. Surprisingly, it has been theoretically shown that two distant systems can be entangled by sending a third system that is not entangled with either of them. Here, we experimentally distribute entanglement and successfully prove that our transmitted light beam is indeed not entangled with the parties' local systems. Our work demonstrates an unexpected variant of entanglement distribution and improves the understanding necessary to engineer multipartite quantum networks.

arXiv:1303.1082•Physical Review Letters•Dec 4, 2013•65 citations

A scheme for multipartite entanglement distribution via separable carriers

Alessandro Laneve, Hannah McAleese, Mauro Paternostro

Abstract The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been demonstrated, in different contexts, that two remote systems can be entangled via local interactions with a carrier system that always remains in a separable state with respect to such distant particles. We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes to achieve various entanglement distribution patterns. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network. We provide examples showcasing the flexibility of our approach and propose a scheme of principle for the experimental demonstration of the protocol.

arXiv:2206.09701•New Journal of Physics•Nov 21, 2022•4 citations

Entanglement distribution in lossy quantum networks

Leonardo Oleynik, Junaid ur Rehman, Seid Koudia +1 more

Entanglement distribution is essential for unlocking the potential of distributed quantum information processing. We consider an N-partite network where entanglement is distributed via a central source over lossy channels, and network participants cooperate to establish entanglement between any two chosen parties under local operations and classical communication (LOCC). We develop a general mathematical framework to assess the average bipartite entanglement shared in a lossy distribution, and introduce a tractable lower bound by optimizing over a subset of single-parameter LOCC transformations. Our results show that probabilistically extracting Bell pairs from W states is more advantageous than deterministically extracting them from GHZ-like states in lossy networks, with this advantage increasing with network size. We further extend our analysis analytically, proving that W states remain more effective in large-scale networks. These findings offer valuable insights into the practical deployment of near-term networks, and corroborate a trade-off relationship between the success conversion probability of entanglement distribution protocols and their robustness to loss.

arXiv:2503.24347•Scientific Reports•Aug 14, 2025•2 citations

Entanglement sharing with separable states

Ladislav Mišta

We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two players. Bob is separable from the players but he can create entanglement with either of the players if the other player moves to his location and collaborates with him. Any two parties are separable and the creation of entanglement is thus mediated by transmission of a mode which is separable from individual modes on Alice's side and Bob's side. For the state shared by the players and Bob one cannot establish entanglement between any two modes even with the help of operation on the third mode provided that Bob is restricted to Gaussian measurements and the state thus carries a nontrivial signature of bound entanglement. The present protocol also demonstrates switching between different separability classes of tripartite systems by coherent operations on its bipartite parts and complements studies on protocols utilizing mixed partially entangled multipartite states.

arXiv:1604.08901•Physical Review A•Jun 21, 2013•13 citations

Asynchronous Routing for Multipartite Entanglement in Quantum Networks

Chenliang Tian, Zebo Yang, Raj Jain +6 more

In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some scenarios also require remote multipartite entanglement for applications such as quantum secret sharing and multi-party computation. Our previous study improved end-to-end entanglement rates using an asynchronous, tree-based routing scheme that relies solely on local knowledge of entanglement links, conserving unused entanglement and avoiding synchronous operations. This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states. It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase. This approach can also be extended to four-party and larger multipartite GHZ states, highlighting the effectiveness and adaptability of asynchronous routing for multipartite scenarios across various network topologies.

quant-pharXiv:2603.27551•IEEE Annual Computing and Communication Workshop and Conference (CCWC)•Mar 31, 2026•1 citation

Entanglement teleportation through GHZ-class states

Sibasish Ghosh A, Guruprasad Kar, Anirban Roy +2 more

We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ state and where all the four parties are at distant locations. We extend this result to a more general state than GHZ-state and show that still a class of pure entangled states can be teleported, where the entanglement of this class ranges from 0 to e (≤1), depending on the entanglement (defined in the text) of the channel state. We then generalize this situation to the case of teleportation of entangled states shared between Claire1, Claire2, ..., Claire(N - 1) and Alice to Bob1, Bob2, ..., BobN when Alice and the N Bobs share a single copy of a GHZ-class state and where again all the 2N parties are at distant locations.

New Journal of Physics•Jul 15, 2002•29 citations
We show that three distant parties, AAA, BBB, and CCC, having no prior entanglement can establish a shared GHZ state by mediating two particles which remain separable from each other and from all the other parties throughout the process. The success probability is 1/71/71/7. We prove this in a general framework for systematic distribution of entangled states between two and more parties with separable states in ddd dimensions. The proposed method may facilitate the construction of multinode quantum networks and many other processes which use multipartite entangled states.
Distribution of entanglement between macroscopically separated parties is crucial for future quantum information networks. Surprisingly, it has been theoretically shown that two distant systems can be entangled by sending a third system that is not entangled with either of them. Here, we experimentally distribute entanglement and successfully prove that our transmitted light beam is indeed not entangled with the parties' local systems. Our work demonstrates an unexpected variant of entanglement distribution and improves the understanding necessary to engineer multipartite quantum networks.
Abstract The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been demonstrated, in different contexts, that two remote systems can be entangled via local interactions with a carrier system that always remains in a separable state with respect to such distant particles. We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes to achieve various entanglement distribution patterns. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network. We provide examples showcasing the flexibility of our approach and propose a scheme of principle for the experimental demonstration of the protocol.
Entanglement distribution is essential for unlocking the potential of distributed quantum information processing. We consider an N-partite network where entanglement is distributed via a central source over lossy channels, and network participants cooperate to establish entanglement between any two chosen parties under local operations and classical communication (LOCC). We develop a general mathematical framework to assess the average bipartite entanglement shared in a lossy distribution, and introduce a tractable lower bound by optimizing over a subset of single-parameter LOCC transformations. Our results show that probabilistically extracting Bell pairs from W states is more advantageous than deterministically extracting them from GHZ-like states in lossy networks, with this advantage increasing with network size. We further extend our analysis analytically, proving that W states remain more effective in large-scale networks. These findings offer valuable insights into the practical deployment of near-term networks, and corroborate a trade-off relationship between the success conversion probability of entanglement distribution protocols and their robustness to loss.
We propose an entanglement sharing protocol based on separable states. Initially, two parties, Alice and Bob, share a two-mode separable Gaussian state. Alice then splits her mode into two separable modes and distributes them between two players. Bob is separable from the players but he can create entanglement with either of the players if the other player moves to his location and collaborates with him. Any two parties are separable and the creation of entanglement is thus mediated by transmission of a mode which is separable from individual modes on Alice's side and Bob's side. For the state shared by the players and Bob one cannot establish entanglement between any two modes even with the help of operation on the third mode provided that Bob is restricted to Gaussian measurements and the state thus carries a nontrivial signature of bound entanglement. The present protocol also demonstrates switching between different separability classes of tripartite systems by coherent operations on its bipartite parts and complements studies on protocols utilizing mixed partially entangled multipartite states.
In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some scenarios also require remote multipartite entanglement for applications such as quantum secret sharing and multi-party computation. Our previous study improved end-to-end entanglement rates using an asynchronous, tree-based routing scheme that relies solely on local knowledge of entanglement links, conserving unused entanglement and avoiding synchronous operations. This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states. It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase. This approach can also be extended to four-party and larger multipartite GHZ states, highlighting the effectiveness and adaptability of asynchronous routing for multipartite scenarios across various network topologies.
We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ state and where all the four parties are at distant locations. We extend this result to a more general state than GHZ-state and show that still a class of pure entangled states can be teleported, where the entanglement of this class ranges from 0 to e (≤1), depending on the entanglement (defined in the text) of the channel state. We then generalize this situation to the case of teleportation of entangled states shared between Claire1, Claire2, ..., Claire(N - 1) and Alice to Bob1, Bob2, ..., BobN when Alice and the N Bobs share a single copy of a GHZ-class state and where again all the 2N parties are at distant locations.