James Bartusek

Verifying quantum proofs succinctly does not require heavy public-key cryptography: collapsing hash functions alone are sufficient to construct succinct arguments for QMA.

Tests of non-commutation can unlock classical cryptographic protocols like key agreement and oblivious transfer, even in the presence of quantum adversaries.