The level-k ℓ_1-Fourier weight of a Boolean function refers to the sum
o...
In this note, we observe that quantum logspace computations are verifiab...
We study the advantages of quantum communication models over classical
c...
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...
We show that quantum algorithms of time T and space S≥log T with
unitary...
We prove that for every parity decision tree of depth d on n variables,
...
The Forrelation problem, introduced by Aaronson [A10] and Aaronson and
A...
We give a quantum logspace algorithm for powering contraction matrices, ...
We study a new type of separation between quantum and classical communic...