Lecture

Shor's algorithm: factoring integers

Related lectures (135)
Distributed Computation II
Explores the analysis of the Yao Model and communication between Alice and Bob using qubits and binary expansions.
Improved Algorithm: Three-Color Parity Games
Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.
Number Theory: GCD and LCM
Covers GCD, LCM, and the Euclidean algorithm for efficient computation.
Shor Algorithm: Quantum Factorization
Covers the Shor algorithm for quantum factorization and the general formula for arithmetic periods.
Fault tolerance: Stabilizer Subgroup
Explores fault tolerance, error propagation, and the Gottesman-Kill Theorem in stabilizer subgroups.
Number Theory: GCD and LCM
Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.
Shor Algorithm: Quantum Factorization
Explores the Shor algorithm for quantum factorization and its application in finding function periods.
RSA Cryptography: Primality Testing and Quadratic Residues
Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.
Error Correction: Shor II
Covers error correction using Shor codes and their concatenation to improve capabilities.
Shor Algorithm: Circuit Details II
Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.

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.