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:quant-ph/0306049

Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement

Sudhir Kumar Singh, Somesh Kumar, Sudebkumar Prasant Pal

Published Jun 6, 2003• 11 citations
arXivHTMLPDF

Abstract

We develop protocols for preparing a GHZ state and, in general,a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between agents using classical communication and local operations. We investigate and characterize the minimal combinatorics of the sharing of EPR pairs required amongst agents in a network for the creation of multi-partite entanglement. We also characterize the minimal combinatorics of agents in the creation of pure maximal multi-partite entanglement amongst the set $N$ of $n$ agents in a network using apriori multi-partite entanglement states amongst subsets of $N$. We propose protocols for establishing multi-partite entanglement in the above cases.

DOI
10.48550/arxiv.quant-ph/0306049

Related papers

Combinatorial Approaches in Quantum Information Theory

Sudhir Kumar Singh

We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite entanglement in a real communication network. This combinatorics helps in the study of various problems in multi-party case by just reducing to the two-party case. Particularly, we use this combinatorics to (1) study various possible and impossible transformations of multi-partite states under LOCC, thus presenting an entirely new approach, not based on entropic criterion, to study such state transformations. (2) present a protocol and proof of its unconditional security for quantum key distribution amongst several trusted parties. (3) propose an idea to combine the features of quantum key distribution and quantum secret sharing. We investigate all the above issues in great detail and finally conclude briefly with some open research directions based on our research.

arXiv:quant-ph/0405089•May 16, 2004•8 citations

Multi-partite Quantum Entanglement versus Randomization: Fair and Unbiased Leader Election in Networks

Sudebkumar Prasant Pal, Sudhir Kumar Singh, Kumar, Somesh

In this paper we show that sufficient multi-partite quantum entanglement helps in fair and unbiased election of a leader in a distributed network of processors with only linear classical communication complexity. We show that a total of $O(\log n)$ distinct multi-partite maximally entanglement sets (ebits) are capable of supporting such a protocol in the presence of nodes that may lie and thus be biased. Here, $n$ is the number of nodes in the network. We also demonstrate the difficulty of performing unbiased and fair election of a leader with linear classical communication complexity in the absence of quantum entanglement even if all nodes have perfect random bit generators. We show that the presence of a sufficient number $O(n/\log n)$ of biased agents leads to a non-zero limiting probability of biased election of the leader, whereas, the presence of a smaller number $O(\log n)$ of biased agents matters little. We define two new related complexity classes motivated by the our leader election problem and discuss a few open questions.

arXiv:quant-ph/0306195•Jun 29, 2003•17 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

A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks

S. Siddardha Chelluri, Sumeet Khatri, Peter van Loock

Abstract Multipartite entangled states, such as Greenberger–Horne–Zeilinger (GHZ) states, are important resources in multiparty quantum networking tasks. We consider protocols for generating such states from networks of Bell pairs and local operations and classical communication. We present a computationally-efficient protocol for generating GHZ states that is also efficient with respect to the number of consumed Bell pairs, (local) gates, and Bell-pair sources. Our protocol: (1) requires O ( N ) gates in a network with N nodes, independent of the network topology; (2) has time complexity O ( N 2 ), avoiding the Steiner tree and any other computationally-hard problem; (3) maintains a near-optimal number of consumed Bell pairs. Numerically, our protocol outperforms those based on (approximate) Steiner trees with respect to the number of gates and Bell-pair sources. We prove that the minimal Bell-pair source cost is given by solving the graph-theoretic dominating set problem, and we demonstrate numerically that our protocol is nearly optimal for this quantity. Finally, we analytically characterize the impact of noisy Bell pairs and gates on the fidelity of the distributed GHZ states.

arXiv:2412.04252•npj Quantum Information•Jul 7, 2026•6 citations

Maximally Entangled Set of Multipartite Quantum States

Julio I. de Vicente, Cornelia Spee, Barbara Kraus

Entanglement is a resource in quantum information theory when state manipulation is restricted to local operations assisted by classical communication (LOCC). It is therefore of paramount importance to decide which LOCC transformations are possible and, particularly, which states are maximally useful under this restriction. While the bipartite maximally entangled state is well known (it is the only state that cannot be obtained from any other and, at the same time, it can be transformed to any other by LOCC), no such state exists in the multipartite case. In order to cope with this fact, we introduce here the notion of the maximally entangled set (MES) of n-partite states. This is the set of states which are maximally useful under LOCC manipulation; i.e., any state outside of this set can be obtained via LOCC from one of the states within the set and no state in the set can be obtained from any other state via LOCC. We determine the MES for states of three and four qubits and provide a simple characterization for them. In both cases, infinitely many states are required. However, while the MES is of measure zero for 3-qubit states, almost all 4-qubit states are in the MES. This is because, in contrast to the 3-qubit case, deterministic LOCC transformations are almost never possible among fully entangled four-partite states. We determine the measure-zero subset of the MES of LOCC convertible states. This is the only relevant class of states for entanglement manipulation.

arXiv:1305.7398•Physical Review Letters•Sep 10, 2013•149 citations

An efficient scheme for multi-party quantum state sharing via non-maximally entangled states

Min Jiang, Xu Huang, Liulei Zhou +2 more

