497 citations · 1.6k across the 74 of their papers we have counts for
4 papers · 1 filter
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…
Computationally-secure and composable remote state preparation
Alexandru Gheorghiu, Thomas Vidick
We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparatio…
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…
Bounds on Dimension Reduction in the Nuclear Norm
Oded Regev, Thomas Vidick
For all , we give an explicit construction of matrices with s…