Quantum Query Algorithms | Understanding Quantum Information & Computation | Lesson 05

This is part of the Understanding Quantum Information & Computation series. Watch the full playlist here:    • Understanding Quantum Information & Comput...   This lesson is on the quantum query model of computation. It describes a progression of quantum algorithms that offer advantages over classical algorithms within this model, including Deutsch’s algorithm, the Deutsch-Josza algorithm, and Simon’s algorithm. Additional materials for this course, including written text, Qiskit implementations, and slides in pdf format, can be found on IBM Quantum Learning by following this link: https://learning.quantum.ibm.com/cour... 0:00 — Introduction 2:13 — Overview 3:45 — A standard picture of computation 5:19 — The query model of computation 8:19 — Examples of query problems 12:49 — Query gates 22:08 — Deutsch’s algorithm 22:50 — Deutsch’s problem 24:46 — Deutsch’s algorithm 31:08 — Phase kickback 34:06 — The Deutsch-Jozsa circuit 35:40 — The Deutsch-Jozsa problem 37:48 — Deutsch-Jozsa analysis 47:30 — The Bernstein-Vazirani problem 51:53 — Simon’s algorithm 52:46 — Simon’s problem 57:46 — Simon’s algorithm 59:25 — Simon’s algorithm analysis 1:09:28 — Classical post-processing 1:15:31 — Classical difficulty 1:18:14 — Conclusion #ibmquantum #learnquantum #qiskit