
Fiber Bundle Codes: Breaking the N^1/2polylog(N) Barrier for Quantum LDPC Codes
We present a quantum LDPC code family that has distance Ω(N^3/5/polylog(...
read it

Explicit nearfully XRamanujan graphs
Let p(Y_1, …, Y_d, Z_1, …, Z_e) be a selfadjoint noncommutative polynom...
read it

Explicit nearRamanujan graphs of every degree
For every constant d ≥ 3 and ϵ > 0, we give a deterministic poly(n)time...
read it

The SDP value for random twoeigenvalue CSPs
We precisely determine the SDP value (equivalently, quantum value) of la...
read it

XRamanujan Graphs
Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...
read it

SheraliAdams Strikes Back
Let G be any nvertex graph whose random walk matrix has its nontrivial ...
read it

Learning sparse mixtures of rankings from noisy information
We study the problem of learning an unknown mixture of k rankings over n...
read it

A logSobolev inequality for the multislice, with applications
Let κ∈N_+^ℓ satisfy κ_1 + ... + κ_ℓ = n and let U_κ denote the "multisli...
read it

SOS lower bounds with hard constraints: think global, act local
Many previous SumofSquares (SOS) lower bounds for CSPs had two deficie...
read it

Fooling Polytopes
We give a pseudorandom generator that fools mfacet polytopes over {0,1}...
read it

On closeness to kwise uniformity
A probability distribution over 1, 1^n is (eps, k)wise uniform if, rou...
read it

The threshold for SDPrefutation of random regular NAE3SAT
Unlike its cousin 3SAT, the NAE3SAT (notallequal3SAT) problem has th...
read it
Ryan O'Donnell
is this you? claim profile