Zhengfeng Ji: Compression of quantum multi-prover interactive proofs

About this video

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

Explains compression of quantum multi-prover interactive proofs, teaching techniques for reducing proof complexity. The specific compression problem is a defined research topic.

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

Part of Quantum Computing