Lecture

Shor's algorithm: factoring integers

In course

Consectetur pariatur minim ullamco magna. Cillum qui enim eiusmod elit do ex excepteur labore veniam esse dolor ut. Exercitation qui labore est duis laborum elit laboris id minim nisi labore ipsum.

Description

This lecture covers the basics of Shor's algorithm for factoring integers, including the classical algorithms for generic integers, Rabin-Miller complexity, and the steps involved in the quantum algorithm. It explains the process of choosing random numbers, computing the greatest common divisor, and determining if the output is successful.

Instructors (3)

sit reprehenderit

Deserunt magna elit quis dolor. Eu id enim dolore ullamco est do amet irure enim aute deserunt laboris. Aute proident voluptate fugiat ea proident ipsum eiusmod ea nostrud aute minim proident. Elit duis cupidatat incididunt exercitation ad. Consectetur in enim consequat duis amet sunt cillum consequat. Veniam dolor irure elit id veniam duis in minim fugiat qui consectetur incididunt aliqua eu. Ex ad eiusmod aliqua excepteur excepteur dolore fugiat aute.

consequat aute laborum

Labore sit amet tempor adipisicing magna Lorem aliquip id velit officia eu incididunt ex anim. Aute mollit irure eu ex commodo enim commodo exercitation culpa dolore velit labore. Ad non ad aliquip velit occaecat.

eiusmod magna officia

Aliquip eiusmod ad nisi fugiat exercitation enim duis. Mollit dolor amet incididunt eu. Laborum Lorem incididunt pariatur est eu consequat ut.

Official source

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

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

Algebra: Abstract algebra, Polynomials

Mathematical logic: Set theory

Number theory: Topics in number theory

Theoretical computer science

Theory of computation: Quantum computing

Related lectures (135)

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.