5 papers
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…
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…
Fail fast: techniques to probe rare events in quantum error correction
Michael E. Beverland, Malcolm Carroll, Andrew W. Cross +1
The ultimate goal of quantum error correction is to create logical qubits with very low error rates (e.g. 1e-12) and assemble them into large-scale quantum computers capable of per…
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…
Tour de gross: A modular quantum computer based on bivariate bicycle codes
Theodore J. Yoder, Eddie Schoute, Patrick Rall +5
We present the bicycle architecture, a modular quantum computing framework based on high-rate, low-overhead quantum LDPC codes identified in prior work. For two specific bivariate…