Course

CS-308: Introduction to quantum computation

Lectures in this course (61)

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

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

Covers the proofs of Irreversible and Reversible circuit theorems, focusing on gates and the issue of irreversibility and reversibility.

Explores classic circuits in quantum computing, including Boolean functions and reversible gates.

Covers linear algebra in Dirac notation, emphasizing the scalar product and density product in quantum computations.

Covers linear algebra in Dirac notation, focusing on vector spaces and quantum bits.

Covers the fundamental principles of quantum computing and unitary evolution in quantum systems.

Covers the principles of quantum physics, focusing on tensor product spaces and entangled vectors.

Explores the fundamental principles of quantum physics, including quantum states, unitary transformations, Hilbert spaces, and measurement processes.

Covers quantum circuits, computation model, unitary inclusion, simulation, precision, qubits, and global aspects.

Covers the Cincent Model of Deutsch for Quantum Computation, focusing on input representation, Hilbert space, and unitary evolution.

Explores quantum circuit modeling, approximations, unitary matrices, and measurement operations.

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.

Explores the quantum circuit model of computation, focusing on unitary gates and multi-controlled gates.

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

Delves into distributed quantum computing, showcasing quantum algorithms and protocols to optimize communication complexity.

Explores distributed computation between two parties in a distant setting.

Covers the analysis of the Deutsch Josza circuit in quantum computation, focusing on stochastic PDES and circuit analysis.

Explores the analysis of the Yao Model and communication between Alice and Bob using qubits and binary expansions.

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