Recently, an experiment using a quantum processor realized a protocol for ‘Certified Randomness’, generating remotely verifiable randomness appealing for applications involving mutually untrusting parties. This protocol builds on the success of pushing the ability of quantum computers to perform beyond-classical computational tasks and leverages the classical hardness of sampling from random quantum circuits to certify 70 kbits of entropy against a realistic adversary using best-known attacks. In this talk, I will discuss the experiment protocol, underlying assumptions, and security guarantees. I also identify applications in areas including cryptography, differential privacy, and blockchain that may benefit from certified randomness, improving security and fairness.
*We strongly encourage attendees to use their full name (and if possible, their UMD credentials) to join the zoom session.*
