Groups and Numbers: Hidden Subgroup Problem

Related lectures (31)

Page 1 of 4

Covers classical and quantum computational complexity concepts and implications.

Covers Shor's factoring algorithm and the link between order finding and factoring.

Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.

Covers the basics of Shor's algorithm for factoring integers and the steps involved in the quantum algorithm.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

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

Covers the Shor algorithm for quantum factorization and the general formula for arithmetic periods.

Covers the basics of number theory, RSA encryption, and Shor's period finding algorithm.

Covers the Quantum Order Finding algorithm using Quantum Phase Estimation (QPE), focusing on Shor's factoring algorithm.

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