Perfect state transfer is poly-time

TL;DR

This paper proves that determining whether a graph allows perfect quantum state transfer can be efficiently decided using polynomial-time algorithms on classical computers.

Contribution

It introduces a polynomial-time algorithm for deciding perfect state transfer in graphs, resolving a computational complexity question.

Findings

Deciding perfect state transfer is in P for graphs.

The problem can be efficiently solved on classical computers.

This advances understanding of quantum information transfer in graph structures.

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.