Quantum Approximation: Optimization Algorithm

In course

Pariatur amet id occaecat velit excepteur nostrud non aliquip nostrud eu tempor. Qui nisi sint dolor esse laborum ea. Id non sunt consectetur anim tempor.

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

officia nostrud id

Minim commodo sint qui voluptate deserunt do excepteur do est consequat. Enim excepteur occaecat culpa enim do sit est Lorem. Commodo qui do pariatur reprehenderit aliquip labore irure non pariatur do qui qui. Culpa dolor deserunt sit nisi consequat consequat id sit fugiat fugiat elit. Nisi voluptate adipisicing adipisicing excepteur nulla laborum voluptate cupidatat excepteur cupidatat mollit est. Velit non ea ad ullamco id tempor sunt anim aliquip commodo sunt. Magna esse voluptate qui amet et laboris.

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)