Quantum Approximate Optimization Algorithm

In course

Et do in culpa est pariatur laboris laboris. Veniam anim ea ea ad sunt commodo pariatur exercitation consectetur sit reprehenderit est est et. Aliquip cupidatat cupidatat mollit reprehenderit sunt amet occaecat proident dolor consequat Lorem nostrud enim id. Magna adipisicing reprehenderit nisi aliquip Lorem veniam minim dolore dolor culpa ullamco qui cillum. Ullamco officia in in nisi sit laboris voluptate esse sint aliqua ad sint ut.

Description

This lecture introduces the Quantum Approximate Optimization Algorithm (QAOA) as a method to solve combinatorial optimization problems using quantum computers. The instructor explains the principles behind QAOA and its application to Boolean Satisfiability (SAT) problems. The lecture covers the formulation of optimization problems in a quantum setting, focusing on the Ising Spin-glass problem and K-SAT problems. Various examples and algorithms are discussed to illustrate the effectiveness of QAOA in solving complex optimization problems.

Instructor

Excepteur exercitation excepteur dolore laborum labore. Aliquip officia culpa do est ipsum duis laboris proident fugiat deserunt anim incididunt. Ex aute nulla aute fugiat.

Official source

https://mediaspace.epfl.ch/media/0_k3fo6b2j

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computational complexity theory, Quantum computing

Related lectures (32)