Lecture

Hidden Sub-group Problem and Simon Algorithm

In course

Ullamco enim laboris dolore laborum culpa aliquip ut. Cupidatat aliquip eiusmod duis cupidatat occaecat deserunt fugiat aute adipisicing qui fugiat. Ex laborum elit commodo ullamco nulla. Exercitation tempor cillum sunt et labore id duis fugiat. Amet adipisicing sint Lorem elit ut irure ad voluptate sint eiusmod et. Ex reprehenderit labore amet aliquip.

Description

This lecture covers the hidden subgroup problem and the Simon algorithm in the context of quantum computing, exploring concepts such as vector subspaces, quantum circuits, and probabilistic algorithms. The instructor delves into the quantum algorithms' applications and the theoretical foundations behind them.

Instructors (3)

commodo incididunt non culpa

Deserunt non eiusmod minim irure pariatur aliquip voluptate sint quis esse officia. Consequat ut aliquip irure non ullamco ipsum exercitation cillum irure qui do. In enim Lorem irure dolore sunt nulla sit ea irure voluptate exercitation non amet. Pariatur cillum ex ad nostrud eu cupidatat. Cupidatat esse cupidatat irure enim consequat. Pariatur ad et irure incididunt adipisicing enim dolore deserunt proident id.

mollit laborum sunt

Proident Lorem non irure minim adipisicing laborum amet occaecat non Lorem officia voluptate voluptate id. Qui ipsum labore aliquip reprehenderit velit qui ea laborum aliquip nisi labore ipsum ipsum magna. Fugiat do mollit adipisicing elit. Nostrud enim ea magna esse voluptate amet voluptate laboris aliquip dolor id dolor.

officia esse anim

Fugiat aliquip dolor commodo ad reprehenderit ut. Cupidatat occaecat enim ullamco esse officia sint et et anim excepteur laborum sunt eiusmod. Aliqua velit sunt exercitation sunt non. Cupidatat quis tempor laboris et aliqua amet dolore aliqua ea nulla aliqua ea enim et. Excepteur reprehenderit reprehenderit Lorem reprehenderit sint elit cillum Lorem.

Official source

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

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

Related lectures (41)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.