5 citations · 11 across the 12 of their papers we have counts for
15 papers
Constant-Overhead Injection into Quantum Codes
Louis Golowich, Venkatesan Guruswami
We construct the first known fault-tolerant scheme for injecting states into quantum error-correcting codes with constant space and time overhead. That is, we construct a family of…
Improved Transversal Non-Clifford Gates from Cup Products
Louis Golowich, Itzhak Tamo, Guanyu Zhu
It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stab…
Fault-Tolerant Quantum Computation with Adversarial Errors
Nikolas P. Breuckmann, Louis Golowich, Umesh Vazirani
We prove a fault-tolerance theorem for quantum computation against adversarial noise. For every quantum circuit on logical qudits of depth , we construct a fault…
Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks
Louis Golowich, Venkatesan Guruswami
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we…
Constant-Overhead Addressable Gates via Single-Shot Code Switching
Louis Golowich, Kathleen Chang, Guanyu Zhu
It is a major challenge to perform addressable and parallel logical operations on constant-rate quantum LDPC (qLDPC) codes. Indeed, the overhead of targeting specific logical qubit…
Decoding Quasi-Cyclic Quantum LDPC Codes
Louis Golowich, Venkatesan Guruswami
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to constructions…
Quantum LDPC Codes of Almost Linear Distance via Homological Products
Louis Golowich, Venkatesan Guruswami
We present new constructions of quantum codes of linear or close-to-linear distance and dimension with low-weight stabilizers. Only a few constructions of such codes were previousl…
Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
Louis Golowich, Ting-Chun Lin
For every integer and every , we construct an explicit infinite family of quantum LDPC codes supporting a transversal gate with length , dimension $K\g…
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
Louis Golowich, Venkatesan Guruswami
We construct quantum codes that support transversal gates over qudits of arbitrary prime power dimension (including ) such that the code dimension and distance grow…
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes
Louis Golowich, Tali Kaufman
Recent constructions of the first asymptotically good quantum LDPC (qLDPC) codes led to two breakthroughs in complexity theory: the NLTS (No Low-Energy Trivial States) theorem (Ans…
Quantum Locally Recoverable Codes
Louis Golowich, Venkatesan Guruswami
Classical locally recoverable codes, which permit highly efficient recovery from localized errors as well as global recovery from larger errors, provide some of the most useful cod…
A New Berry-Esseen Theorem for Expander Walks
Louis Golowich
We prove that the sum of boolean-valued random variables sampled by a random walk on a regular expander converges in total variation distance to a discrete normal distribution…
On the Computational Properties of Obviously Strategy-Proof Mechanisms
Louis Golowich, Shengwu Li
We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.
New Classes of Set-Sequential Trees
Louis Golowich, Chiheon Kim
A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in such that when each edge is labeled with the sum of its…
Maximum Size of a Family of Pairwise Graph-Different Permutations
Louis Golowich, Chiheon Kim, Richard Zhou
Two permutations of the vertices of a graph are called -different if there exists an index such that -th entry of the two permutations form an edge in . We bound o…