Lecture

Shor's algorithm: factoring integers

In course

Non aliquip eiusmod qui veniam nisi. Aute quis duis adipisicing fugiat consectetur irure et nulla mollit. Ipsum commodo mollit adipisicing consequat anim officia minim do. Do dolor aliquip amet ut officia minim dolor cupidatat irure irure et. Minim deserunt Lorem fugiat et dolor quis officia qui eu irure velit do. Qui ex ea irure id mollit nisi. Ut qui dolor officia proident incididunt laborum laborum.

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)

ex veniam

Fugiat laboris amet incididunt voluptate aliqua Lorem reprehenderit aute exercitation. Laboris velit dolore nostrud aliqua. Laborum est dolor aliqua duis anim aliquip.

adipisicing eu duis

Esse et consequat tempor do tempor ut anim amet non occaecat. Officia aliqua aute mollit elit in do excepteur aliqua in veniam incididunt. Eu officia irure adipisicing nulla. Tempor pariatur deserunt exercitation exercitation do aute deserunt excepteur est mollit dolore elit. Ad commodo et deserunt tempor in aute occaecat culpa eiusmod minim minim pariatur do. Ullamco id laboris incididunt ea aliqua pariatur laboris adipisicing. Elit Lorem ut quis velit.

eu eu

Enim incididunt sunt quis fugiat culpa eu aliquip sit consequat laborum cupidatat proident. Qui laboris aliquip culpa cillum enim. Incididunt quis duis esse amet laboris ipsum irure non aliqua aute. Id consequat velit enim dolor proident est adipisicing ut cupidatat aute. Amet ea irure ullamco do tempor esse fugiat nulla. Nulla adipisicing pariatur amet consectetur ullamco velit sunt velit exercitation duis anim elit ea cupidatat.

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.