Perfect state transfer is poly-time
  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. 
Gabriel Coutinho and Chris Godsil
math.CO quant-ph