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

International Conference on Quantum Communications, Networking, and Computing (QCNC)

Entanglement Percolation in Noisy Quantum Networks

Soo Min Oh, Hyundong Shin, Stefano Maranò, Andrea Conti, Moe Z. Win

Published Jul 1, 2024• 0 citations
Publisher

Abstract

Quantum networks (QNs) are expected to play a key role in next-generation networks. A QN is comprised of quantum nodes and links (or bonds) representing entangled qubit pairs (EQPs) shared between two nodes. The probability of establishing a pure maximally entangled pair, known as Einstein-Podolsky-Rosen (EPR) pair, between two neighboring nodes represents the linking probability (or bond occupation probability). If such probability exceeds the so-called percolation threshold, the QN exhibits a percolation phenomenon characterized by the emergence of a giant cluster spanning the entire network. In the presence of such a giant cluster, any two arbitrary nodes in the system are connected by a chain of links with a non-zero probability, thus establishing EPR pairs at remote nodes. This work introduces a procedure for obtaining QNs from initially isolated quantum nodes. In the proposed procedure, two copies of EPR pairs are prepared at a source node and two qubits, one from each pair, are sent to a neighboring node through a noisy quantum channel. Then, a pair of mixed quantum states is established between the source node and the neighboring node. By performing local operations and classical communication, an EPR pair can be established between these two nodes with non-zero probability. Repeating this procedure for every pair of source node and neighboring node, a QN exhibiting a percolation phenomenon can be obtained.

DOI
10.1109/qcnc62729.2024.00031

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

Limited-path-length entanglement percolation in quantum complex networks

Martí Cuquet, John Calsamiglia

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

arXiv:1011.5630•Physical Review A•Mar 25, 2011•27 citations

Multipartite entanglement percolation

Sébastien Perseguers, Daniel Cavalcanti, G. J. Lapeyre +2 more

We present a percolation strategy based on multipartite measurements to propagate entanglement in quantum networks. We consider networks spanned on regular lattices whose bonds correspond to pure but nonmaximally entangled pairs of qubits, with any quantum operation allowed at the nodes. Despite significant effort in the past, improvements over standard (classical) percolation have been found for only a few lattices, often with restrictions on the initial amount of entanglement in the bonds. In contrast, multipartite entanglement percolation outperform the classical percolation protocols, as well as all previously known quantum ones, over the entire range of initial entanglement and for every lattice that we considered. Finally, we briefly show that our ideas also find application in noisy networks.

arXiv:0910.2438•Physical Review A•Mar 26, 2010•46 citations

Entanglement distribution in pure-state quantum networks

Sébastien Perseguers, J. I. Cirac, Antonio Acín +2 more

We investigate entanglement distribution in pure-state quantum networks. We consider the case when nonmaximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how to generate the maximal entanglement between them by performing local measurements, assisted by classical communication, on the other nodes. We find optimal measurement protocols for both small and large one-dimensional networks. Quite surprisingly, we prove that Bell measurements are not always the optimal ones to perform in such networks. We generalize then the results to simple small two-dimensional (2D) networks, finding again counterintuitive optimal measurement strategies. Finally, we consider large networks with hierarchical lattice geometries and 2D networks. We prove that perfect entanglement can be established on large distances with probability one in a finite number of steps, provided the initial entanglement shared by neighboring nodes is large enough. We discuss also various protocols of entanglement distribution in 2D networks employing classical and quantum percolation strategies.

arXiv:0708.1025•Physical Review A•Feb 7, 2008•103 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
Quantum networks (QNs) are expected to play a key role in next-generation networks. A QN is comprised of quantum nodes and links (or bonds) representing entangled qubit pairs (EQPs) shared between two nodes. The probability of establishing a pure maximally entangled pair, known as Einstein-Podolsky-Rosen (EPR) pair, between two neighboring nodes represents the linking probability (or bond occupation probability). If such probability exceeds the so-called percolation threshold, the QN exhibits a percolation phenomenon characterized by the emergence of a giant cluster spanning the entire network. In the presence of such a giant cluster, any two arbitrary nodes in the system are connected by a chain of links with a non-zero probability, thus establishing EPR pairs at remote nodes. This work introduces a procedure for obtaining QNs from initially isolated quantum nodes. In the proposed procedure, two copies of EPR pairs are prepared at a source node and two qubits, one from each pair, are sent to a neighboring node through a noisy quantum channel. Then, a pair of mixed quantum states is established between the source node and the neighboring node. By performing local operations and classical communication, an EPR pair can be established between these two nodes with non-zero probability. Repeating this procedure for every pair of source node and neighboring node, a QN exhibiting a percolation phenomenon can be obtained.
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.
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 study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.
We present a percolation strategy based on multipartite measurements to propagate entanglement in quantum networks. We consider networks spanned on regular lattices whose bonds correspond to pure but nonmaximally entangled pairs of qubits, with any quantum operation allowed at the nodes. Despite significant effort in the past, improvements over standard (classical) percolation have been found for only a few lattices, often with restrictions on the initial amount of entanglement in the bonds. In contrast, multipartite entanglement percolation outperform the classical percolation protocols, as well as all previously known quantum ones, over the entire range of initial entanglement and for every lattice that we considered. Finally, we briefly show that our ideas also find application in noisy networks.
We investigate entanglement distribution in pure-state quantum networks. We consider the case when nonmaximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how to generate the maximal entanglement between them by performing local measurements, assisted by classical communication, on the other nodes. We find optimal measurement protocols for both small and large one-dimensional networks. Quite surprisingly, we prove that Bell measurements are not always the optimal ones to perform in such networks. We generalize then the results to simple small two-dimensional (2D) networks, finding again counterintuitive optimal measurement strategies. Finally, we consider large networks with hierarchical lattice geometries and 2D networks. We prove that perfect entanglement can be established on large distances with probability one in a finite number of steps, provided the initial entanglement shared by neighboring nodes is large enough. We discuss also various protocols of entanglement distribution in 2D networks employing classical and quantum percolation strategies.
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.