Quantum Divide and Conquer - A Framework for Quantum Query Complexity

Join a comprehensive seminar from the Qiskit Seminar Series featuring Professor Andrew Childs as he explores the quantum divide-and-conquer framework and its applications in achieving quantum speedup. Discover how this framework, analogous to classical divide-and-conquer algorithms, recursively breaks down problems into smaller subproblems while establishing quantum query complexity relationships. Learn about the framework's practical applications in solving string problems, including regular language recognition, String Rotation and String Suffix decision versions, and parameterized versions of Longest Increasing Subsequence and Longest Common Subsequence. Gain insights from Childs, a distinguished professor and co-director of QuICS, as he shares his expertise in quantum information processing, quantum algorithms, and quantum walk computational power, drawing from his extensive research background at institutions including MIT, Caltech, and the University of Waterloo.