1 problem
Let be an oriented graph, meaning that its adjacency matrix is Hermitian with nonzero entries in ; an oriented graph has universal perfect state transfer if perfect state t…
Let be an oriented graph, meaning that its adjacency matrix is Hermitian with nonzero entries in ; an oriented graph has universal perfect state transfer if perfect state t…