CS-308: Introduction to quantum computation

Lectures in this course (61)

Covers Simon's quantum algorithm, unitary operations, and the Simon problem.

Explores entangled and product states in distributed computation with mathematical examples.

Explores quantum measurement analysis, including the Simon problem and geometric analogies.

Explores the hidden sub-group problem and Simon algorithm in quantum computing.

Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.

Explores the hidden subgroup problem and the Simon algorithm in quantum computing.

Explores fundamental properties of groups and numbers, emphasizing equivalence classes and subgroup concepts.

Covers the hidden sub-group problem and the Simon algorithm in quantum computing.

Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.

Explores groups and numbers, emphasizing the hidden subgroup problem and its complexities in classic and quantum algorithms.

Explores the Shor algorithm for quantum factorization and its application in finding function periods.

Covers the Hidden Subgroup Algorithm in quantum computing, emphasizing projectors and measurement postulates.

Explores the Shor algorithm's quantum circuit analysis and the Quantum Fourier Transform application.

Explores cosets in commutative groups, Lagrange theorem, and integer factorization.

Covers the Shor algorithm, focusing on quantum period finding and the use of quantum circuits.

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

Covers Shor's algorithm for period finding in quantum computing, explaining the quantum circuit and algorithm used.

Explores the analysis of the measurement process in the Shor Algorithm.

Covers the implementation of Shor's algorithm on a quantum circuit, including the analysis of quantum Fourier transform.

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

Page 2 of 4