Symmetry and quantum transport on networks
From MaRDI portal
Publication:3000436
Abstract: We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.
Recommendations
- Continuous-time quantum walks on Erdős-Rényi networks
- Quantum transport on two-dimensional regular graphs
- Quantum transport on modified multilayered spiderwebs
- Quantum transport efficiency in noisy random-removal and small-world networks
- Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3367947 (Why is no real title available?)
- An example of the difference between quantum and classical random walks
- CONTINUOUS-TIME QUANTUM WALKS ON TREES IN QUANTUM PROBABILITY THEORY
- Complex networks: structure and dynamics
- Continuous-time quantum walks on star graphs
- Dynamics of continuous-time quantum walks in restricted geometries
- Exact analytical results for quantum walks on star graphs
- Faster quantum-walk algorithm for the two-dimensional spatial search
- From quantum cellular automata to quantum lattice gases
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- Investigation of continuous-time quantum walk via modules of Bose–Mesner and Terwilliger algebras
- Investigation of continuous-time quantum walk via spectral distribution associated with adjacency matrix
- Limit theorems for discrete-time quantum walks on trees
- Mixing and decoherence in continuous-time quantum walks on long-range interacting cycles
- One-dimensional discrete-time quantum walks on random environments
- Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory
- Quantum transport on two-dimensional regular graphs
- STUDY OF CONTINUOUS-TIME QUANTUM WALKS ON QUOTIENT GRAPHS VIA QUANTUM PROBABILITY THEORY
- Statistical mechanics of complex networks
- THE EFFECT OF DECOHERENCE ON MIXING TIME IN CONTINUOUS-TIME QUANTUM WALKS ON ONE-DIMENSIONAL REGULAR NETWORKS
- The random walk's guide to anomalous diffusion: A fractional dynamics approach
Cited in
(9)- Effects of oscillatory deformations on the coherent and incoherent quantum transport
- Enhanced quantum transport in multiplex networks
- Quantum transport on modified multilayered spiderwebs
- Quantum transport efficiency in noisy random-removal and small-world networks
- Network models for chiral symmetry classes of Anderson localisation
- Quantum efficiencies in finite disordered networks connected by many-body interactions
- Quantum transport on two-dimensional regular graphs
- Modeling the quantum to classical crossover in topologically disordered networks
- Continuous-time quantum walks on Erdős-Rényi networks
This page was built for publication: Symmetry and quantum transport on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000436)
