Quantum Approximation: Optimization Algorithm

In course

Velit id veniam ipsum officia elit velit aliquip ut sint do nisi ea id. Lorem proident sint reprehenderit dolore sunt cupidatat sint pariatur minim. Do nisi duis veniam cillum est labore consequat.

Description

This lecture covers the Quantum Approximate Optimization Algorithm (QAOA) and its application in quantum optimization. The instructor discusses the trade-off between quantum resources and success probability in factoring integers using a superconducting quantum processor. Various noise sources and error sources are empirically analyzed, revealing the impact of residual ZZ-coupling between qubits. The lecture also explores the optimal number of circuit layers to maximize success probability.

Instructor

culpa minim excepteur reprehenderit

Cupidatat commodo cillum eu excepteur amet veniam fugiat eiusmod culpa. Deserunt ipsum reprehenderit veniam minim ad proident sunt velit dolore nulla dolore labore consectetur elit. Esse velit enim reprehenderit anim fugiat sint eiusmod.

Official source

https://mediaspace.epfl.ch/media/0_yk9p03j1

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: Quantum computing

Mathematics

Mathematical logic: Set theory

Related lectures (43)