activity
20172026
most citedAsymptotically Good Quantum Codes with Transversal Non-Clifford Gates

5 citations · 11 across the 12 of their papers we have counts for

collaborators
Showing quant-phShow all

11 papers · 1 filter

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2024

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…

quant-ph2024

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…

quant-ph2024★ 2 cited

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…

quant-ph2024★ 5 cited

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…

quant-ph2023

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…

quant-ph2023★ 1 cited

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…