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

Dynamical entanglement percolation with spatially correlated disorder

Lorenzo Cirigliano, Valentina Brosco, Claudio Castellano, Simone Felicetti, Laura Pilozzi, Bernard van Heck

quant-phcond-mat.dis-nnSubmitted Jan 9, 2026• Announced Jan 12, 2026• 4 citations
arXivHTMLPDF

Abstract

The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a network of qubits where each edge corresponds to an independent two-qubit interaction. By applying tools from percolation theory, we study how entanglement dynamically spreads across the network. We show that the interplay between unitary evolution and spatially correlated disorder leads to a non-standard percolation phenomenology, significantly richer than uniform bond percolation and featuring hysteresis. A two-colour correlated bond percolation model, whose phase diagram is determined via numerical simulations and a mean-field theory, fully elucidates the physics behind this phenomenon.

Comments
16 pages, 10 figures

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

Exploring the Percolation Phenomena in Quantum Networks

Chuanxin Wang, Xinqi Hu, Gaogao Dong

Quantum entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an entanglement distribution scheme called “Classical Entanglement Percolation” (CEP) has been proposed. While this scheme provides an effective framework, “Quantum Entanglement Percolation” (QEP) indicates a lower percolation threshold through quantum preprocessing strategies, which will modify the network topology. Meanwhile, an emerging statistical theory known as “Concurrence Percolation” reveals the unique advantages of quantum networks, enabling entanglement transmission under lower conditions. It fundamentally belongs to a different universality class from classical percolation. Although these studies have made significant theoretical advancements, most are based on an idealized pure state network model. In practical applications, quantum states are often affected by thermal noise, resulting in mixed states. When these mixed states meet specific conditions, they can be transformed into pure states through quantum operations and further converted into singlets with a certain probability, thereby facilitating entanglement percolation in mixed state networks. This finding greatly broadens the application prospects of quantum networks. This review offers a comprehensive overview of the fundamental theories of quantum percolation and the latest cutting-edge research developments.

Mathematics•Nov 15, 2024•3 citations

Entanglement Percolation in Quantum Hypergraphs

Mohadeseh Azari, Anoosha Fayyaz, Kaushik P. Seshadreesan

Percolation theory is widely used to analyze the robustness of quantum networks. However, most studies focus on site-bond percolation in quantum network graphs based on bipartite entanglement and entanglement swapping, overlooking the higher-order interactions necessary to model dynamic quantum networks that include propagating multipartite entangled states. Integrating these elements into a hypergraph percolation framework represents a current gap in the scholarly literature. In hypergraphs, while hyperedge percolation generally results in larger giant components than node percolation, we hypothesize that multipartite (hyperedge) percolation can achieve greater connectivity than bipartite (edge) percolation under suitable conditions. Our results show that when the probability of multipartite entanglement remaining intact is low, distributing only bipartite entanglement provides better connectivity due to lower memory overhead. Conversely, when hyperedge generation is reliable and measurements at repeaters are probabilistic, multipartite entanglement enables networks to achieve full connectivity even at low success probabilities, unlike bipartite networks, which require near-perfect success to percolate.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Entanglement Percolation in Quantum Complex Networks

Martí Cuquet, John Calsamiglia

Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here, we study the effect of entanglement percolation as a means to establish long-distance entanglement between arbitrary nodes of quantum complex networks. We develop a theory to analytically study random graphs with arbitrary degree distribution and give exact results for some models. Our findings are in good agreement with numerical simulations and show that the proposed quantum strategies enhance the percolation threshold substantially. Simulations also show a clear enhancement in small-world and other real-world networks.

arXiv:0906.2977•Physical Review Letters•Dec 10, 2009•91 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

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
The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a network of qubits where each edge corresponds to an independent two-qubit interaction. By applying tools from percolation theory, we study how entanglement dynamically spreads across the network. We show that the interplay between unitary evolution and spatially correlated disorder leads to a non-standard percolation phenomenology, significantly richer than uniform bond percolation and featuring hysteresis. A two-colour correlated bond percolation model, whose phase diagram is determined via numerical simulations and a mean-field theory, fully elucidates the physics behind this phenomenon.
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.
Quantum entanglement as a non-local correlation between particles is critical to the transmission of quantum information in quantum networks (QNs); the key challenge lies in establishing long-distance entanglement transmission between distant targets. This issue aligns with percolation theory, and as a result, an entanglement distribution scheme called “Classical Entanglement Percolation” (CEP) has been proposed. While this scheme provides an effective framework, “Quantum Entanglement Percolation” (QEP) indicates a lower percolation threshold through quantum preprocessing strategies, which will modify the network topology. Meanwhile, an emerging statistical theory known as “Concurrence Percolation” reveals the unique advantages of quantum networks, enabling entanglement transmission under lower conditions. It fundamentally belongs to a different universality class from classical percolation. Although these studies have made significant theoretical advancements, most are based on an idealized pure state network model. In practical applications, quantum states are often affected by thermal noise, resulting in mixed states. When these mixed states meet specific conditions, they can be transformed into pure states through quantum operations and further converted into singlets with a certain probability, thereby facilitating entanglement percolation in mixed state networks. This finding greatly broadens the application prospects of quantum networks. This review offers a comprehensive overview of the fundamental theories of quantum percolation and the latest cutting-edge research developments.
Percolation theory is widely used to analyze the robustness of quantum networks. However, most studies focus on site-bond percolation in quantum network graphs based on bipartite entanglement and entanglement swapping, overlooking the higher-order interactions necessary to model dynamic quantum networks that include propagating multipartite entangled states. Integrating these elements into a hypergraph percolation framework represents a current gap in the scholarly literature. In hypergraphs, while hyperedge percolation generally results in larger giant components than node percolation, we hypothesize that multipartite (hyperedge) percolation can achieve greater connectivity than bipartite (edge) percolation under suitable conditions. Our results show that when the probability of multipartite entanglement remaining intact is low, distributing only bipartite entanglement provides better connectivity due to lower memory overhead. Conversely, when hyperedge generation is reliable and measurements at repeaters are probabilistic, multipartite entanglement enables networks to achieve full connectivity even at low success probabilities, unlike bipartite networks, which require near-perfect success to percolate.
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here, we study the effect of entanglement percolation as a means to establish long-distance entanglement between arbitrary nodes of quantum complex networks. We develop a theory to analytically study random graphs with arbitrary degree distribution and give exact results for some models. Our findings are in good agreement with numerical simulations and show that the proposed quantum strategies enhance the percolation threshold substantially. Simulations also show a clear enhancement in small-world and other real-world 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 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.
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.