
Quantum learning algorithms imply circuit lower bounds
We establish the first general connection between the design of quantum ...
read it

Oblivious Transfer is in MiniQCrypt
MiniQCrypt is a world where quantumsecure oneway functions exist, and ...
read it

Tight adaptive reprogramming in the QROM
The random oracle model (ROM) enjoys widespread popularity, mostly becau...
read it

StoqMA vs. MA: the power of error reduction
StoqMA characterizes the computational hardness of stoquastic local Hami...
read it

A combinatorial MAcomplete problem
Despite the interest in the complexity class MA, the randomized analog o...
read it

Quantum statistical query learning
We propose a learning model called the quantum statistical learning QSQ ...
read it

Noninteractive classical verification of quantum computation
In a recent breakthrough, Mahadev constructed an interactive protocol th...
read it

ZeroKnowledge for QMA from Locally Simulatable Proofs
We provide several advances to the understanding of the class of Quantum...
read it

Secure Multiparty Quantum Computation with a Dishonest Majority
The cryptographic task of secure multiparty (classical) computation has...
read it

Perfect zero knowledge for quantum multiprover interactive proofs
In this work we consider the interplay between multiprover interactive p...
read it

Quantum hardness of learning shallow classical circuits
In this paper we study the quantum learnability of constantdepth classi...
read it

Stoquastic PCP vs. Randomness
The derandomization of MA, the probabilistic version of NP, is a long st...
read it

Relativistic verifiable delegation of quantum computation
The importance of being able to verify quantum computation delegated to ...
read it
Alex B. Grilo
is this you? claim profile