Classical Verification of Quantum Computations – QIP 2019 Keynote

Is it possible for an efficient classical verifier (a BPP machine) to verify the output of an efficient quantum prover (a BQP machine)? The answer is Yes. Researchers show that a classical polynomial...

[[ This is a content summary only. Visit my website for full links, other content, and more! ]]