15 citations · 59 across the 27 of their papers we have counts for
32 papers
Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
Tushant Mittal, Shashank Srivastava, Madhur Tulsiani +1
We show that for any and any prime , there exists an infinite family of -ary quantum low-density parity-check (QLDPC) codes, rate , checks of weight …
Sharp Phase Transition for Ellipsoid Fitting
Sofia de la Cerda, Aaron Potechin, Madhur Tulsiani +1
We resolve the ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo, and Willsky up to a vanishing factor. Concretely, for independent Gaussian points in dimensi…
Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs
Noah G. Singer, Madhur Tulsiani, Santhoshini Velusamy
For an arbitrary family of predicates and any , we prove a single-pass, linear-space streaming lower bound against the gap promise pro…
Sketching approximations and LP approximations for finite CSPs are related
Noah G. Singer, Madhur Tulsiani, Santhoshini Velusamy
We identify a connection between the approximability of CSPs in two models: (i) sublinear space streaming algorithms, and (ii) the basic LP relaxation. We show that whenever the ba…
List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
Shashank Srivastava, Madhur Tulsiani
We give a new framework based on graph regularity lemmas, for list decoding and list recovery of codes based on spectral expanders. Using existing algorithms for computing regulari…
Explicit Codes approaching Generalized Singleton Bound using Expanders
Fernando Granha Jeronimo, Tushant Mittal, Shashank Srivastava +1
We construct a new family of explicit codes that are list decodable to capacity and achieve an optimal list size of . In contrast to existing explicit constructions o…