Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.
Official source
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.