Perfect state transfer is poly-time
Combinatorics
2021-12-08 v2 Quantum Physics
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.
Cite
@article{arxiv.1606.02264,
title = {Perfect state transfer is poly-time},
author = {Gabriel Coutinho and Chris Godsil},
journal= {arXiv preprint arXiv:1606.02264},
year = {2021}
}
Comments
11 pages. Version 2 fixes an inconsequential mistake