Perfect state transfer over distance-regular spin networks

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages, 2 figures

Scientific paper

10.1103/PhysRevA.77.022315

By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.\cite{8,9''}. Then, by using spectral analysis techniques and algebraic combinatoric structure of distance-regular graphs such as stratification introduced in \cite{obata, js} and Bose-Mesner algebra, we give a method for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site of a network will evolve freely to the opposite site without any dynamical controls, i.e., we show that how to derive the parameters of the system so that perfect state transfer (PST) can be achieved. As examples, the cycle networks with even number of vertices and $d$-dimensional hypercube networks are considered in details and the method is applied for some important distance-regular networks in appendix.

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

Perfect state transfer over distance-regular spin 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 Perfect state transfer over distance-regular spin networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect state transfer over distance-regular spin networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-657417

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