Minimizing Resources for Cryptographic Proofs of Quantumness (Session 11 of RIT in Quantum Information Science) Speaker Name: Carl Miller Speaker Institution : UMD and NIST Â
How can we reliably test whether a quantum computer has achieved an advantage over existing classical computers? Â A promising approach is to base these tests ("proofs of quantumness") on cryptographic hardness assumptions. Â Such assumptions are the foundation for encryption and authentication protocols, and as such they are well-studied. Â Brakerski et al. (arXiv:1804.00640) introduced an interactive proof quantumness based on a standard lattice-based assumption (learning with errors). Â What would it take to make cryptographic proofs of quantumness realizable on near-term devices? Â I will explore this question and exhibit some of the mathematics involved in this topic, with a focus on the paper "Depth-efficient proofs of quantumness" by Z. Liu and A. Gheorghiu (arXiv:2107.02163).