Mahathi Vempati, a Ph.D student at University of Maryland, College Park gave a talk on Quantum advantage in parallel query complexity on 6 January.
Parallel query complexity is a generalization of query complexity in which one is allowed to make several non-adaptive queries to the input in each round. Here one counts the number of such rounds required to compute a function of the input as the complexity. In this talk I will introduce this setting and related background, and discuss some interesting results and problems. The material will all be based on the paper: Quantum advantage and lower bounds in parallel query complexity. The target audience is students who have taken an introductory quantum computing course.
Mahathi Vempati is a Ph.D student at University of Maryland, College Park working on quantum complexity and algorithms. She is interested in bridging the gap between real world problems and quantum algorithms research. Previously, she was in the CND program at IIITH, where she was advised by Indranil Chakrabarty. There she worked on characterizing resourceful quantum operations.
Faculty Coordinator: Dr. Indranil Chakrabarty
January 2025