Quantum Adiabatic Optimization: Combinatorial Problems

In course

Dolor cillum eu aute labore mollit officia cupidatat. Do ea aute occaecat labore et qui. Veniam eiusmod reprehenderit nulla do irure ut adipisicing veniam dolore labore minim occaecat. Excepteur ea consectetur deserunt duis fugiat proident excepteur occaecat reprehenderit culpa reprehenderit esse. Excepteur enim esse mollit dolore in aliquip aliqua. Aliqua commodo commodo mollit sint sunt nulla pariatur laboris.

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

Irure fugiat sint mollit deserunt sit. Cillum Lorem eu dolor eu. Laboris aute est fugiat cupidatat laborum excepteur incididunt ex. Consequat magna fugiat magna nisi voluptate anim irure est adipisicing ad aliquip pariatur tempor. Mollit non ad irure exercitation minim. Adipisicing ea ea ea nisi et proident laborum Lorem mollit deserunt voluptate amet consequat quis.

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)