research
∙
06/29/2022
Succinct Classical Verification of Quantum Computation
We construct a classically verifiable succinct interactive argument for ...
share
research
∙
04/24/2022
Efficient Certifiable Randomness from a Single Quantum Device
Brakerski et. al [BCM+18] introduced the model of cryptographic testing ...
research
∙
11/15/2021
Quantum soundness of testing tensor codes
A locally testable code is an error-correcting code that admits very eff...
research
∙
07/28/2021
A monogamy-of-entanglement game for subspace coset states
We establish a strong monogamy-of-entanglement property for subspace cos...
research
∙
09/27/2020
Quantum soundness of the classical low individual degree test
Low degree tests play an important role in classical complexity theory, ...
research
∙
05/11/2020
Simpler Proofs of Quantumness
A proof of quantumness is a method for provably demonstrating (to a clas...
research
∙
01/13/2020
MIP*=RE
We show that the class MIP* of languages that can be decided by a classi...
research
∙
11/18/2019
Non-interactive zero-knowledge arguments for QMA, with preprocessing
A non-interactive zero-knowledge (NIZK) proof system for a language L∈NP...
research
∙
04/12/2019
Computationally-secure and composable remote state preparation
We introduce a protocol between a classical polynomial-time verifier and...
research
∙
05/30/2018
Quantum proof systems for iterated exponential time, and beyond
We show that any language in nondeterministic time ((...(n))), where the...
research
∙
04/02/2018
Certifiable Randomness from a Single Quantum Device
We give a protocol for producing certifiable randomness from a single un...
research
∙
10/09/2017
