1 citations · 1 across the 5 of their papers we have counts for
13 papers
Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
Kathleen Chang, Zhiyang He, Theodore J. Yoder +2
Generalized code surgery is a versatile and low-overhead technique for performing fault-tolerant computation on quantum low-density parity-check (qLDPC) codes. In many settings, su…
Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes
Guanyu Zhu, Ryohei Kobayashi, Po-Shen Hsin
A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely…
Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic
Ryohei Kobayashi, Guanyu Zhu, Po-Shen Hsin
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for -dimensional t…
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…
Transversal non-Clifford gates on qLDPC codes breaking the distance barrier and quantum-inspired geometry with systolic freedom
Guanyu Zhu
Historically, a distance barrier for quantum low-density parity-check (LDPC) codes with qubits persisted for nearly two decades, until the recent discove…
A topological theory for qLDPC: non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the distance barrier
Guanyu Zhu
We develop a topological theory for fault-tolerant quantum computation in quantum low-density parity-check (qLDPC) codes. We show that there exist hidden simplicial or CW complex s…