Perfect state transfer is poly-time
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.