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:2502.17191 · Quantum Science and Technology

Percolation thresholds and connectivity in quantum networks

Andrea De Girolamo, Giuseppe Magnifico, Cosmo Lupo

Published Jun 17, 2025• 5 citations
arXivHTMLPDF

Abstract

Abstract We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a physics-informed heuristic algorithm designed to find a sequence of entanglement swapping and distillation operations to connect any pair of distant nodes. The algorithm combines locally optimal percolation strategies between nodes at a maximum distance of one swapping operation. If this fails to produce a maximally entangled state, it looks for alternative paths surrounding intermediate states within the process. We analytically find and numerically verify thresholds in quantum percolation, which depend on the initial network configuration and entanglement, and are associated with specific percolation strategies. We classify these strategies based on the connectivity, a quantity that relates the entanglement in the final state and the level of integrity of the network at the end of the process. We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies and vastly vary according to the network topology.

DOI
10.1088/2058-9565/ade55e

Related papers

ENTANGLEMENT PERCOLATION IN QUANTUM NETWORKS: HOW TO ESTABLISH LARGE DISTANCE QUANTUM CORRELATIONS?

Antonio Acín, Maciej Lewenstein, J. I. Cirac

Quantum communication networks consist of N distant nodes sharing a quantum state. By means of local operation in each node assisted by classical communication, the nodes try to transform the initial state into perfect quantum correlations, that later will be used to perform a quantum information task, such as quantum teleportation or quantum cryptography. Given a network, defined by a geometry of nodes and connections, it is crucial to understand whether it is possible to establish long-distance quantum correlations, in the sense that the correlations between two end points of the network do not decrease exponentially with the number of intermediate connections. In this contribution, we present our recent findings on the distribution of entanglement through quantum networks. In the case of one-dimensional chains of connected quantum systems, the results are hardly surprising: a non-exponential decay is possible only when the entanglement in the connections between nodes is larger than a maximally entangled state of two qubits. The picture becomes much richer and interesting for networks of dimension larger than one: long-distance correlations can be established even when the connecting nodes are not maximally entangled. Actually, the problem of establishing maximally entangled states between nodes is related to classical percolation in statistical mechanics. We show, then, that statistical concepts, such as percolation and phase transitions, can be used to optimize the entanglement distribution through quantum networks. Remarkably, the quantum features allow going beyond the known results for classical percolation, giving rise to a new type of critical phenomenon that we call entanglement percolation.

Recent Progress in Many-Body Theories•Jun 1, 2008•0 citations

Entanglement percolation in random quantum networks

