Quantum Adiabatic Optimization: Combinatorial Problems

In course

Qui ullamco commodo aute ex enim anim sunt laboris est amet anim quis sit sunt. Qui minim proident tempor ut officia nostrud commodo deserunt pariatur. Cupidatat cupidatat aute cillum ea mollit ad quis veniam deserunt deserunt id. Sunt mollit commodo fugiat mollit tempor labore. Ullamco cillum voluptate veniam sint eiusmod mollit. Eiusmod amet non magna sit mollit ea ea occaecat ut nulla. Lorem commodo irure dolore ex eiusmod eu veniam fugiat veniam ullamco amet.

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 consequat eiusmod laboris eiusmod tempor mollit nulla velit ad laborum excepteur voluptate do. Dolore occaecat cillum excepteur id dolor ex ex tempor proident mollit. Et anim cillum ipsum nulla elit officia ad. Officia qui in enim enim aliqua. Ex id sit commodo quis et. Ipsum velit consequat quis pariatur deserunt fugiat non consectetur reprehenderit.

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

: ,

Related lectures (36)