David Rosenbaum is a Ph.D. student in computer science and engineering at the University of Washington. He received his bachelor’s degree in computer science and mathematics from Portland State University. His research interests span both classical and quantum computation, focusing on algorithms for isomorphism problems, quantum algorithms and quantum circuit architectures. His papers have been published in a variety of venues, including SODA, QIP, TQC, QIC, and PRA. He has developed new algorithms to test group isomorphism, both classical and quantum, including the first improvement in nearly four decades in the running time of algorithms to test isomorphism for general groups, as well as faster algorithms for the case of solvable groups. He has also developed an efficient way to simulate the abstract theoretical models of quantum circuits, which allow arbitrary pairwise interactions of quantum elements, via two-dimensional quantum computers using only local interactions.