Alessandro Romancino, Jordi Romero-Pallejà, G. Massimo Palma +1 more

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 any 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 (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that Random CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks.

quant-pharXiv:2602.10189•Quantum Science and Technology•Feb 12, 2026•2 citations

Operational Thresholds for Long-Range Entanglement in Quantum Networks

Arn Caesar, Xinqi Hu, Kim Christensen

Quantum networks distribute entanglement between distant nodes by combining many short entangled links using local quantum operations. These operations only succeed probabilistically, yet existing percolation-based theories of entanglement transmission treat them as perfect. We approach the problem through statistical physics, using a stochastic generalization of concurrence percolation to determine how reliable local operations must be for long-range entanglement to remain possible. On hierarchical $(U,V)$-flower networks, which permit full analytical control across network scales, we derive an exact renormalization recursion for the probability that an end-to-end entangled connection survives. For the $(2,2)$-flower this yields a closed-form operational phase boundary, $η_p = 2 - \frac{32}{27}η_s$, where $η_s$ and $η_p$ are the success probabilities of the series (entanglement swapping) and parallel (purification) operations, respectively. At this boundary the survival probability jumps discontinuously from $0$ to $S_\infty = 3/(4η_s)$. Numerically propagating the full distribution of end-to-end concurrence yields a second threshold in the initial link quality, which varies continuously with operational reliability. Above both thresholds the large-network state is binary: the connection either fails outright or approaches a perfect Bell pair. Our results thus reveal a two-threshold structure for long-range entanglement, in which operational reliability and initial link quality can compensate one another. Operational success rates therefore emerge alongside initial link quality as a primary design constraint for scalable quantum networks.

arXiv:2611.05069•Nov 3, 2026•0 citations

Concurrence percolation threshold of large-scale quantum networks

Omar Malik, Xiangyi Meng, Shlomo Havlin +3 more

Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002 nodes and complex networks of up to 104 nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.

Communications Physics•Jul 29, 2022•27 citations

Entanglement Distribution in Quantum Networks

Sébastien Perseguers

This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .

•Jan 1, 2010•6 citations

Entanglement percolation with bipartite mixed states

S. Broadfoot, U. Dorner, Dieter Jaksch

We develop a concept of entanglement percolation for long-distance singlet generation in quantum networks with neighboring nodes connected by partially entangled bipartite mixed states. We give a necessary and sufficient condition on the class of mixed network states for the generation of singlets. States beyond this class are insufficient for entanglement percolation. We find that neighboring nodes are required to be connected by multiple partially entangled states and devise a rich variety of distillation protocols for the conversion of these states into singlets. These distillation protocols are suitable for a variety of network geometries and have a sufficiently high success probability even for significantly impure states. In addition to this, we discuss possible further improvements achievable by using quantum strategies including generalized forms of entanglement swapping.

arXiv:0906.1622•Europhysics Letters (EPL)•Dec 1, 2009•30 citations
Abstract We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a physics-informed heuristic algorithm designed to find a sequence of entanglement swapping and distillation operations to connect any pair of distant nodes. The algorithm combines locally optimal percolation strategies between nodes at a maximum distance of one swapping operation. If this fails to produce a maximally entangled state, it looks for alternative paths surrounding intermediate states within the process. We analytically find and numerically verify thresholds in quantum percolation, which depend on the initial network configuration and entanglement, and are associated with specific percolation strategies. We classify these strategies based on the connectivity, a quantity that relates the entanglement in the final state and the level of integrity of the network at the end of the process. We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies and vastly vary according to the network topology.
Quantum communication networks consist of N distant nodes sharing a quantum state. By means of local operation in each node assisted by classical communication, the nodes try to transform the initial state into perfect quantum correlations, that later will be used to perform a quantum information task, such as quantum teleportation or quantum cryptography. Given a network, defined by a geometry of nodes and connections, it is crucial to understand whether it is possible to establish long-distance quantum correlations, in the sense that the correlations between two end points of the network do not decrease exponentially with the number of intermediate connections. In this contribution, we present our recent findings on the distribution of entanglement through quantum networks. In the case of one-dimensional chains of connected quantum systems, the results are hardly surprising: a non-exponential decay is possible only when the entanglement in the connections between nodes is larger than a maximally entangled state of two qubits. The picture becomes much richer and interesting for networks of dimension larger than one: long-distance correlations can be established even when the connecting nodes are not maximally entangled. Actually, the problem of establishing maximally entangled states between nodes is related to classical percolation in statistical mechanics. We show, then, that statistical concepts, such as percolation and phase transitions, can be used to optimize the entanglement distribution through quantum networks. Remarkably, the quantum features allow going beyond the known results for classical percolation, giving rise to a new type of critical phenomenon that we call entanglement percolation.
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 any 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 (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that Random CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks.
Quantum networks distribute entanglement between distant nodes by combining many short entangled links using local quantum operations. These operations only succeed probabilistically, yet existing percolation-based theories of entanglement transmission treat them as perfect. We approach the problem through statistical physics, using a stochastic generalization of concurrence percolation to determine how reliable local operations must be for long-range entanglement to remain possible. On hierarchical (U,V)(U,V)(U,V)-flower networks, which permit full analytical control across network scales, we derive an exact renormalization recursion for the probability that an end-to-end entangled connection survives. For the (2,2)(2,2)(2,2)-flower this yields a closed-form operational phase boundary, ηp=2−3227ηsη_p = 2 - \frac{32}{27}η_sηp​=2−2732​ηs​, where ηsη_sηs​ and ηpη_pηp​ are the success probabilities of the series (entanglement swapping) and parallel (purification) operations, respectively. At this boundary the survival probability jumps discontinuously from 000 to S∞=3/(4ηs)S_\infty = 3/(4η_s)S∞​=3/(4ηs​). Numerically propagating the full distribution of end-to-end concurrence yields a second threshold in the initial link quality, which varies continuously with operational reliability. Above both thresholds the large-network state is binary: the connection either fails outright or approaches a perfect Bell pair. Our results thus reveal a two-threshold structure for long-range entanglement, in which operational reliability and initial link quality can compensate one another. Operational success rates therefore emerge alongside initial link quality as a primary design constraint for scalable quantum networks.
Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002 nodes and complex networks of up to 104 nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.
This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .
We develop a concept of entanglement percolation for long-distance singlet generation in quantum networks with neighboring nodes connected by partially entangled bipartite mixed states. We give a necessary and sufficient condition on the class of mixed network states for the generation of singlets. States beyond this class are insufficient for entanglement percolation. We find that neighboring nodes are required to be connected by multiple partially entangled states and devise a rich variety of distillation protocols for the conversion of these states into singlets. These distillation protocols are suitable for a variety of network geometries and have a sufficiently high success probability even for significantly impure states. In addition to this, we discuss possible further improvements achievable by using quantum strategies including generalized forms of entanglement swapping.