Lecture
Quantum Adiabatic Optimization: Combinatorial Problems
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.
Official source
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.