Professor's Currently Seeking PhD Students
Theory and Development Robust Quantum Algorithms for Problems on Graphs
We are inviting applications for a NSF funded PhD position at the intersection of Quantum Information Science and Theoretical Computer Science. This role centers around theoretical examination of quantum walks, aiming to utilize these as tools for generating complex distributions and their potential applications in property testing and subgraph finding and beyond. Quantum walks are integral to advanced quantum graph algorithms, yet extending their use presents several challenges. Our project proposes to address these, with a focus on generating non-trivial distributions on vertices or edges of graphs and their higher-dimensional extensions.
Candidates should have an interest in quantum mechanics, algorithmic principles, and related fields like discrete mathematics, linear algebra, probability theory, computational complexity, and algorithm design.
Contact Info:
Follow Computer Science