Perfect state transfer is poly-time
arXiv:1606.02264
Abstract
We show that deciding whether a graph admits perfect state transfer can be done in polynomial time with respect to the size of the graph on a classical computer.
arXiv comment11 pages. Version 2 fixes an inconsequential mistake