57 citations · 161 across the 44 of their papers we have counts for
69 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 …
Time- and Space-Efficient List Decoding up to Capacity
Dorsa Fathollahi, Noga Ron-Zewi, Mary Wootters
In the theory of error correcting codes, list-decoding refers to the following problem. Given a code and a received word , find all codewords …
Locality of Curve-Decoding and Improved Proximity Gaps
Rohan Goyal, Venkatesan Guruswami, Yihang Sun +1
Proximity gaps are a property of error correcting codes that arise in the study of Interactive Oracle Proofs (IOPs) and Succinct Non-interactive Arguments of Zero Knowledge (SNARKs…
On Worst-Case Optimal Polynomial Intersection
Yihang Sun, Mary Wootters
The Optimal Polynomial Intersection (OPI) problem is the following: Given sets and evaluation points , find…
Improved Bounds on Access-Redundancy Tradeoffs in Quantized Linear Computations
Ching-Fang Li, Mary Wootters
Consider the problem of computing quantized linear functions with only a few queries. Formally, given , our goal is to encode as $\mathbf{c…
Limitations to Computing Quadratic Functions on Reed-Solomon Encoded Data
Keller Blackwell, Mary Wootters
We study the problem of low-bandwidth non-linear computation on Reed-Solomon encoded data. Given an Reed-Solomon encoding of a message vector $\mathbf{f} \in \mathbb{F}_q^k…