scholarly journals Percolation Distribution in Small-World Quantum Networks

2022 ◽  
Vol 12 (2) ◽  
pp. 701
Author(s):  
Jianxiong Liang ◽  
Xiaoguang Chen ◽  
Tianyi Wang
Keyword(s):  
Percolation Threshold ◽  
Network Structure ◽  
Percolation Theory ◽  
Small World ◽  
Entanglement Swapping ◽  
Quantum Networks ◽  
Communication Links ◽  
Network Topologies ◽  
Entanglement Distribution ◽  
Percolation Thresholds

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.

scholarly journals EntangleNet: Theoretical Reestablishment of Entanglement in Quantum Networks †

2018 ◽  
Vol 8 (10) ◽  
pp. 1935
Author(s):  
Mihai-Zicu Mina ◽  
Pantelimon Popescu
Keyword(s):  
Reliable Method ◽  
Entanglement Swapping ◽  
Quantum States ◽  
Entangled State ◽  
Quantum Network ◽  
Quantum Networks ◽  
Maximally Entangled State ◽  
Highly Sensitive ◽  
The Subject ◽  
Entanglement Distribution

In the practical context of quantum networks, the most reliable method of transmitting quantum information is via teleportation because quantum states are highly sensitive. However, teleportation consumes a shared maximally entangled state. Two parties Alice and Bob located at separate nodes that wish to reestablish their shared entanglement will not send entangled qubits directly to achieve this goal, but rather employ a more efficient mechanism that ensures minimal time resources. In this paper, we present a quantum routing scheme that exploits entanglement swapping to reestablish consumed entanglement. It improves and generalizes previous work on the subject and reduces the entanglement distribution time by a factor of 4 k in an arbitrary scale quantum network, where N = 4 k - 1 is a required number of quantum nodes located between source and destination. In addition, k is the greatest positive integer considered by Alice or Bob, such that afterwards they choose N quantum switches.

IDENTIFYING NEURAL NETWORK TOPOLOGIES THAT FOSTER DYNAMICAL COMPLEXITY

2013 ◽  
Vol 16 (02n03) ◽  
pp. 1350032 ◽  
Author(s):  
LARRY S. YAEGER
Keyword(s):  
Neural Network ◽  
Network Structure ◽  
Complex Dynamics ◽  
Small World ◽  
Clustering Coefficient ◽  
Characteristic Path Length ◽  
Physical Constraints ◽  
Network Function ◽  
Network Topologies ◽  
The Relationship

We use an ecosystem simulator capable of evolving arbitrary neural network topologies to explore the relationship between an information theoretic measure of the complexity of neural dynamics and several graph theoretical metrics calculated for the underlying network topologies. Evolutionary trends confirm and extend previous results demonstrating an evolutionary selection for complexity and small-world network properties during periods of behavioral adaptation. The resultant mapping of the space of network topologies occupied by the most complex networks yields new insights into the relationship between network structure and function. The highest complexity networks are found within limited numerical ranges of clustering coefficient, characteristic path length, small-world index, and global efficiency. The widths of these ranges vary from quite narrow to modest, and provide a guide to the most productive regions of the space of neural topologies in which to search for complexity. Our demonstration that evolution selects for complex dynamics and small-world networks helps explain biological evidence for these trends and provides evidence for selection of these characteristics based purely on network function—with no physical constraints on network structure—thus suggesting that functional and structural evolutionary pressures cooperate to produce brains optimized for adaptation to a complex, variable world.

scholarly journals Evaporation-induced self-assembling of few-layer graphene into a fractal-like conductive macro-network with a reduction of percolation threshold

2015 ◽  
Vol 17 (12) ◽  
pp. 7634-7638 ◽  
Author(s):  
I. Janowska
Keyword(s):  
Percolation Threshold ◽  
Layer Graphene ◽  
Self Assembling ◽  
Percolation Thresholds ◽  
Few Layer Graphene

The evaporation-induced self-assembling of a few-layer graphene results in macroscopic branched fractal-like conductive patterns with reduced percolation thresholds.

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

scholarly journals Low electrical percolation thresholds and nonlinear effects in graphene-reinforced nanocomposites: A numerical analysis

2018 ◽  
Vol 52 (20) ◽  
pp. 2767-2775 ◽  
Author(s):  
Xiaoxin Lu ◽  
Julien Yvonnet ◽  
Fabrice Detrez ◽  
Jinbo Bai
Keyword(s):  
Numerical Model ◽  
Aspect Ratio ◽  
Percolation Threshold ◽  
Barrier Height ◽  
Nonlinear Effects ◽  
Tunneling Effect ◽  
Graphene Sheets ◽  
Microstructural Parameters ◽  
Electric Behavior ◽  
Percolation Thresholds

