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:2611.05069

Operational Thresholds for Long-Range Entanglement in Quantum Networks

Arn Caesar, Xinqi Hu, Kim Christensen

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.05069

Related papers

Concurrence Percolation in Quantum Networks

Xiangyi Meng, Jianxi Gao, Shlomo Havlin

Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical percolation assumes a necessary condition for successful entanglement transmission between any two infinitely distant nodes: they must be connected by at least a path of perfectly entangled states (singlets). Here, we relax this condition by explicitly showing that one can focus not on optimally converting singlets but on establishing concurrence-a key measure of bipartite entanglement. We thereby introduce a new statistical theory, concurrence percolation theory (ConPT), remotely analogous to classical percolation but fundamentally different, built by generalizing bond percolation in terms of "sponge-crossing" paths instead of clusters. Inspired by resistance network analysis, we determine the path connectivity by series and parallel rules and approximate higher-order rules via star-mesh transforms. Interestingly, we find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results and is readily achievable on any series-parallel networks such as the Bethe lattice. ConPT promotes our understanding of how well quantum communication can be further systematically improved versus classical statistical predictions under the limitation of QN locality-a "quantum advantage" that is more general and efficient than expected. ConPT also shows a percolationlike universal critical behavior derived by finite-size analysis on the Bethe lattice and regular two-dimensional lattices, offering new perspectives for a theory of criticality in entanglement statistics.

arXiv:2103.13985•Physical Review Letters•Apr 27, 2021•46 citations

Percolation thresholds and connectivity in quantum networks

Andrea De Girolamo, Giuseppe Magnifico, Cosmo Lupo

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.

arXiv:2502.17191•Quantum Science and Technology•Jun 17, 2025•5 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

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 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

Concurrence Percolation Behavior in Diluted Quantum Networks

Gaogao Dong, Yili Shen, Xinqi Hu +1 more

The evolution of connectivity in quantum networks under decoherence and link degradation is a central problem in quantum information, calling for further understanding of the nature of its transition during structural network degradation. By diluting each link with probability 1−f, we focus on connectivity strength transitions in diluted hierarchical scale-free quantum networks, the (u,v) flowers, which are analytically tractable through two adjustable path-length parameters, u≤v. Incorporating quantum concurrence percolation and comparing it with classical percolation, we analyze the transitions of critical thresholds for various values of f and v from analytical, numerical, and simulation perspectives. The results demonstrate that quantum percolation exhibits consistently lower critical thresholds than classical percolation, even under various topologies and dilution levels. Our work implies that quantum multipath entanglement provides an intrinsic compensatory mechanism against structural degradation and that the hierarchical scale-free topology contributes to the failure resistance and robustness of quantum networks with multipath coupling.

Entropy•May 26, 2026•0 citations
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.
Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical percolation assumes a necessary condition for successful entanglement transmission between any two infinitely distant nodes: they must be connected by at least a path of perfectly entangled states (singlets). Here, we relax this condition by explicitly showing that one can focus not on optimally converting singlets but on establishing concurrence-a key measure of bipartite entanglement. We thereby introduce a new statistical theory, concurrence percolation theory (ConPT), remotely analogous to classical percolation but fundamentally different, built by generalizing bond percolation in terms of "sponge-crossing" paths instead of clusters. Inspired by resistance network analysis, we determine the path connectivity by series and parallel rules and approximate higher-order rules via star-mesh transforms. Interestingly, we find that the entanglement transmission threshold predicted by ConPT is lower than the known classical-percolation-based results and is readily achievable on any series-parallel networks such as the Bethe lattice. ConPT promotes our understanding of how well quantum communication can be further systematically improved versus classical statistical predictions under the limitation of QN locality-a "quantum advantage" that is more general and efficient than expected. ConPT also shows a percolationlike universal critical behavior derived by finite-size analysis on the Bethe lattice and regular two-dimensional lattices, offering new perspectives for a theory of criticality in entanglement statistics.
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.
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 . . . . . . . . . . . . .
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.
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.
The evolution of connectivity in quantum networks under decoherence and link degradation is a central problem in quantum information, calling for further understanding of the nature of its transition during structural network degradation. By diluting each link with probability 1−f, we focus on connectivity strength transitions in diluted hierarchical scale-free quantum networks, the (u,v) flowers, which are analytically tractable through two adjustable path-length parameters, u≤v. Incorporating quantum concurrence percolation and comparing it with classical percolation, we analyze the transitions of critical thresholds for various values of f and v from analytical, numerical, and simulation perspectives. The results demonstrate that quantum percolation exhibits consistently lower critical thresholds than classical percolation, even under various topologies and dilution levels. Our work implies that quantum multipath entanglement provides an intrinsic compensatory mechanism against structural degradation and that the hierarchical scale-free topology contributes to the failure resistance and robustness of quantum networks with multipath coupling.