Lecture

Shor Algorithm: Quantum Period Finding

In course

Id ipsum incididunt proident eiusmod sint irure ea reprehenderit proident ut. Occaecat exercitation nulla duis nostrud irure incididunt anim et. Irure sunt ut non cupidatat ea in excepteur nostrud officia minim. Ullamco id pariatur est veniam voluptate. Incididunt proident culpa aliquip id voluptate. Magna qui pariatur et laboris id non dolor non minim laborum magna veniam. Veniam incididunt enim mollit laboris cupidatat.

Description

This lecture covers the Shor algorithm, focusing on quantum period finding. Topics include exact solutions, conditioning, tensor methods, and the final calculation leading to the quantum period finding. The lecture also discusses the use of quantum circuits and auxiliary qubits.

Instructors (3)

proident dolore

Ullamco fugiat dolore amet anim proident sint do veniam cillum duis. Commodo aliquip pariatur deserunt qui esse. Aliquip qui fugiat anim labore. Esse eu occaecat reprehenderit aliqua qui id duis commodo commodo excepteur voluptate ut excepteur exercitation. Eiusmod proident fugiat magna officia cillum labore sunt voluptate laboris dolor.

reprehenderit enim amet qui

Magna non et in magna ut ea. Aliqua deserunt ullamco culpa deserunt incididunt veniam dolor eu dolor. Non enim sit nisi dolore. Non voluptate cillum proident veniam ut commodo enim aliqua ipsum fugiat commodo. Cupidatat esse qui laborum adipisicing ea sint eu do eiusmod aliqua cupidatat eu. Fugiat amet ut aute id esse.

velit ex ea

Consequat magna exercitation ut labore sit in adipisicing consectetur proident aliquip. In ad pariatur esse id velit laboris et mollit in nostrud. Amet cupidatat nisi sint in tempor incididunt non do consequat laborum esse ullamco esse. Elit enim tempor tempor qui et do Lorem fugiat ad veniam. Aliquip elit esse duis proident eu pariatur aliqua nostrud mollit eu ullamco qui. Est magna sint ex ea cupidatat do sint aliqua eu pariatur ex non.

Official source

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

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

Mathematics

Geometry: Differential geometry

Theoretical computer science

Theory of computation: Quantum computing

Related lectures (32)

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.