Quantum computers are in general believed to be more powerful than classical computers, but it is not clear if they are powerful enough to solve problems that a classical computer can’t even verify. Are there any tasks which a malicious quantum agent can solve and claim an answer that go unchecked by classical parties? There were several attempts to find the answer to this question. In this talk, I will discuss a recent development which was the discovery of a protocol for a classical computer to efficiently verify the results of any efficient quantum computation by Urmila Mahadev.
