4 citations · 4 across the 1 of their papers we have counts for
6 papers · 1 filter
Improved Quantum Codes with Transversal T Gates
Adam Wills
In this work, we study quantum CSS codes with transversal gates. Here, gate transversality is meant in the strongest sense; the application of physical to every physica…
Magic State Distillation via Codes over Binary Extension Fields
Anqi Gong, Christopher A. Pattison, Patrick Rall +1
Fault-tolerant quantum computation architectures are frequently bottlenecked by the overhead of producing high-fidelity magic states. In this work, we use algebraic geometric techn…
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Adam Wills, Michael E. Beverland, Lev S. Bishop +4
Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code who…
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
Adam Wills, Theodore J. Yoder, Isaac Chuang
We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once…
Almost Linear Decoder for Optimal Geometrically Local Quantum Codes
Quinten Eggerickx, Adam Wills, Ting-Chun Lin +2
Geometrically local quantum codes, which are error correction codes embedded in with checks acting only on qubits within a fixed spatial distance, have garnered sign…
Constant-Overhead Magic State Distillation
Adam Wills, Min-Hsiu Hsieh, Hayata Yamasaki
Magic state distillation is a crucial yet resource-intensive process in fault-tolerant quantum computation. The protocol's overhead, defined as the number of input magic states req…