In this note, we observe that quantum logspace computations are verifiab...
This is an overview of some of the works of Avi Wigderson, 2021 Abel pri...
Let ℒ be a language that can be decided in linear space and let
ϵ >0 be ...
In a work by Raz (J. ACM and FOCS 16), it was proved that any algorithm ...
We prove that for every 3-player (3-prover) game 𝒢 with value less
than ...
We prove that for every 3-player game with binary questions and answers ...
We give a new proof of the fact that the parallel repetition of the
(3-p...
In this work, we show, for the well-studied problem of learning parity u...
We show that quantum algorithms of time T and space S≥log T with
unitary...
We prove that a sufficiently strong parallel repetition theorem for a sp...
We prove that any two-pass graph streaming algorithm for the s-t
reachab...
We prove that parallel repetition of the (3-player) GHZ game reduces the...
The Forrelation problem, introduced by Aaronson [A10] and Aaronson and
A...
We give a quantum logspace algorithm for powering contraction matrices, ...
In this work, we establish lower-bounds against memory bounded algorithm...
We study a new type of separation between quantum and classical communic...
A matrix M: A × X →{-1,1} corresponds to the following
learning problem:...