Florian Speelman: Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explains quantum homomorphic encryption for polynomial-sized circuits, teaching cryptographic protocols for quantum computation. The specific encryption scheme is a defined research contribution.

A 54-minute video from Microsoft Research: “Florian Speelman: Quantum homomorphic encryption for polynomial-sized circuits (Best Student Paper)”.

Video by Microsoft Research, played through YouTube's embedded player.

Part of Homomorphic Encryption Research, Quantum Computing