Giulio Malavolta

A simple game on a sphere certifies an entire continuous family of quantum measurements, not just discrete ones.

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

The NTT reveals a surprising tradeoff: a \( k \)-sparse function guarantees a transform support that grows linearly with the prime modulus, fundamentally enhancing polynomial identity testing.