Lecture
Deutsch and Josza Problem
Related lectures (36)
Quantum Circuits: Model and Computation
Covers quantum circuits, computation model, unitary inclusion, simulation, precision, qubits, and global aspects.
Quantum Computation Delegation
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.
Quantum Computing: Introduction
Covers quantum computing basics, quantum algorithms, error correction, and quantum bit manipulation.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Introduction: Course syllabus
Introduces the course syllabus, grading scheme, and classical and quantum computation models.
The Deutsch and Deutsch-Jozsa Algorithms
Covers the Deutsch and Deutsch-Jozsa algorithms in quantum computing, explaining the principles behind them and their implications.
Grover's Quantum Search Algorithm
Explains Grover's Quantum Search Algorithm, which outperforms classical algorithms in searching unstructured databases using O(√N) queries.
Shor's Factoring Algorithm
Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.
Elements of Computational Complexity
Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.