Tushant Mittal

activity

20172026

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy +1

We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, $d \leq 1/ λ^{2 + o (1)}$ ) trade-off…

cs.DS2021

Explicit Abelian Lifts and Quantum LDPC Codes

Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell +2

For an abelian group $H$ acting on the set $[ℓ]$ , an $(H, ℓ)$ -lift of a graph $G_{0}$ is a graph obtained by replacing each vertex by $ℓ$ copies, and each edge by a matching…