Louis Golowich

According to our database, Louis Golowich authored at least 18 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks.

Louis Golowich, Venkatesan Guruswami

CoRR, October, 2025

Constant-Overhead Addressable Gates via Single-Shot Code Switching.

Louis Golowich, Kathleen Chang, Guanyu Zhu

CoRR, October, 2025

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes.

Louis Golowich, Ting-Chun Lin

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates.

Louis Golowich, Venkatesan Guruswami

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Quantum Locally Recoverable Codes.

Louis Golowich, Venkatesan Guruswami

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Quantum LDPC Codes of Almost Linear Distance via Iterated Homological Products.

Louis Golowich, Venkatesan Guruswami

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Quantum LDPC Codes of Almost Linear Distance via Homological Products.

Louis Golowich, Venkatesan Guruswami

CoRR, 2024

Approaching the Quantum Singleton Bound with Approximate Error Correction.

Thiago Bergamaschi, Louis Golowich, Sam Gunn

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

New Explicit Constant-Degree Lossless Expanders.

Louis Golowich

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes.

Louis Golowich, Tali Kaufman

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Decoding Quasi-Cyclic Quantum LDPC Codes.

Louis Golowich, Venkatesan Guruswami

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

A New Berry-Esseen Theorem for Expander Walks.

Louis Golowich

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

From Grassmannian to Simplicial High-Dimensional Expanders.

Louis Golowich

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs.

Louis Golowich, Salil P. Vadhan

Proceedings of the 37th Computational Complexity Conference, 2022

2021

On the Computational Properties of Obviously Strategy-Proof Mechanisms.

Louis Golowich, Shengwu Li

CoRR, 2021

Improved Product-Based High-Dimensional Expanders.

Louis Golowich

Proceedings of the Approximation, 2021

2020

New classes of set-sequential trees.

Louis Golowich, Chiheon Kim

Discret. Math., 2020

2017

Maximum Size of a Family of Pairwise Graph-Different Permutations.

Louis Golowich, Chiheon Kim, Richard Zhou

Electron. J. Comb., 2017