7 citations · 8 across the 2 of their papers we have counts for
4 papers
Succinct arguments for QMA from standard assumptions via compiled nonlocal games
Tony Metger, Anand Natarajan, Tina Zhang
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work o…
Classical proofs of quantum knowledge
Thomas Vidick, Tina Zhang
We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a…
Non-interactive zero-knowledge arguments for QMA, with preprocessing
Andrea Coladangelo, Thomas Vidick, Tina Zhang
We initiate the study of non-interactive zero-knowledge (NIZK) arguments for languages in QMA. Our first main result is the following: if Learning With Errors (LWE) is hard for qua…
Classical zero-knowledge arguments for quantum computations
Thomas Vidick, Tina Zhang
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argument system which is sound against quantum polynomial-time provers and zero-knowle…