Targeting the quantum communication network based on entangled states, a network model is proposed. According to the model, the quantum channel establishing rate of basic links is then analyzed. For different quantum channel establishment methods, the quantum channel establishing rates of long relay links are also analyzed. Then the quantum channel establishing rates corresponding to the point-by-point method and segmentation method are calculated. Finally, the quantum channel establishing rate between two arbitrary points in a large-scale quantum entanglement communication network is analyzed based on the percolation model. The quantum channel establishing rate in a quantum communication network of n nodes is Ω (1/n).
Targeting the quantum communication network based on entangled states, a network model is proposed. According to the model, the quantum channel establishing rate of basic links is then analyzed. For different quantum channel establishment methods, the quantum channel establishing rates of long relay links are also analyzed. Then the quantum channel establishing rates corresponding to the point-by-point method and segmentation method are calculated. Finally, the quantum channel establishing rate between two arbitrary points in a large-scale quantum entanglement communication network is analyzed based on the percolation model. The quantum channel establishing rate in a quantum communication network of n nodes is Ω (1/n).
Quantum entanglement swapping can be used to establish reliable quantum remote transmission channel so as to realize transmission of quantum states. However, the highly stable quantum network is required in the quantum channels when using quantum entanglement swapping, otherwise it will waste a lot of entanglement resources. In order to save entanglement resources, we have to put forward a kind of quantum communication network transmission protocol based on packet switching, according to the theory of quantum teleportation. Firstly, the principle of packet switching in computer network is introduced. Next we describe the implementation process of quantum network transmission protocols which are based on entanglement swapping and packet switching. We then analyze the reliability, security and utilization rate of entanglement of the protocol we have proposed. And after that the quantitative relationship about the number of entanglement quantum states, the number of routers and link error rates are calculated. Finally, we compare these two transmission protocols. Simulation results show that the number of entanglement for these two protocols is equal without consideration of the link errors. When taking them into account, the packet switching transmission protocol can save numbers of entanglement resources obviously. In addition, with the increase of number of routers and the rise in link error rates, the quantum communication network transmission protocol based on packet switching will need less entanglement resources than that based on entanglement swapping. Therefore, when the quantum transmission network is not stable, the packet switching transmission protocol has a better transmission performance, and it can be applied to the future construction of quantum network.
Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002 nodes and complex networks of up to 104 nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.
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.
Based on the classical time division multi-channel communication theory, we present the scheme of quantum channel-time division multiplex (QC-TDM). Moreover, the model of quantum time division multiplexer (QTDM) are proposed. The quantum bit error rate (QBER) is analyzed and the QBER simulation test is performed. The scheme shows that the QTDM can carry out multi-user communication through quantum channel, the QBER can also reach the reliability requirement of communication. The scheme of QC-TDM may play an important role in the establishment of quantum communication in large scale in the future.
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 swapping can connect segmented quantum channels to form long-distance quantum channels, which is a key mechanism for realizing large-scale quantum networks and remote quantum communication. In this paper, we show the basic principles of entanglement swapping and propose a new calculation method to derive entanglement swapping results, which is demonstrated through the entanglement swapping between two bipartite entangled states. In addition, we propose an infinitely scalable star-shaped quantum network, which is composed of quantum computers connected through quantum channels. These computers interact with an observable universe: obtaining observational information from it and automatically providing feedback after processing the information.