Optimising multipartite entanglement manipulation in quantum networks

The gist: A general operational framework for manipulating genuine multipartite entanglement in quantum networks by classifying networking operations into three broad primitives—inflation, deflation, and purification—is developed to systematically optimize multipartite quantum repeater protocols under network and resource constraints.

General Operational Framework

The paper introduces a general operational framework for manipulating genuine multipartite entanglement in quantum networks by organizing the relevant networking operations into three basic primitives: inflation, deflation, and purification The framework shows how these primitives can be concatenated to construct a broad class of multipartite quantum repeater protocols enabling their systematic optimization This approach casts protocol design as an optimization over a common set of primitives instead of fixed constructions for specific topologies or states The optimization variables comprise the sequence of elementary primitives and the subsets of qubits on which they act, while network architecture, target-node set, and resource budget define the constraints.

Networking Primitives

The three principal types of operations used for multipartite entanglement manipulations are described sequentially: inflation, deflation, and purification.

1. Inflation of multipartite entangled states involves connecting two adjacent multipartite states at a network node via measurements or unitary interactions between qubits from each state. This can include entanglement swapping, merging operations, and entangling unitaries. The expected output GMC of the ensemble of states obtained via inflationary operations is bounded by the minimum of the input GMCs under a suitable bipartition.

2. Deflation involves projecting or measuring qubits to disentangle them from the remaining state, reducing the multipartite state to fewer parties. The expected output GMC for deflationary operations is upper bounded by the localizable multipartite entanglement, L E (ρ).

3. Purification of multipartite entangled states takes as input multiple noisy copies of multipartite entangled states and probabilistically outputs fewer copies with higher fidelity via SLOCC operations. An iteration is successful if the residual GMC satisfies Cg(ρ) ≤ Cg(ρRν) ≤ Cg(Nm k=1 ρ (k)) Pν.

Multipartite Quantum Repeater Protocols (M-QR)

A multipartite quantum repeater protocol can be defined as a finite composition of the primitive networking operations, EI (inflation), ED (deflation), and EP (purification) acting on a collection of short-range entangled units. The overall M-QR protocol may be schematically expressed as EM-QR O N i=1 ρNi! = E(Sk) αk ◦ · · · ◦ E(S2) α2 ◦ E(S1) α1 O N i=1 ρNi!, where αl ∈ I, D, or P specifies the primitive employed at step l. Existing protocols fit naturally within this framework, such as the GHZ protocol represented by E GHZ M-QR:= E BSM D ◦ EBSM I ◦ EBSM I. The W-state protocol is represented by E W M-QR:= E BSM/Z D ◦ EParity D ◦ EParity I.

Entanglement Classes and State Transformation

The framework is demonstrated on networks of Dür–Cirac–Tarrach (DCT) states, revealing a rich set of achievable end-to-end entanglement phases, including transitions among separable, biseparable, W-type, and GHZ-type classes. The classification procedure involves evaluating the PPT conditions for all bipartitions, computing the genuine multipartite connectivity (Cg), and evaluating the three-tangle (τ3). For DCT states, Cg is linearly related to their fidelity relative to the GHZ state. Success in optimization involves maximizing a performance metric F, such as average or postselected concurrence under deterministic noise.

Protocol Optimization and Comparison

The paper illustrates that protocol performance depends on the choice of primitive operations and their ordering, not just topology. For a fixed network topology, different M-QR protocols can generate the same multipartite target state while yielding different values of the performance metric F. The comparison between two protocols, E 1M-QR and E 2M-QR, shows that E 1M-QR yields higher Cg and psucc under single-qubit depolarizing noise (SQDN). Furthermore, in the probabilistic link generation case, E 2M-QR remains preferable in the low-to-moderate p regime, while E 1M-QR becomes advantageous once memory depolarizing rate grows. The optimization problem is formulated as finding (α⋆l, S⋆l) = arg max F "E(Sk) αk ◦ · · · ◦ E(S1) α1 O N i=1 ρNi!

Conclusion and Future Directions

The primitive-based framework is effective for identifying optimal multipartite repeater protocols based on chosen figures of merit and repeater operating regimes in addition to the dependence on network topology. Future directions include extending the optimization beyond small protocol spaces via systematic search over larger topologies and richer primitive sets like quantum error correction. The primitive-based formulation may also be extended for developing an adaptive multipartite entanglement percolation strategy. Incorporating experimentally relevant costs, such as memory requirements and gate operations, into the objective function would enable the design of resource-aware multipartite repeater protocols for nearterm quantum networks.

How it works

