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.
