YoVDO

Quantum Homomorphic Encryption for Polynomial Sized Circuits

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Quantum Computing Courses Quantum Cryptography Courses Homomorphic Encryption Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Related Courses

Building Geospatial Apps on Postgres, PostGIS, & Citus at Large Scale
Microsoft via YouTube Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube What's New in Grails 2.0
ChariotSolutions via YouTube Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube