Lecture

Order finding algorithm

Description

This lecture covers the order finding algorithm, which aims to find the period of a function modulo N. The algorithm involves taking an integer x and searching for the smallest r such that x^r ≡ 1 (mod N). It explores the application of Quantum Phase Estimation (QPE) to the unitary operator U, focusing on finding the period efficiently. The lecture delves into the process of applying C-U gates and coding them effectively. Various examples and proofs are provided to illustrate the algorithm's working and efficiency.

Instructor

aute amet

Est ullamco consequat deserunt Lorem duis. Ex dolore cupidatat qui non laborum culpa. Culpa ut ipsum culpa amet officia esse culpa cillum. Incididunt elit minim reprehenderit id. Eiusmod commodo aliquip eiusmod duis. Incididunt enim minim laboris exercitation eiusmod nostrud excepteur voluptate occaecat. Ut commodo est ex cillum Lorem minim eu.

Official source

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

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

Analysis: Functional analysis

Theoretical computer science

Theory of computation: Quantum computing

Logic

Classical logic: First-order logic

Related lectures (33)

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.