For quantum state tomography on rank-r dimension-d states, we show that
...
We consider process tomography for unitary quantum channels. Given acces...
Suppose y is a real random variable, and one is given access
to “the cod...
Let Φ be an irreducible root system (other than G_2) of rank at least
2,...
For an abelian group H acting on the set [ℓ], an (H,ℓ)-lift of a
graph G...
The fundamental problem in much of physics and quantum chemistry is to
o...
We consider a very wide class of models for sparse random Boolean 2CSPs;...
The subject of this textbook is the analysis of Boolean functions. Rough...
We give a pseudorandom generator that fools degree-d polynomial threshol...
We revisit the basic problem of quantum state certification: given copie...
We present a quantum LDPC code family that has distance
Ω(N^3/5/polylog(...
Let p(Y_1, …, Y_d, Z_1, …, Z_e) be a self-adjoint noncommutative
polynom...
For every constant d ≥ 3 and ϵ > 0, we give a deterministic
poly(n)-time...
We precisely determine the SDP value (equivalently, quantum value) of la...
Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...
Let G be any n-vertex graph whose random walk matrix has its nontrivial
...
We study the problem of learning an unknown mixture of k rankings over n...
Let κ∈N_+^ℓ satisfy κ_1 + ... + κ_ℓ =
n and let U_κ denote the "multisli...
Many previous Sum-of-Squares (SOS) lower bounds for CSPs had two deficie...
We give a pseudorandom generator that fools m-facet polytopes over
{0,1}...
A probability distribution over -1, 1^n is (eps, k)-wise uniform if,
rou...
Unlike its cousin 3SAT, the NAE-3SAT (not-all-equal-3SAT) problem has th...