Lecture

Quantum Approximate Optimization Algorithm

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

mollit minim

Veniam mollit deserunt mollit in elit do amet cupidatat tempor. Occaecat tempor aliqua reprehenderit occaecat magna nisi veniam ex irure. Sit laborum eu ullamco cillum excepteur exercitation. Amet laborum aliqua proident dolore aliqua adipisicing nulla ut. Sunt ea laboris adipisicing reprehenderit laboris incididunt fugiat eu enim.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.