arXiv:2401.11862

Effects of Different Q-swaps Modes on Percolation Threshold in Small-world Quantum Networks

Jianxiong Liang, Xiaoguang Chen, Yaoyao Wang

Published Jan 22, 2024• 0 citations

Abstract

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.

DOI: 10.48550/arxiv.2401.11862

Related papers

Percolation Distribution in Small-World Quantum Networks

Jianxiong Liang, Xiaoguang Chen, Tianyi Wang

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.

Applied SciencesJan 11, 20222 citations

Quantum Entanglement Percolation Analysis in Kleinberg Small World Quantum Networks

Jianxiong Liang, Xiaoguang Chen

In the paper, the analysis of percolation of quantum entanglement in complex networks was given, including the preparation of long-range quantum entangled states in two-dimensional complex networks of small word. A scheme of quantum entanglement percolation optimization of quantum communication network is proposed. By introducing the localized “target-swap” quantum operation into the classical entanglement percolation protocol (CEP), the quantum entanglement percolation protocol is formed. It also shows that the quantum entanglement percolation protocol (QEP) is significantly better than CEP in the performance of long-range entanglement preparation in two-dimensional complex networks of small world.

International Wireless Communications and Mobile Computing Conference (IWCMC)Jun 28, 20211 citation

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.10189Quantum Science and TechnologyFeb 12, 20261 citation

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.

MathematicsNov 15, 20243 citations

Entanglement Percolation in Quantum Hypergraphs

Mohadeseh Azari, Anoosha Fayyaz, Kaushik Parasuram 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, 20250 citations

Concurrence percolation threshold of large-scale quantum networks

Omar Malik, Xiangyi Meng, Shlomo Havlin +3 more

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.

Communications PhysicsJul 29, 202227 citations