Entanglement Sharing Schemes

• Entanglement Sharing Schemes are quantum protocols that encode a fixed entangled state into multipartite systems, allowing only authorized pairs to recover entanglement through local operations.
• They utilize precise access structures—employing known-partner and unknown-partner models—to ensure correctness and security through monotonicity and graph-theoretic conditions.
• Practical implementations leverage stabilizer codes and quantum Reed–Solomon codes, achieving optimal share sizes crucial for quantum networks, cryptography, and distributed quantum information.

Entanglement sharing schemes (ESS) are quantum protocols that systematically distribute entangled states among multiple parties such that only designated pairs of subsystems—often subsets of parties—can recover entanglement via local operations, while other pairs are explicitly forbidden from doing so. ESS generalize quantum secret sharing by encoding a fixed entangled state into a multipartite quantum system, defining an access structure for entanglement recovery that can be fine-grained at the level of pairs or subsets. Theoretical developments in ESS have clarified the possibilities and limitations of entanglement distribution in quantum networks, particularly in regimes where the identity of the partner(s) allowed to recover entanglement may or may not be known in advance (Khanian et al., 25 Sep 2025, Choi et al., 2012).

1. Formal Definition and Variants

An entanglement sharing scheme is specified by a set of parties, each holding quantum shares. A designated entangled state (typically a maximally entangled pair of dimension $d$) is “shared” such that:

• Correctness: For every authorized pair of (possibly composite) subsystems $(T_i, T_j)$, there exist local CPTP maps that transform the joint subsystem state into the target entanglement.
• Security: For every unauthorized pair, no local product map can produce the target entangled state to high fidelity; equivalently, the reduced subsystem is guaranteed to be separable or only weakly correlated with respect to the target.

There are two principal models:

• Known-partner ESS: The local recovery map can depend on the identity of the partner subset.
• Unknown-partner ESS: The recovery must succeed regardless of which subsystem is chosen as the partner.

This distinction fundamentally impacts which access structures can be realized (Khanian et al., 25 Sep 2025).

2. Necessary and Sufficient Conditions for Access Structures

An ESS induces a pair access structure: a specification of all authorized and forbidden pairs of subsets. In the known-partner case, the structure must be monotone: if a pair is authorized, enlarging either subset preserves authorization. This follows from the fact that tracing out additional systems cannot increase the possibility of local entanglement recovery.

For stabilizer-state implementations (Clifford group encodings), a complete characterization is available. For every minimal authorized pair $A = \{T_1, T_2\}$, one constructs rank conditions on matrices $M(A)$ and $\widetilde M(A)$ encoding the effect of local operations and unauthorized overlaps. A monotone access structure is realizable if and only if, for all minimal authorized $A$,

$\rank M(A) < \rank \widetilde M(A).$

This enables explicit construction of efficient threshold ESS—e.g., via quantum Reed–Solomon codes—that ensure any pair of subsets above threshold can distil entanglement, with optimal share size (Khanian et al., 25 Sep 2025).

In the unknown-partner model, further constraints arise:

• The authorized-pair graph $G_\mathcal{A}$ (with vertices subsets, edges for authorized pairs) must have no odd cycles: $G_\mathcal{A}$ must be bipartite.
• For every even-length path in $G_\mathcal{A}$, the connecting endpoints must overlap (enforcing monogamy of entanglement).
• Transitivity and weak monotonicity properties are also required for realizability.

If these graph-theoretic and monotonicity conditions are satisfied, one can construct unknown-partner ESS using standard QSS on the two bipartite classes, allowing each shore to access one half of the entangled pair (Khanian et al., 25 Sep 2025).

3. Constructions: Threshold and General Schemes

Stabilizer and Code-based ESS

