Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
How to Classically Verify a Quantum Cat without Killing It
Yael Tauman Kalai, Dakshita Khurana, Justin Raizes
Existing protocols for classical verification of quantum computation (CVQC) consume the prover's witness state, requiring a new witness state for each invocation. Because QMA witne…
quant-ph2025
Compiling Any into a (Succinct) Classical Interactive Argument
Andrew Huang, Yael Tauman Kalai
We present a generic compiler that converts any protocol into a succinct interactive argument where the communication and the verifier are classical, and where p…
quant-ph2025
Parallel Repetition for Post-Quantum Arguments
Andrew Huang, Yael Tauman Kalai
In this work, we show that parallel repetition of public-coin interactive arguments reduces the soundness error at an exponential rate even in the post-quantum setting. Moreover, w…