Lecture
Quantum Adiabatic Optimization: Combinatorial Problems
In course
DEMO: enim mollit
Nisi dolore esse consequat sunt occaecat magna excepteur in minim ea qui nostrud excepteur sint. Velit cupidatat dolor quis quis aliquip minim adipisicing do. Labore mollit mollit occaecat laboris qui duis.
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
cupidatat laborum
Anim qui proident elit enim. Exercitation sunt labore ullamco sint est eu pariatur aute magna amet. Excepteur voluptate qui ipsum laboris veniam tempor ea. Ut amet qui cupidatat occaecat aliquip dolor aute sunt commodo labore ipsum. Consequat enim qui deserunt et. Non voluptate aliquip nulla fugiat ex ut reprehenderit excepteur in sunt anim voluptate. Fugiat aliqua non ullamco deserunt velit veniam laboris anim anim.
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.
Ontological neighbourhood
Related lectures (36)
Elements of Computational Complexity
Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.
Quantum Natural Gradient: Optimization Methods in Quantum Computing
Explores Quantum Natural Gradient optimization in quantum computing and the importance of choosing the right ansatz.
Quantum Information and Computation
Covers quantum information, computation, advantages, challenges, error correction, and quantum algorithms.
Quantum Phase Estimation
Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.
The Period Finding Algorithm
Explores the Quantum Phase Estimation method for finding the period of a function using an oracle.