Ryan O'Donnell

is this you? claim profile

0 followers
Carnegie Mellon University

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(...
09/08/2020 ∙ by Matthew B. Hastings, et al. ∙ 0 ∙ share

read it
Explicit near-fully X-Ramanujan graphs

Let p(Y_1, …, Y_d, Z_1, …, Z_e) be a self-adjoint noncommutative polynom...
09/05/2020 ∙ by Ryan O'Donnell, et al. ∙ 0 ∙ share

read it
Explicit near-Ramanujan graphs of every degree

For every constant d ≥ 3 and ϵ > 0, we give a deterministic poly(n)-time...
09/16/2019 ∙ by Sidhanth Mohanty, et al. ∙ 0 ∙ share

read it
The SDP value for random two-eigenvalue CSPs

We precisely determine the SDP value (equivalently, quantum value) of la...
06/16/2019 ∙ by Sidhanth Mohanty, et al. ∙ 0 ∙ share

read it
X-Ramanujan Graphs

Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...
04/06/2019 ∙ by Sidhanth Mohanty, et al. ∙ 0 ∙ share

read it
Sherali--Adams Strikes Back

Let G be any n-vertex graph whose random walk matrix has its nontrivial ...
12/24/2018 ∙ by Ryan O'Donnell, et al. ∙ 0 ∙ share

read it
Learning sparse mixtures of rankings from noisy information

We study the problem of learning an unknown mixture of k rankings over n...
11/03/2018 ∙ by Anindya De, et al. ∙ 0 ∙ share

read it
A log-Sobolev inequality for the multislice, with applications

Let κ∈N_+^ℓ satisfy κ_1 + ... + κ_ℓ = n and let U_κ denote the "multisli...
09/10/2018 ∙ by Yuval Filmus, et al. ∙ 0 ∙ share

read it
SOS lower bounds with hard constraints: think global, act local

Many previous Sum-of-Squares (SOS) lower bounds for CSPs had two deficie...
09/04/2018 ∙ by Pravesh Kothari, et al. ∙ 0 ∙ share

read it
Fooling Polytopes

We give a pseudorandom generator that fools m-facet polytopes over {0,1}...
08/13/2018 ∙ by Ryan O'Donnell, et al. ∙ 0 ∙ share

read it
On closeness to k-wise uniformity

A probability distribution over -1, 1^n is (eps, k)-wise uniform if, rou...
06/10/2018 ∙ by Ryan O'Donnell, et al. ∙ 0 ∙ share

read it
The threshold for SDP-refutation of random regular NAE-3SAT

Unlike its cousin 3SAT, the NAE-3SAT (not-all-equal-3SAT) problem has th...
04/14/2018 ∙ by Yash Deshpande, et al. ∙ 0 ∙ share

read it

Ryan O'Donnell

Featured Co-authors

Andrea Montanari

Yu Zhao

Yuval Filmus

Anindya De

Rocco A. Servedio

Tselil Schramm

Xinyu Wu

Li-Yang Tan

Sidhanth Mohanty

Yash Deshpande

Subhabrata Sen

Fiber Bundle Codes: Breaking the N^1/2polylog(N) Barrier for Quantum LDPC Codes

Explicit near-fully X-Ramanujan graphs

Explicit near-Ramanujan graphs of every degree

The SDP value for random two-eigenvalue CSPs

X-Ramanujan Graphs

Sherali--Adams Strikes Back

Learning sparse mixtures of rankings from noisy information

A log-Sobolev inequality for the multislice, with applications

SOS lower bounds with hard constraints: think global, act local

Fooling Polytopes

On closeness to k-wise uniformity

The threshold for SDP-refutation of random regular NAE-3SAT