A cryptographic leash: efficient quantum advantage and certifiable randomness
In this talk, we examine the power of a cryptographic leash as a classical verifier. Specifically, we look at how it levels the playing field, allowing for the classical verification of quantum computation, homomorphic quantum computation amongst other quantum computing concept. We’ll also look at quantum supremacy, quitbit certification protocol, best practices when using functions to gain leverage over a bpq prover, and more.
Watch more Quantum Summer Symposium 2022 sessions → https://goo.gle/QSS22
Subscribe to Google Quantum AI → https://goo.gle/QuantumAI
#QSS22
