Quantum Algorithms for Search and Optimization

Offered By: Centrum Fizyki Teoretycznej PAN via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

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.

Syllabus

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

Taught by

Centrum Fizyki Teoretycznej PAN

Related Courses

Delivery Problem
University of California, San Diego via Coursera Dynamic Programming
YouTube What Is the Best Way to Lace Your Shoes? Dream Proof
Mathologer via YouTube The Traveling Salesman Problem - When Good Enough Beats Perfect
Reducible via YouTube Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Association for Computing Machinery (ACM) via YouTube