0 Members and 1 Guest are viewing this topic.
Basically, complexity of a problem depends on the size of its search space, and the size of impact and cost of each step or iteration in solving it.
I can convince you that I?ve solved a sudoku without giving you any information about my solution. We discuss how to do this using what cryptographers call a zero-knowledge proof, and how the same tricks can be used for almost any other problem you can think of.0:00 Intro0:50 Interactive proofs2:28 Graph coloring3:22 A simple protocol6:31 Building the full protocol10:24 Commitment schemes12:37 Reducing sudoku to coloring14:28 General reduction17:04 Discussion19:09 Outro
Qubits, state vectors, and Grover's algorithm for search.Instead of sponsored ad reads, these lessons are funded directly by viewers: https://3b1b.co/supportAn equally valuable form of support is to share the videos.The subtitles on this video were done using AI, and are likely imperfect, but they are open for community corrections at https://criblate.com/Adam Brown's paper on the connection between Grover's Algorithm and block collisions:https://arxiv.org/pdf/1912.02207Timestamps:0:00 - Misconceptions6:03 - The state vector12:00 - Qubits15:52 - The vibe of quantum algorithms18:38 - Grover?s Algorithm29:30 - Support pitch30:11 - Complex values31:27 - Why square root?34:01 - Connection to block collisions 35:08 - Additional resources------------------