In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks—more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.
In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks—more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.
In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks---more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.
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 have experienced rapid advancements in both theoretical and experimental domains over the last decade, making it increasingly important to understand their large-scale features from the viewpoint of statistical physics. This review paper discusses a fundamental question: how can entanglement be effectively and indirectly (e.g., through intermediate nodes) distributed between distant nodes in an imperfect quantum network, where the connections are only partially entangled and subject to quantum noise? We survey recent studies addressing this issue by drawing exact or approximate mappings to percolation theory, a branch of statistical physics centered on network connectivity. Notably, we show that the classical percolation frameworks do not uniquely define the network's indirect connectivity. This realization leads to the emergence of an alternative theory called "concurrence percolation", which uncovers a previously unrecognized quantum advantage that emerges at large scales, suggesting that quantum networks are more resilient than initially assumed within classical percolation contexts, offering refreshing insights into future quantum network design.
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.
The effects of small-world network topology on entanglement percolation are investigated. From both classical and quantum entanglement percolation, it is found that the reduction in the percolation threshold is strongly related to the decrease of the average distance. The percolation threshold and average distance follow a power law functional relation. Moreover, a phase transition occurs from a slow reduction in the sparse-connection regime to a rapid reduction in the dense-connection regime. These findings may be helpful for a better understanding the long-distance entanglement preparation in future small-world quantum networks.