On the computational hardness needed for quantum cryptography
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=8KgU-Y_s0Rs
Authors: Zvika Brakerski (Weizmann Institute of Science); Ran Canetti, Luowen Qian (Boston University)
ITCS - Innovations in Theoretical Computer Science
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS - Innovations in Theoretical Computer Science