Learn · Quantum Computing: Algorithms and Limitations Through the Query Model
Lecture 27 of 48Week 07
Lecture 27: Examples of Randomized Algorithms - Part 2
Prof. Rajat Mittal · IIT Kanpur
Credits and licence
- From
- Quantum Computing: Algorithms and Limitations Through the Query Model, IIT Kanpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 1: Introduction to Quantum Algorithms
- Lecture 2: Why Quantum Algorithms - Part 1
- Lecture 3: Why Quantum Algorithms - Part 2
- Lecture 4: Analyzing Computation Through Linear Algebra - Part 1
- Lecture 5: Analyzing Computation Through Linear Algebra - Part 2
- Lecture 6: States of Probabilistic Computation - Part 1
- Lecture 7: States of Probabilistic Computation - Part 2
- Lecture 8: States of Quantum Computation (First Postulate) - Part 1
- Lecture 9: States of Quantum Computation (First Postulate) - Part 1
- Lecture 10: Eigenvalues of a Unitary Matrix- Part 1
- Lecture 11: Eigenvalues of a Unitary Matrix- Part 2
- Lecture 12: Operations (Gates) in Quantum Computation- Part 1
- Lecture 13: Operations (Gates) in Quantum Computation- Part 2
- Lecture 14: Projectors and the Third Postulate - Part 1
- Lecture 15: Projectors and the Third Postulate - Part 2
- Lecture 16: Quantum Circuits - Part 1
- Lecture 17: Quantum Circuits - Part 2
- Lecture 18: Example of Quantum Circuits - Part 1:
- Lecture 19: Example of Quantum Circuits - Part 2:
- Lecture 20: Circuit Representation for Elitzur-Vaidman - Part 1:
- Lecture 21: Circuit Representation for Elitzur-Vaidman - Part 2:
- Lecture 22: Deutsch's Algorithm - Part 1
- Lecture 23: Deutsch's Algorithm - Part 2
- Lecture 24: Randomized Algorithms - Part 1
- Lecture 25: Randomized Algorithms - Part 2
- Lecture 26: Examples of Randomized Algorithms - Part 1
- Lecture 27: Examples of Randomized Algorithms - Part 2
- Lecture 28: Bernstein-Vazirani Algorithm and Simon's algorithm - Part 1
- Lecture 29: Bernstein-Vazirani Algorithm and Simon's algorithm - Part 2
- Lecture 30: Basics of Group Theory for Fourier Analysis - Part 1:
- Lecture 31: Basics of Group Theory for Fourier Analysis - Part 2:
- Lecture 32: Quantum Fourier Transform - Part 1:
- Lecture 33: Quantum Fourier Transform - Part 2:
- Lecture 34: Phase estimation and Shor- Part 1:
- Lecture 35: Phase estimation and Shor- Part 2:
- Lecture 36: From Randomized Search to Grover Search- Part 1
- Lecture 37: From Randomized Search to Grover Search- Part 2:
- Lecture 38: Variations of Grover Search:
- Lecture 39: Quantum Walks - Part 1:
- Lecture 40: Quantum Walks - Part 2:
- Lecture 41: Optimality of Randomized Search - Part 1
- Lecture 42: Optimality of Randomized Search - Part 2
- Lecture 43: Optimality of Grover Search - Part 1
- Lecture 44: Optimality of Grover Search - Part 2
- Lecture 45: Quantum Advantage for Total Functions- Part 1
- Lecture 46: Quantum Advantage for Total Functions- Part 2
- Lecture 47: Huang's Sensitivity Theorem- Part 1
- Lecture 48: Huang's Sensitivity Theorem- Part 2