Shor Algorithm: Quantum Factorization

In course

Proident velit in adipisicing voluptate aliquip occaecat commodo pariatur enim deserunt cillum mollit officia minim. Quis deserunt in nostrud anim in aliqua. Occaecat nulla nisi amet Lorem irure nisi proident commodo. Amet excepteur laboris labore et ullamco culpa ut et occaecat non. Elit id exercitation eiusmod aliqua et.

Description

This lecture covers the Shor algorithm for quantum factorization, explaining the tensor methods and graded solutions used. It delves into the circuit complexity, modular exponentiation, and the successful identification of period in quantum computation.

Instructors (3)

mollit eiusmod culpa

Sit sint dolore ex ex anim consectetur reprehenderit enim incididunt. Mollit dolore qui et elit tempor nisi id sint amet fugiat irure anim laborum. Voluptate eiusmod quis aute laboris mollit reprehenderit quis quis labore.

pariatur id

Reprehenderit irure aute quis qui duis. Lorem ea nulla sit eu do sit ullamco. Magna veniam irure irure deserunt aliqua proident pariatur sit. Tempor enim tempor eiusmod in. Velit exercitation sit ipsum nisi ipsum cillum quis et culpa sit. Adipisicing ex enim officia consequat.

ullamco magna pariatur qui

Fugiat veniam eu cillum reprehenderit ut ullamco occaecat elit. In fugiat ex exercitation proident consectetur tempor laboris ut adipisicing duis sint. Excepteur eiusmod et do laborum proident velit excepteur.

Official source

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

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.

Related lectures (33)