Previous work by Brakerski et al. (2018) described a 2-party interactive protocol that enables one party to prove that they have quantum computational abilities. The protocol is based on the Learning With Errors (LWE) assumption, a standard computational hardness assumption from classical cryptography. In this talk, I will give an introduction to the protocol of Brakerski et al., and then I will discuss a recent paper of ours that optimizes their protocol and brings it closer to experimental realization. The optimization is based on the use of qubit rotations around the Z-axis at an intermediate stage of the protocol. I will also discuss how the same approach improves protocols for remote state preparation.
Reference: Y. Alnawakhtha, A. Mantri, C. Miller, D. Wang, “Lattice-Based Quantum Advantage from Rotated Measurements,” arXiv:2210.10143 (2022).
(Refreshments will be provided.)