Quantum Algorithms for Search and Optimization

Explore quantum algorithms for search and optimization in this comprehensive lecture by Andris Ambainis from the University of Latvia. Delve into the evolution of quantum algorithms beyond Grover's search, examining three recent advancements: a quadratic speedup for random walk-based classical algorithms, quantum improvements for solving NP-complete problems like the Traveling Salesman Problem, and quantum speedups for geometric problems. Learn about the potential of quantum computing to revolutionize problem-solving across various domains, presented by a renowned expert in quantum algorithm design and analysis.

A. Ambainis (Faculty of Computing, Univ. of Latvia): Quantum algorithms for search and optimization