pith. sign in

arxiv: 1104.0596 · v1 · pith:FLHINFBSnew · submitted 2011-04-04 · 🪐 quant-ph · math-ph· math.MP

Symmetry and Quantum Transport on Networks

classification 🪐 quant-ph math-phmath.MP
keywords quantumtransportnetworksclassicalefficiencyprobabilitysymmetryaverage
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.