Universality at Breakdown of Quantum Transport on Complex Networks

Abstract

We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by the time-averaged return probability. For tree-like networks, we show analytically that a transition from efficient to inefficient transport occurs depending on the (average) functionality of the nodes of the network. In the infinite system size limit, this transition can be characterized by an exponent which is universal for all tree-like networks. Our findings are corroborated by analytic results for specific deterministic networks, dendrimers and Viscek fractals, and by Monte Carlo simulations of iteratively built scale-free trees.

4 pages, 2 figures

References in corpus (2)

• Critical phenomena in complex networks
• Coherent exciton transport in dendrimers and continuous-time quantum walks

Cited by in corpus (11)

• Quantum synchronization and quantum state sharing in irregular complex network
• Universality classes of spin transport in one-dimensional isotropic magnets: the onset of logarithmic anomalies
• Complex Quantum Networks: From Universal Breakdown to Optimal Transport
• Cycle Flux Ranking of Network Analysis in Quantum Thermal Device
• Extended Vicsek fractals: Laplacian spectra and their applications
• Quantum-classical distance as a tool to design optimal chiral quantum walk
• The Evolution of Hyperedge Cardinalities and Bose-Einstein Condensation in Hypernetworks
• Multifractality in random networks with power-law decaying bond strengths
• Dynamics of "comb-of-comb" networks
• Spatial search for a general multi-vertex state on graph by continuous-time quantum walks
• Continuous-Time Quantum Walk on Penrose Lattice