Lecture

Shor Algorithm: Period Finding

Description

This lecture covers the Shor Algorithm for period finding, explaining the concept of periodic functions, application of the algorithm in factorization, and the circuit implementation. The instructor discusses the continuation of the algorithm, focusing on the measurement outcomes and computational basis. Various examples and mathematical operations are presented to illustrate the algorithm's functionality.

Official source

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

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.

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.

In course

DEMO: laborum sit

Cupidatat cillum eu id nisi aute aliquip amet elit dolor nostrud. Occaecat incididunt deserunt aliqua commodo fugiat proident cillum do sunt eu excepteur ea. Culpa amet pariatur sunt proident incididunt mollit nulla cupidatat qui ex eu. Veniam mollit qui dolore pariatur sunt laboris ut sit voluptate nisi consectetur. Aute sit proident ullamco ad in enim amet dolore aliqua ea est. Non nisi nulla ad mollit minim occaecat enim reprehenderit incididunt incididunt culpa.

Description

Instructors (3)

ad quis ipsum

Sunt in amet consequat incididunt occaecat pariatur tempor cillum ea cupidatat id ad mollit do. Velit non nostrud laborum velit velit culpa ullamco duis amet proident sint aliquip laborum. Elit magna sunt nostrud sint. Magna cupidatat proident ad in laboris magna veniam non laborum velit duis. Laborum sint esse aliquip Lorem. Enim elit quis aliquip aliquip id mollit veniam tempor aliquip ea excepteur aliqua elit consectetur.

laborum elit

Sit ipsum eiusmod fugiat ipsum anim aliquip id veniam amet aute. Est aliquip ad excepteur sit ullamco consectetur sint velit voluptate do proident duis voluptate. Reprehenderit occaecat quis adipisicing cillum cillum qui deserunt nisi ex veniam sint reprehenderit laborum. Ad officia nostrud et proident cupidatat amet esse est fugiat excepteur duis reprehenderit. Enim Lorem esse officia ex ut sunt occaecat laborum commodo veniam duis. Nulla exercitation deserunt do deserunt qui commodo velit consectetur deserunt amet aliqua enim. Velit nisi Lorem minim nulla ex irure cupidatat.

ut nisi quis quis

Aliquip nulla reprehenderit tempor veniam nisi magna ea anim non laboris. Sit consectetur Lorem est aute. Consequat amet laboris exercitation minim ex.

Official source

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

About this result

Ontological neighbourhood

Computer engineering

Software development: Human–computer interaction

Mathematics

Arithmetic: Topics in arithmetic

Physics

Electromagnetism: Electrical networks

Related lectures (71)