Shor Algorithm: Quantum Factorization

Related lectures (31)

Page 3 of 4

Introduces the course syllabus, grading scheme, and classical and quantum computation models.

Explores quantum computing fundamentals, qubit control, communication security, and quantum Fourier transform applications.

Explores methods and algorithms for integer factorization, including testing for B smoothness and computing small primes.

Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.

Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.

Explores the Simon 1 problem in quantum computing, emphasizing symmetry, oracle queries, and quantum measurements.

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Explores recent progress in quantum computational advantage and discusses the challenges in achieving quantum supremacy.

Covers the Deutsch-Josza algorithm, a quantum algorithm solving problems with a single query to an oracle.

Explores checking a generator of a group, the Diffie-Hellman key exchange, and cryptographic algorithms.