We propose the first online quantum algorithm for zero-sum games with Õ(...
We study a parameterized version of the local Hamiltonian problem, calle...
Parameterized complexity theory was developed in the 1990s to enrich the...
A locally testable code is an error-correcting code that admits very
eff...
This short note proposes a symbolic approach for representing and reason...
Low degree tests play an important role in classical complexity theory,
...
We show that the class MIP* of languages that can be decided by a classi...
The algorithm and complexity of approximating the permanent of a matrix ...
Starting from the one-way group action framework of Brassard and Yung (C...
We show that any language in nondeterministic time ((...(n))), where the...
We propose the concept of pseudorandom states and study their constructi...