Stabilizer codes facilitate explicit ESS constructions. In a threshold scheme (e.g., type $((p, q, p + 2q - 1))$), a superposition of Reed–Solomon codewords is employed so that any pair of disjoint subsets of the prescribed sizes can extract entanglement by local operations. The access structure is determined both by the code parameters and the stabilizer group, and the share size is proven optimal with respect to entropic bounds (e.g., monogamy and squashed entanglement limit the recoverable entanglement per share) (Khanian et al., 25 Sep 2025, Choi et al., 2012).

Non-stabilizer and General Schemes

Some access structures are not achievable with stabilizer encodings. Weak realizations using non-Clifford unitaries or random unitary ensembles can approximate ideal ESS for arbitrary monotone structures, but strong security (constant fidelity gap) is only known in certain cases. The general case—sufficiency of monotonicity and the outlined graph/path conditions for strong security—remains open (Khanian et al., 25 Sep 2025).

Toy Example: 4-Party, 2-out-of-2 Scheme

For $n=4$, a known-partner ESS can be constructed where every subset of size 2 is authorized, but singletons paired with anyone are forbidden. The construction uses four-dimensional qudits with a global state

$$\ket{\Psi}_{ABCD} = \frac1{4}\sum_{k,s\in\mathbb F_4} \ket{k}_A\,\ket{k+s}_B\,\ket{k+2s}_C\,\ket{k+3s}_D,$$

where addition is in $\mathbb F_4$. Any size–2 subset recovers the secret in cooperation with its designated partner, but in the unknown-partner model such a structure is impossible due to forbidden odd cycles (Khanian et al., 25 Sep 2025).

4. Applications in Quantum Networks and Cryptography

Entanglement Distribution and Quantum Networks

ESS directly model tasks in quantum networking, such as distributing entanglement in compliance with policy or temporal constraints. For example, in summoning problems—where entanglement must be produced between pairs of spatially separated locations at unpredictable times—the feasibility is equivalent to the existence of an unknown-partner ESS with the required pair access structure. The presence of odd cycles in the network's access graph precludes a solution, settling open summoning problems (Khanian et al., 25 Sep 2025).

Quantum Secret Sharing (QSS) and Quantum Error Correction

ESS generalize quantum secret sharing: a QSS encodes an unknown quantum state such that only authorized sets can recover the secret, while ESS encode known entanglement and specify which pairs can distill EPR pairs. Formal connections between perfect pure-state QSS and absolutely maximally entangled states underlie both threshold ESS and ramp QSS protocols (Choi et al., 2012, Helwig et al., 2012).

Cryptographic Thresholds and Optimality

Threshold ESS constructed from stabilizer codes or quantum Reed–Solomon codes satisfy optimality conditions: each share must have dimension at least $\sqrt{d}$ for a dimension $d$ maximally entangled target, matching lower bounds derived from relative entropy and no-cloning (Choi et al., 2012). This optimal scaling is crucial for practical multipartite cryptographic primitives.

5. Structural Constraints and Monogamy

ESS frameworks provide a concrete setting to study and quantify monogamy of entanglement: the limitations on how quantum correlations can be simultaneously shared. The combinatorial and algebraic constraints on ESS access structures derive from basic monogamy principles, and explicit constructions reveal which entanglement sharing topologies are compatible with quantum mechanics (Khanian et al., 25 Sep 2025, Ou et al., 2010).

6. Open Questions and Outlook

Several questions remain open:

• Whether monotonicity and bipartiteness (plus path conditions) are sufficient for strong security in general, especially outside the stabilizer formalism.
• The characterization of share-size and resource-optimal ESS beyond threshold and symmetric constructions.
• The extension of ESS theory to multipartite entanglement resources (e.g., GHZ and W states) and to secret key sharing.
• The interplay between ESS and dynamic or time-dependent network constraints, including implementation in relativistic settings and with adversarial or cryptographically nontrivial scenarios.

ESS provide a foundational framework for quantum cryptography, network coding, and distributed quantum information, unifying entanglement, access structures, and quantum error correction under a mathematically precise and operationally meaningful schema (Khanian et al., 25 Sep 2025, Choi et al., 2012, Helwig et al., 2012).