The framework organizes networking operations into inflation, deflation, and purification primitives. Inflation connects neighboring states via measurements or unitary interactions and is bounded by the minimum of input GMCs under a suitable bipartition. Deflation involves projecting or measuring qubits to reduce the state size, with the output GMC bounded by the localizable multipartite entanglement L E (ρ). Purification probabilistically enhances fidelity, and a successful iteration is declared if Cg(ρ) ≤ Cg(ρRν) ≤ Cg(Nm k=1 ρ (k)) Pν.

State Evolution Under Swapping

For generalized GHZ states, the averaged post-swap GMC satisfies the product law ⟨C (out) g ⟩ = C(1) g C(2) g due to full permutation symmetry. In contrast, for generalized W states, the averaged post-swap GMC does not satisfy a universal product rule. This difference arises because generalized W states lack the two-dimensional support and complete bipartition symmetry of gGHZ states.

State Evolution Under Deflation

Deflation operations can reduce the number of parties while possibly concentrating the GMC, but the effect depends on the state family; for example, GHZ states satisfy L E (ρ) = Cg(ρ) using Hadamard basis measurement of any single qubit. Conversely, W states show L E (ρ) < Cg(ρ), reflecting how deflation can redistribute multipartite correlations differently depending on the state structure.

DCT State Properties

DCT states provide a natural family of elementary multipartite resource states for quantum networks, and their GMC is linearly related to their fidelity relative to the GHZ state. DCT states remain within the DCT family under swapping and merging, implying an upper bound that scales multiplicatively with the number of swapping operations.

Protocol Comparison

The comparison between E 1M-QR and E 2M-QR shows that E 1M-QR yields higher Cg and psucc under SQDN, while E 2M-QR maintains a higher success probability up to a certain noise threshold.

1. textbfProcessing of Multipartite Entanglement Manipulation Protocols for Quantum Networks: Enables Resource-Efficient GME Distribution through Primitive Composition and Optimization of Protocol Space (Eq. 9, 15). This allows AI systems to systematically design and optimize multipartite quantum repeater protocols by treating the sequence of operations as an optimization problem over a common set of primitives (inflation, deflation, purification), enabling search across protocol space for a given network architecture and resource budget to maximize metrics like the final GMC (Eq. 15).

2. textbfAdaptive Entanglement Class Identification in Network States: Enables AI systems to classify resulting states based on the outcome of M-QR protocols by evaluating genuine multipartite concurrence (GMC), three-tangle, and PPT criteria. This allows AI to distinguish between classes such as GHZ-class states, W-type states, and biseparable states in the DCT family, providing a systematic method for characterizing entanglement evolution during long-range distribution.

3. textbfGuaranteed Performance Metric Selection for Quantum Repeaters: Enables AI systems to select the optimal M-QR protocol (e.g., comparing E1 M-QR and E2 M-QR) based on chosen figures of merit and noise regimes using Monte Carlo simulations (Fig. 3, 4, 5). This allows the AI to determine which protocol yields higher average genuine multipartite concurrence or success probability under specific environmental conditions like single-qubit depolarizing noise (SQDN), ensuring resource allocation is optimized for the desired application objective.

4. textbfResource-Aware Network Topology Adaptation: Enables AI systems to develop an adaptive multipartite entanglement percolation strategy by selecting distinct series and parallel composition rules based on network topology, link characteristics, and operational constraints. This allows the AI to move beyond fixed protocols by dynamically choosing the sequence of primitives at each step rather than imposing a fixed protocol throughout the network (as suggested in Conclusion).

5. textbfEnhanced Conditional Entanglement Concentration via Postselection: Enables AI systems to utilize postselection strategies that amplify the GMC of the inflated state beyond the initial Cg of the elementary units (Fig. 9). This allows for conditional concentration of GME in favorable measurement outcomes, leading to an output concurrence that can exceed resource state concurrence while maintaining a sufficiently high success probability.

Long-range, genuine multipartite entanglement (GME) between distant parties in a quantum network is a crucial resource for distributed quantum information processing. Through controlled manipulation of short-range GME states in the network via stochastic local operations aided by classical communication (SLOCC), long-range GME can be established between selected target nodes on demand. Optimizing such multipartite entanglement distribution protocols under constraints imposed by the network architecture, target-node set, and available resource budget is a key challenge in resource-efficient manipulation of GME. We present a general operational framework for manipulating GME in quantum networks by classifying the relevant networking operations into three broad primitives-inflation, deflation, and purification-reflecting their effect on the proliferation of GME through general bounds and illustrative examples. We show how these primitives can be combined to construct a broad class of multipartite quantum repeater protocols, enabling their systematic optimization, and demonstrate the framework with a simple example. Applying our approach to networks of Dür-Cirac-Tarrach states reveals a rich landscape of achievable end-to-end GME and accessible entanglement classes. More generally, our framework provides a systematic approach to the construction and optimization of multipartite quantum repeater protocols for scalable and resource-efficient GME distribution in quantum networks.