Learn Generative AI, Prompt Engineering, and LLMs for Free
Free courses from frontend to fullstack and AI
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore quantum homomorphic encryption for polynomial sized circuits in this 21-minute conference talk from Crypto 2016. Delve into the Clifford scheme, including PH and CNOT gates, and examine the challenges of T gates. Learn about error-correction "gadgets" and gain insights into a new scheme overview. Presented by Yfke Dulek, Christian Schaffner, and Florian Speelman, this talk provides a comprehensive look at advancements in quantum cryptography.
Syllabus
Intro
EXAMPLE IMAGE TAGGING
PREVIOUS RESULTS: OVERVIEW
CLIFFORD SCHEME: PH, CNOT
THE CHALLENGE T GATE
ERROR-CORRECTION "GADGET"
NEW SCHEME OVERVIEW
Taught by
TheIACR