Lethbridge Number Theory and Combinatorics Seminar: Hermie Monterde

Let G be a graph with adjacency matrix A. A continuous quantum walk on G is determined by the complex unitary matrix U(t)=exp(itA), where i2=−1 and t is a real number. Here, G represents a quantum spin network, and its vertices and edges represent the particles and their interactions in the network. The propagation of quantum states in the quantum system determined by G is then governed by the matrix U(t). In particular, |U(t)u,v|2 may be interpreted as the probability that the quantum state assigned at vertex u is transmitted to vertex v at time t. Quantum walks are of great interest in quantum computing because not only do they produce algorithms that outperform classical counterparts, but they are also promising tools in the construction of operational quantum computers. In this talk, we give an overview of continuous quantum walks, and discuss old and new results in this area with emphasis on the concepts and techniques that fall under the umbrella of discrete mathematics.