11 citations · 29 across the 13 of their papers we have counts for
14 papers
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…
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…
Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry
Po-Shen Hsin, Ryohei Kobayashi, Guanyu Zhu
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logic…
SFR-GNN: Simple and Fast Robust GNNs against Structural Attacks
Xing Ai, Guanyu Zhu, Yulin Zhu +4
Graph Neural Networks (GNNs) have demonstrated commendable performance for graph-structured data. Yet, GNNs are often vulnerable to adversarial structural attacks as embedding gene…
Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials
Zlatko K. Minev, Khadijeh Najafi, Swarnadeep Majumder +5
The remarkable complexity of the vacuum state of a topologically-ordered many-body quantum system encodes the character and intricate braiding interactions of its emergent particle…
Non-Abelian Self-Correcting Quantum Memory and Transversal Non-Clifford Gate beyond the Distance Barrier
Po-Shen Hsin, Ryohei Kobayashi, Guanyu Zhu
We construct a family of infinitely many new candidate non-Abelian self-correcting topological quantum memories in spacetime dimensions without particle excitations usi…
Magic Boundaries of 3D Color Codes
Zijian Song, Guanyu Zhu
We investigate boundaries of 3D color codes and provide a systematic classification into 101 distinct boundary types, including two novel classes. The first class consists of 1 bou…
Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
Guanyu Zhu, Shehryar Sikander, Elia Portnoy +2
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant…
Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
Ryohei Kobayashi, Guanyu Zhu
We consider the toric code, surface code and Floquet code defined on a non-orientable surface, which can be considered as families of codes extending Shor's 9-qubit…