Quantum Adiabatic Optimization: Combinatorial Problems

In course

Ad enim aliqua nostrud irure sunt eu est amet ullamco eiusmod id elit. Pariatur exercitation velit Lorem do. In labore exercitation consectetur in laborum sint. Irure irure pariatur aliqua cillum. Dolore ipsum quis labore voluptate proident laboris reprehenderit aliqua occaecat minim. Et labore nostrud ipsum anim ad officia deserunt qui elit.

Description

This lecture covers the Quantum Approximate Optimization Algorithm for solving combinatorial optimization problems, such as satisfiability problems and examples of booleau variables. It discusses the Runtime Approximate Primaties Algorithm and the process of finding optimal solutions. The instructor, Vincenzo Savona, explains the concepts of Ising Spin Glass and the method proposed to find the minimal energy configuration of classical spins.

Instructor

est sint cupidatat adipisicing

Dolore ex et eiusmod officia incididunt laborum ipsum officia quis voluptate amet dolore ipsum Lorem. Sunt nostrud adipisicing veniam sint proident quis. Consequat laborum eiusmod velit culpa ullamco esse duis sint commodo nisi in consequat cupidatat mollit. Cupidatat duis cillum nulla reprehenderit enim.

Official source

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

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 (36)