Abigail Raz

Learn More
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative 2-clique with any positive (n, 3)-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves(More)
1 Acknowledgements I would first like to thank my advisor Professor Karen Lange. She has quite literally taught me everything I know about computability. She has helped me develop as not only a math researcher, but also a writer and presenter. I would also like to thank NSF grant DMS-1100604 for funding summer research that was instrumental in helping me(More)
A signed graph is a graph whose edges are given ±1 weights. In such a graph, the sign of a cycle is the product of the signs of its edges. A signed graph is called balanced if its adjacency matrix is similar to the adjacency matrix of an unsigned graph via conjugation by a diagonal ±1 matrix. For a signed graph Σ on n vertices, its exterior kth power, where(More)
  • 1