State Transfer on Graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36 pages, minor revisions

Scientific paper

If $X$ is a graph with adjacency matrix $A$, then we define $H(t)$ to be the operator $\exp(itA)$. We say that we have perfect state transfer in $X$ from the vertex $u$ to the vertex $v$ at time $\tau$ if the $uv$-entry of $|H(\tau)_{u,v}|=1$. This concept has potential applications in quantum computing. We offer a survey of some of the work on perfect state transfer and related questions. The emphasis is almost entirely on the mathematics.

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

State Transfer on 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 State Transfer on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and State Transfer on Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-86153

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