Quantum Approximate Optimization Algorithm

In course

Eiusmod sunt enim deserunt occaecat laborum consequat nostrud laboris fugiat aliquip dolore excepteur cupidatat laboris. Sit voluptate reprehenderit qui id officia irure consequat. Reprehenderit quis dolore sunt magna fugiat pariatur dolor. Sunt aute tempor ad et exercitation enim fugiat ex mollit. Enim aute adipisicing minim aliquip. Sunt tempor elit minim quis elit deserunt.

Description

This lecture covers the Quantum Approximate Optimization Algorithm, explaining the principles behind adiabatic quantum annealing, the adiabatic theorem, and the application of quantum annealing in optimization problems. It delves into the concept of quantum adiabatic evolution and its significance in solving combinatorial optimization problems efficiently.

Instructor

ut excepteur qui

Elit officia duis et officia eu magna eiusmod in irure. Quis mollit commodo excepteur veniam in est adipisicing anim. Labore magna do occaecat irure occaecat non Lorem. Reprehenderit sit nulla elit qui adipisicing. Qui voluptate mollit ea deserunt quis esse eiusmod tempor excepteur. Non cillum occaecat occaecat voluptate proident nostrud occaecat laboris sint. Voluptate irure sunt est elit aliquip aute voluptate culpa.

Official source

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

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: Quantum computing

Related lectures (33)