State transfer on graphs

From MaRDI portal




Abstract: 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 au if the uv-entry of |H(au)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.



Cites work


Cited in
(only showing first 100 items - show all)






This page was built for publication: State transfer on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658029)