Louis Golowich

Orcid: 0000-0002-5169-0596

According to our database1, Louis Golowich authored at least 15 papers between 2017 and 2024.

Collaborative distances:

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
3
4
2
2
1
1
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum LDPC Codes of Almost Linear Distance via Homological Products.
CoRR, 2024

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

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates.
CoRR, 2024

Approaching the Quantum Singleton Bound with Approximate Error Correction.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Decoding Quasi-Cyclic Quantum LDPC Codes.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes.
Electron. Colloquium Comput. Complex., 2023

Quantum Locally Recoverable Codes.
Electron. Colloquium Comput. Complex., 2023

New Explicit Constant-Degree Lossless Expanders.
Electron. Colloquium Comput. Complex., 2023

From Grassmannian to Simplicial High-Dimensional Expanders.
Electron. Colloquium Comput. Complex., 2023

2022
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs.
Electron. Colloquium Comput. Complex., 2022

A New Berry-Esseen Theorem for Expander Walks.
Electron. Colloquium Comput. Complex., 2022

2021
Improved Product-Based High-Dimensional Expanders.
Electron. Colloquium Comput. Complex., 2021

On the Computational Properties of Obviously Strategy-Proof Mechanisms.
CoRR, 2021

2020
New classes of set-sequential trees.
Discret. Math., 2020

2017
Maximum Size of a Family of Pairwise Graph-Different Permutations.
Electron. J. Comb., 2017


  Loading...