Grover's Algorithm || @ CMU || Lecture 9c of CS Theory Toolkit

preview_player
Показать описание
Grover's Algorithm: unordered search of a size-N database in O(sqrt(N)) time, or solving SAT in O~(sqrt(2)^n) time. Lecture 9c of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
"Quantum Computation and Quantum Information" by Nielsen and Chuang
"Quantum Computer Science" by Mermin

Рекомендации по теме
visit shbcf.ru