Symmetry and Quantum Transport on Networks

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 20 figures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Symmetry and Quantum Transport on Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symmetry and Quantum Transport on Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetry and Quantum Transport on Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-318124

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.