On quantum perfect state transfer in weighted join graphs

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 4 figures

Scientific paper

We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al. [clms09] where the regular graph is a complete graph or a complete graph with a missing link. In contrast, the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. This implies that adding weights in a complete bipartite graph do not help in achieving perfect state transfer. (2) A Hamming graph has perfect state transfer between each pair of its vertices. This is obtained using a closure property on weighted Cartesian products of perfect state transfer graphs. Moreover, on the hypercube, we show that perfect state transfer occurs between uniform superpositions on pairs of arbitrary subcubes. This generalizes results of Bernasconi et al. [bgs08] and Moore and Russell [mr02]. Our techniques rely heavily on the spectral properties of graphs built using the join and Cartesian product operators.

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

On quantum perfect state transfer in weighted join graphs 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 On quantum perfect state transfer in weighted join graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On quantum perfect state transfer in weighted join graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-12640

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