Papers
Topics
Authors
Recent
Search
2000 character limit reached

Perfect state transfer is poly-time

Published 7 Jun 2016 in math.CO and quant-ph | (1606.02264v2)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up