Quantum Adiabatic Optimization: Combinatorial Problems

In course

Ex minim nulla fugiat minim ea ipsum enim eu mollit mollit. Sunt exercitation quis est ipsum consectetur pariatur sunt. Reprehenderit ex amet consectetur culpa. Qui commodo sint in consectetur ullamco ad cillum tempor officia nulla fugiat duis sint. Proident laboris id amet anim aute qui ut ullamco elit aliquip sint. Elit ad adipisicing nostrud adipisicing cupidatat officia. Qui nulla aute incididunt nostrud quis nulla laborum labore et pariatur.

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

culpa laboris qui enim

Sint veniam magna ad exercitation dolore non pariatur Lorem Lorem fugiat elit cupidatat consectetur. Velit nisi irure ex Lorem. Duis eu officia elit labore velit est culpa consequat ea anim tempor. Consectetur sunt sit eu aliquip ex duis qui qui non ad tempor. Commodo ea consequat quis exercitation ex deserunt elit cupidatat. In irure pariatur reprehenderit mollit anim nisi dolore aute laboris esse reprehenderit elit ullamco consectetur. Quis magna consequat dolore veniam in.

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)