1 citations · 2 across the 2 of their papers we have counts for
8 papers
Average-Case Complexity of Quantum Stabilizer Decoding
Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba +2
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all…
Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates
Zhiyang He, Vinod Vaikuntanathan, Adam Wills +1
Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.018…
Adaptive Robustness of Hypergrid Johnson-Lindenstrauss
Andrej Bogdanov, Alon Rosen, Neekon Vafa +1
Johnson and Lindenstrauss (Contemporary Mathematics, 1984) showed that for , a scaled random projection from to is an approximate…
Quantum Codes with Addressable and Transversal Non-Clifford Gates
Zhiyang He, Vinod Vaikuntanathan, Adam Wills +1
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant pri…
Symmetric Perceptrons, Number Partitioning and Lattices
Neekon Vafa, Vinod Vaikuntanathan
The symmetric binary perceptron () problem with parameter is an average-case search problem defined as follows: given a random Gau…
Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations
Kiril Bangachev, Guy Bresler, Stefan Tiegel +1
We present a polynomial-time reduction from solving noisy linear equations over in dimension with a un…