136 citations · 1.1k across the 29 of their papers we have counts for
5 papers · 1 filter
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…
FPGA-tailored algorithms for real-time decoding of quantum LDPC codes
Satvik Maurya, Thilo Maurer, Markus Bühler +2
Real-time decoding is crucial for fault-tolerant quantum computing but likely requires specialized hardware such as field-programmable gate arrays (FPGAs), whose parallelism can al…
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…
Improved belief propagation is sufficient for real-time decoding of quantum memory
Tristan Müller, Thomas Alexander, Michael E. Beverland +4
We introduce a new heuristic decoder, Relay-BP, targeting real-time quantum circuit decoding for large-scale quantum computers. Relay-BP achieves high accuracy across circuit-noise…
Decision-tree decoders for general quantum LDPC codes
Kai R. Ott, Bence Hetényi, Michael E. Beverland
We introduce Decision Tree Decoders (DTDs), which rely only on the sparsity of the binary check matrix, making them broadly applicable for decoding any quantum low-density parity-c…