We present a new scheme for investigating the usefulness of non-maximally entangled states for multi-party quantum state sharing in a simple and elegant manner. In our scheme, the sender, Alice shares n various probabilistic channels composed of non-maximally entangled states with n agents in a network. Our protocol involves only Bell-basis measurements, single qubit measurements, and a two-qubit unitary transformation operated by free optional agents. Our scheme is a more convenient realization because no other multipartite joint measurements are needed. Furthermore, in our scheme various probabilistic channels lessen the requirement for quantum channels, which makes it more practical for physical implementation.

Chinese Science Bulletin•Mar 20, 2012•14 citations
We develop protocols for preparing a GHZ state and, in general,a pure multi-partite maximally entangled state in a distributed network with apriori quantum entanglement between agents using classical communication and local operations. We investigate and characterize the minimal combinatorics of the sharing of EPR pairs required amongst agents in a network for the creation of multi-partite entanglement. We also characterize the minimal combinatorics of agents in the creation of pure maximal multi-partite entanglement amongst the set NNN of nnn agents in a network using apriori multi-partite entanglement states amongst subsets of NNN. We propose protocols for establishing multi-partite entanglement in the above cases.
We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite entanglement in a real communication network. This combinatorics helps in the study of various problems in multi-party case by just reducing to the two-party case. Particularly, we use this combinatorics to (1) study various possible and impossible transformations of multi-partite states under LOCC, thus presenting an entirely new approach, not based on entropic criterion, to study such state transformations. (2) present a protocol and proof of its unconditional security for quantum key distribution amongst several trusted parties. (3) propose an idea to combine the features of quantum key distribution and quantum secret sharing. We investigate all the above issues in great detail and finally conclude briefly with some open research directions based on our research.
In this paper we show that sufficient multi-partite quantum entanglement helps in fair and unbiased election of a leader in a distributed network of processors with only linear classical communication complexity. We show that a total of O(log⁡n)O(\log n)O(logn) distinct multi-partite maximally entanglement sets (ebits) are capable of supporting such a protocol in the presence of nodes that may lie and thus be biased. Here, nnn is the number of nodes in the network. We also demonstrate the difficulty of performing unbiased and fair election of a leader with linear classical communication complexity in the absence of quantum entanglement even if all nodes have perfect random bit generators. We show that the presence of a sufficient number O(n/log⁡n)O(n/\log n)O(n/logn) of biased agents leads to a non-zero limiting probability of biased election of the leader, whereas, the presence of a smaller number O(log⁡n)O(\log n)O(logn) of biased agents matters little. We define two new related complexity classes motivated by the our leader election problem and discuss a few open questions.
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.
Abstract Multipartite entangled states, such as Greenberger–Horne–Zeilinger (GHZ) states, are important resources in multiparty quantum networking tasks. We consider protocols for generating such states from networks of Bell pairs and local operations and classical communication. We present a computationally-efficient protocol for generating GHZ states that is also efficient with respect to the number of consumed Bell pairs, (local) gates, and Bell-pair sources. Our protocol: (1) requires O ( N ) gates in a network with N nodes, independent of the network topology; (2) has time complexity O ( N 2 ), avoiding the Steiner tree and any other computationally-hard problem; (3) maintains a near-optimal number of consumed Bell pairs. Numerically, our protocol outperforms those based on (approximate) Steiner trees with respect to the number of gates and Bell-pair sources. We prove that the minimal Bell-pair source cost is given by solving the graph-theoretic dominating set problem, and we demonstrate numerically that our protocol is nearly optimal for this quantity. Finally, we analytically characterize the impact of noisy Bell pairs and gates on the fidelity of the distributed GHZ states.
Entanglement is a resource in quantum information theory when state manipulation is restricted to local operations assisted by classical communication (LOCC). It is therefore of paramount importance to decide which LOCC transformations are possible and, particularly, which states are maximally useful under this restriction. While the bipartite maximally entangled state is well known (it is the only state that cannot be obtained from any other and, at the same time, it can be transformed to any other by LOCC), no such state exists in the multipartite case. In order to cope with this fact, we introduce here the notion of the maximally entangled set (MES) of n-partite states. This is the set of states which are maximally useful under LOCC manipulation; i.e., any state outside of this set can be obtained via LOCC from one of the states within the set and no state in the set can be obtained from any other state via LOCC. We determine the MES for states of three and four qubits and provide a simple characterization for them. In both cases, infinitely many states are required. However, while the MES is of measure zero for 3-qubit states, almost all 4-qubit states are in the MES. This is because, in contrast to the 3-qubit case, deterministic LOCC transformations are almost never possible among fully entangled four-partite states. We determine the measure-zero subset of the MES of LOCC convertible states. This is the only relevant class of states for entanglement manipulation.
We present a new scheme for investigating the usefulness of non-maximally entangled states for multi-party quantum state sharing in a simple and elegant manner. In our scheme, the sender, Alice shares n various probabilistic channels composed of non-maximally entangled states with n agents in a network. Our protocol involves only Bell-basis measurements, single qubit measurements, and a two-qubit unitary transformation operated by free optional agents. Our scheme is a more convenient realization because no other multipartite joint measurements are needed. Furthermore, in our scheme various probabilistic channels lessen the requirement for quantum channels, which makes it more practical for physical implementation.