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.
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.
Quantum networks are interconnected by nodes, between singlets which are formed to ensure the successful transmission of information with a probability of 1. However, in real quantum networks, nodes often share a partially entangled state instead of a singlet due to factors such as environmental noise. Therefore, it is necessary to convert the partially entangled state into a singlet for efficient communication. Percolation happens during the conversion of connected edges in the whole network. As a result, when the singlet conversion probability (SCP) is greater than the percolation threshold, a giant interconnected cluster that meets the basic requirements of communication will appear in the network. The percolation threshold of the network reveals the minimum resources required to carry out large scale quantum communication. In this paper, we investigate the effect of different q-swaps on the percolation threshold in quantum entanglement percolation of small world networks. We show that Quantum Entanglement Percolation (QEP) has a better percolation performance than Classical Entanglement Percolation (CEP). By using different q swaps in Watts Strogatz (WS) small world networks and Kleinberg networks for simulation, we also show that the percolation threshold is minimized when SCP is equal to the average degree of the network. Furthermore, we introduce quantum walk as a new scheme to have an extra reduction in the percolation threshold.
Quantum networks have good prospects for applications in the future. Compared with classical networks, small-world quantum networks have some interesting properties. The topology of the network can be changed through entanglement exchange operations, and different network topologies will result in different percolation thresholds when performing entanglement percolation. A lower percolation threshold means that quantum networks require fewer minimum resources for communication. Since a shared singlet between two nodes can still be a limitation, concurrency percolation theory (ConPT) can be used to relax the condition. In this paper, we investigate how entanglement distribution is performed in small-world quantum networks to ensure that nodes in the network can communicate with each other by establishing communication links through entanglement swapping. Any node can perform entanglement swapping on only part of the connected edges, which can reduce the influence of each node in the network during entanglement swapping. In addition, the ConPT method is used to reduce the percolation threshold even further, thus obtaining a better network structure and reducing the resources required.
Long-distance entanglement establishment is investigated on small-world complex network topologies.The quantum entanglement percolation(QEP) protocol is proposed to optimize networked quantum communications.If the additional local target-swap quantum operations are performed in the classical entanglement percolation(CEP) protocol,the QEP can be obtained.The QEP has great advantage over CEP with respect to the efficiency of long-distance entanglement establishment.The advantage may be due to the changes of the degree distributions in the QEP.
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.
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.