A numerical model of graphene-reinforced nanocomposites taking into account the electric tunneling effect is employed to analyze the influence of microstructural parameters on the effective electric conductivity and the percolation thresholds of the composite. The generation procedure for the random microstructures of graphene-reinforced nanocomposites is described. Effects of the barrier height, of graphene aspect ratio and alignment of graphene sheets have been quantitatively evaluated. The results show that both higher graphene aspect ratio and lower barrier height can lead to smaller percolation threshold, and the alignment of graphene sheets results in anisotropic electrical behavior without affecting the percolation threshold. The numerical model also shows the importance of the tunneling effect to reproduce the nonlinear electric behavior and the low percolation thresholds reported in the literature. Finally, results are compared with available experimental data.

scholarly journals Evolution and Determinants of an Air Transport Network: A Case Study of the Chinese Main Air Transport Network

2019 ◽  
Vol 11 (14) ◽  
pp. 3933 ◽  
Author(s):  
Min Su ◽  
Weixin Luan ◽  
Zeyang Li ◽  
Shulin Wan ◽  
Zhenchao Zhang
Keyword(s):  
Network Structure ◽  
High Speed ◽  
Information Source ◽  
Small World ◽  
Transport Network ◽  
Air Transport ◽  
Promoting Effect ◽  
High Speed Rail ◽  
Path Lengths ◽  
The Impact

The Chinese main air transport network (CMATN) is the framework for air passenger transport in the country. This study uses complex networks and an econometric model to analyze CMATN’s evolution and determinants. In terms of overall network structure, the network has always shown small-world properties, with smaller average path lengths (2.06–2.15) and larger clustering coefficients (0.68–0.77), while its cumulative degree distribution follows an exponential function. City passenger volumes conform to the degree power law function, which means that the more destinations a city connects to, the higher its passenger traffic will be. In major hub cities, such as Beijing, Shanghai, and Guangzhou, control power decreases, while Chengdu, Kunming, Chongqing, Xi’an, Urumqi, and other cities play an increasingly important role in CMATN. In terms of main route passenger volumes and formation, increases in GDP and tourism have had a promoting effect, while high-speed rail (HSR) poses a threat to overlapping routes. CMATN is primarily located in the central and eastern regions, focusing on China’s economy, tourism, and efficient HSR development. Although the competition from HSR affects the overall network structure of CMATN based on its influence on specific routes, we believe that the impact is limited due to the different transport attributes of the two networks. The research results of this study can become an information source for decision makers and provide a reference for air transport to seek sustainable development.

Survivability of public transit network based on network structure entropy

2015 ◽  
Vol 26 (09) ◽  
pp. 1550104 ◽  
Author(s):  
Bai-Bai Fu ◽  
Lin Zhang ◽  
Shu-Bin Li ◽  
Yun-Xuan Li
Keyword(s):  
Network Model ◽  
Network Structure ◽  
Public Transit ◽  
Small World ◽  
Clustering Coefficient ◽  
Statistical Characteristics ◽  
Network Efficiency ◽  
Transit Network ◽  
Scale Free ◽  
The Public

In this work, we have collected 195 bus routes and 1433 bus stations of Jinan city as sample date to build up the public transit geospatial network model by applying space L method, until May 2014. Then, by analyzing the topological properties of public transit geospatial network model, which include degree and degree distribution, average shortest path length, clustering coefficient and betweenness, we get the conclusion that public transit network is a typical complex network with scale-free and small-world characteristics. Furthermore, in order to analyze the survivability of public transit network, we define new network structure entropy based on betweenness importance, and prove its correctness by giving that the new network structure entropy has the same statistical characteristics with network efficiency. Finally, the "inflexion zone" is discovered, which can be taken as the momentous indicator to determine the public transit network failure.

scholarly journals Proposal for space-borne quantum memories for global quantum networking

2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Mustafa Gündoğan ◽  
Jasminder S. Sidhu ◽  
Victoria Henderson ◽  
Luca Mazzarella ◽  
Janik Wolters ◽  
...  
Keyword(s):  
Quantum Communication ◽  
Global Scale ◽  
Space Systems ◽  
Quantum Communications ◽  
Communication Links ◽  
Probabilistic Detection ◽  
Entanglement Distribution ◽  
Near Term ◽  
Quantum Internet ◽  
Memory Characteristics

AbstractGlobal-scale quantum communication links will form the backbone of the quantum internet. However, exponential loss in optical fibres precludes any realistic application beyond few hundred kilometres. Quantum repeaters and space-based systems offer solutions to overcome this limitation. Here, we analyse the use of quantum memory (QM)-equipped satellites for quantum communication focussing on global range repeaters and memory-assisted (MA-) QKD, where QMs help increase the key rate by synchronising otherwise probabilistic detection events. We demonstrate that satellites equipped with QMs provide three orders of magnitude faster entanglement distribution rates than existing protocols based on fibre-based repeaters or space systems without QMs. We analyse how entanglement distribution performance depends on memory characteristics, determine benchmarks to assess the performance of different tasks and propose various architectures for light-matter interfaces. Our work provides a roadmap to realise unconditionally secure quantum communications over global distances with near-term technologies.

Sign in / Sign up

Export Citation Format

Share Document