5 citations · 8 across the 11 of their papers we have counts for
13 papers
Magic Quantum Code Surgery
Kathleen Chang, Anasuya Lyons, Yuanjie Ren +5
Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantl…
Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles
Christopher Fechisin, Kieran Cooney, Mathi Raja +4
Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pa…
A Classification of Translation-Invariant Quantum Codes in Any Dimension
Andrew Li, Dominic J. Williamson
Quantum error-correcting codes with two-dimensional translation invariance are known to be equivalent to copies of the two-dimensional toric code. Such a simple classification is n…
Translation-invariant quantum low-density parity-check codes from compactified fracton models
Cassandra M. Hopkin, Victor V. Albert, Dominic J. Williamson
Quantum error-correcting codes with translation symmetry and local checks have been studied extensively, leading to a wide variety of fracton codes in three or more dimensions whic…
Constant-depth magic state cultivation with Clifford measurements by gauging
Bence Hetényi, Benjamin J. Brown, Dominic J. Williamson
Magic states are a scarce resource for two-dimensional qubit stabilizer codes. Magic state cultivation was recently proposed to reduce the cost of magic state preparation by measur…
Parsimonious Quantum Low-Density Parity-Check Code Surgery
Andrew C. Yuan, Alexander Cowtan, Zhiyang He +2
Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logic…
Quantum Weight Reduction with Layer Codes
Andrew C. Yuan, Nouédyn Baspin, Dominic J. Williamson
Quantum weight reduction procedures ease the implementation of quantum codes by sparsifying them, resulting in low-weight checks and low-degree qubits. However, to date, only few q…
Fast magic state preparation by gauging higher-form transversal gates in parallel
Dominic J. Williamson
Magic states are a foundational resource for universal quantum computation. To survive in a realistic noisy environment, magic states must be prepared fault-tolerantly and protecte…
Dynamical quantum codes and logic gates on a lattice with sparse connectivity
Dominic J. Williamson, Bence Hetényi
We introduce several dynamical schemes that take advantage of mid-circuit measurement and nearest-neighbor gates on a lattice with maximum vertex degree three to implement topologi…
Fast and fault-tolerant logical measurements: Auxiliary hypergraphs and transversal surgery
Alexander Cowtan, Zhiyang He, Dominic J. Williamson +1
Quantum code surgery is a promising technique to perform fault-tolerant computation on quantum low-density parity-check codes. Recent developments have significantly reduced the sp…
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
Zhiyang He, Alexander Cowtan, Dominic J. Williamson +1
In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LDPC) codes have been established as promising candidates for low-overhead memory wh…
Parallel Logical Measurements via Quantum Code Surgery
Alexander Cowtan, Zhiyang He, Dominic J. Williamson +1
Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes, which generalises lattice surgery. In this work…
Low-overhead fault-tolerant quantum computation by gauging logical operators
Dominic J. Williamson, Theodore J. Yoder
Quantum computation must be performed in a fault-tolerant manner to be useful in practice. Recent progress has established quantum error-correcting codes with sparse connectivity r…