Covers the proofs of Irreversible and Reversible circuit theorems, focusing on gates and the issue of irreversibility and reversibility.
Explores fully classical qubits, blind quantum computing, and verifiability in quantum delegation protocols.
Covers input state preparation, output measurement, digital quantum computing paradigm, Pauli rotations, C-Z gates, and Solovay-Kitaev theorem.
Covers quantum circuits, computation model, unitary inclusion, simulation, precision, qubits, and global aspects.
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Covers the concept of quantum computation delegation and the relationship between MIP and RE, addressing common FAQs and discussing helpful materials and interactions with quantum devices.
Introduces the course syllabus, grading scheme, and classical and quantum computation models.
Covers the fundamental principles of quantum computing and unitary evolution in quantum systems.
Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.
Explores the general description of quantum measurements, including post-measurement states and Kraus operators.
