In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, they can still communicate via routing protocols. However, in contrast to classical communication, each quantum communication event removes all participating links along the routed path, disrupting the quantum communication network. Here, we propose a simple model, where randomly selected pairs of nodes communicate through the shortest paths. Each time such a path is used, all participating links are eliminated, leading to a correlated percolation process that we call "path percolation." We study path percolation both numerically and analytically and present the phase diagram of the steady states as a function of the rate at which new links are being added to the network. As a key result, the steady state is found to be independent of the initial network topologies when new links are added randomly between disconnected components. We close by discussing extensions of path percolation and link replenishment, along with their potential applications.
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, they can still communicate via routing protocols. However, in contrast to classical communication, each quantum communication event removes all participating links along the routed path, disrupting the quantum communication network. Here, we propose a simple model, where randomly selected pairs of nodes communicate through the shortest paths. Each time such a path is used, all participating links are eliminated, leading to a correlated percolation process that we call "path percolation." We study path percolation both numerically and analytically and present the phase diagram of the steady states as a function of the rate at which new links are being added to the network. As a key result, the steady state is found to be independent of the initial network topologies when new links are added randomly between disconnected components. We close by discussing extensions of path percolation and link replenishment, along with their potential applications.
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 (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.
A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.
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.
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 paper proposes a novel distributed routing protocol for quantum networks leveraging the topological properties of quantum entanglement. The core idea is to construct a network topology based on entangled states between nodes, enabling communication through the instantaneous correlation inherent in entanglement. This approach aims to overcome the limitations of traditional routing protocols, particularly in terms of speed and security. We define a routing algorithm that dynamically adjusts the entanglement states to facilitate data transmission, effectively creating a network with inherently high bandwidth and resilience to eavesdropping. The algorithm is based on a graph theory framework where nodes represent quantum devices and edges represent entangled pairs. The routing process involves identifying the shortest path through the entanglement network, leveraging the correlated states for rapid information transfer. We explore the mathematical underpinnings of this protocol, outlining key formulas for calculating entanglement metrics, path distances, and routing decisions. The theoretical framework presented here provides a foundation for future research and development in quantum network architecture and routing strategies.