Noise Thresholds for Amplification: From Quantum Foundations to Classical Fault-Tolerant Computation. - Noah Shutty; Mary Wootters; Patrick Hayden (CoRR, 2018)

Explicit Bounds from the Alon-Boppana Theorem. - Joseph Richey; Noah Shutty; Matthew Stover (Exp. Math., 2018)

Tight Limits on Nonlocality from Nontrivial Communication Complexity; a.k.a. Reliable Computation with Asymmetric Gate Noise. - Noah Shutty; Mary Wootters; Patrick Hayden (FOCS, 2020)

Learning Irreducible Representations of Noncommutative Lie Groups. - Noah Shutty; Casimir Wierzynski (CoRR, 2020)

Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data. - Noah Shutty; Mary Wootters (ITCS, 2022)

Computing representations for Lie algebraic networks. - Noah Shutty; Casimir Wierzynski (NeurReps, 2022)

Finding fault-tolerant Clifford circuits using SMT solvers. - Noah Shutty; Christopher Chamberland (CoRR, 2022)

Repairing Reed-Solomon Codes Over Prime Fields via Exponential Sums. - Roni Con; Noah Shutty; Itzhak Tamo; Mary Wootters (IEEE Trans. Inf. Theory, 2024)