Entanglement percolation in random quantum networks

Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network by utilizing strategies based solely on local operations and classical communication between the nodes. As it happens in classical percolation theory, the topology of the network is crucial, but also the entanglement shared between the nodes of the network. In a network of identically partially entangled states, the network topology determines the minimum entanglement needed for percolation. In this work, we generalize the protocol to scenarios where the initial entanglement shared between each two nodes of the network is not the same but has some randomness. In such cases, we find that for classical entanglement percolation, only the average initial entanglement is relevant. In contrast, the quantum entanglement percolation protocol generally performs worse under these more realistic conditions.

💡 Research Summary

The paper investigates entanglement percolation— the process of establishing a maximally entangled (singlet) link between any two nodes— in quantum networks where the initial entanglement of each edge is not identical but drawn from a probability distribution. Classical Entanglement Percolation (CEP) and Quantum Entanglement Percolation (QEP) are the two main protocols considered.

In the standard setting, all edges share the same partially‑entangled pure state, characterized by a singlet conversion probability (SCP) p. The percolation threshold p_c depends only on the network topology (e.g., p_c = ½ for a square lattice). The authors relax the homogeneity assumption and define a Random Quantum Network (RQN) in which each edge k has its own SCP p_k, sampled from a distribution χ(p) (uniform, truncated Gaussian, bimodal, or the distribution induced by Haar‑random two‑qubit states).

For CEP, the protocol simply applies the optimal stochastic LOCC (SLOCC) purification on every edge. An edge becomes a perfect singlet with probability p_k, otherwise it is removed. This maps directly onto classical bond percolation with bond occupation probability equal to the random p_k. By extensive Monte‑Carlo simulations on 100×100 square lattices, Erdős‑Rényi graphs, and Watts‑Strogatz small‑world networks, the authors find that the percolation order parameter P_∞ depends exclusively on the mean ⟨p⟩ of the distribution and not on its width or shape. Consequently, the condition for percolation in an RQN is ⟨p⟩ > p_c, exactly as in the homogeneous case.

QEP, by contrast, first reshapes the network topology using “q‑swap” operations. A q‑swap removes a central node of a star subgraph and directly connects its peripheral nodes, thereby converting the original lattice into a new lattice with a lower classical percolation threshold (e.g., a honeycomb lattice transformed into a triangular lattice). In the homogeneous scenario this yields a clear advantage: the required SCP is reduced from p_c^CEP to p_c^QEP. However, when the SCPs are heterogeneous, the SCP of a newly created edge after a q‑swap is min{p_i, p_j}, i.e., the weaker of the two original links. This “minimum‑SCP bottleneck” degrades the effective bond occupation probabilities after the topology change. The authors simulate QEP on the same random networks and observe that, for identical average SCP, QEP consistently yields a lower percolation strength than CEP. The performance gap widens as the variance of the SCP distribution increases, confirming that QEP is highly sensitive to edge‑wise randomness.

The study also examines different topologies (square, honeycomb, triangular, random graphs) and various SCP distributions (including the analytically known Haar‑random distribution, which has ⟨p⟩ = ¼). In all cases, CEP’s threshold is governed solely by ⟨p⟩, while QEP fails to improve upon CEP unless the SCPs are nearly uniform.

Key insights:

1. In realistic quantum networks where link quality fluctuates, the average singlet conversion probability is the sole figure of merit for classical entanglement percolation.
2. Quantum topology‑reshaping protocols such as q‑swap provide benefits only under the unrealistic assumption of homogeneous edge entanglement. With heterogeneous edges, they introduce a minimum‑SCP bottleneck that can nullify any advantage.
3. Designing robust quantum internet architectures should therefore prioritize either (a) homogenizing link entanglement (e.g., via pre‑distillation or entanglement pumping) or (b) employing CEP‑type strategies that are insensitive to edge‑wise variations.

Overall, the paper extends percolation theory to more realistic quantum networks, clarifies the limits of quantum‑enhanced percolation, and offers practical guidance for future quantum‑network engineering.