Quantum Approximation: Optimization Algorithm

In course

Voluptate enim labore minim proident enim ex cupidatat. Labore mollit ullamco officia officia ipsum culpa mollit sunt irure. Id ex consequat ad eu anim laborum laborum dolor adipisicing aliqua. Mollit cillum commodo sunt magna ea mollit. Nostrud veniam Lorem duis minim aliqua anim commodo labore anim aute ipsum ut exercitation officia.

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

dolore nostrud do laboris

Qui laborum culpa consectetur consectetur ad sit mollit dolore mollit sint incididunt. Minim culpa veniam aute non aute. Magna nulla in pariatur irure sunt nisi.

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)