136 citations · 1.1k across the 29 of their papers we have counts for
30 papers
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…
High-performance syndrome extraction circuits for quantum codes
Armands Strikis, Dan E. Browne, Michael E. Beverland
We present a fast and effective framework for analysing and designing syndrome extraction circuits (SECs). Our approach is based on left--right circuits, a general SEC design that…
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…
Fault tolerance of stabilizer channels
Michael E. Beverland, Shilin Huang, Vadym Kliuchnikov
Stabilizer channels are stabilizer circuits that implement logical operations while mapping from an input stabilizer code to an output stabilizer code. They are widely used to impl…
Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes
Lev Stambler, Anirudh Krishna, Michael E. Beverland
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome o…
Stabilizer circuit verification
Vadym Kliuchnikov, Michael Beverland, Adam Paetznick
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits,…
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Surface code compilation via edge-disjoint paths
Michael Beverland, Vadym Kliuchnikov, Eddie Schoute
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor lo…
Constant-overhead quantum error correction with thin planar connectivity
Maxime A. Tremblay, Nicolas Delfosse, Michael E. Beverland
Quantum LDPC codes may provide a path to build low-overhead fault-tolerant quantum computers. However, as general LDPC codes lack geometric constraints, naïve layouts couple many d…
Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
Nicolas Delfosse, Michael E. Beverland, Maxime A. Tremblay
In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of gra…
Improved quantum error correction using soft information
Christopher A. Pattison, Michael E. Beverland, Marcus P. da Silva +1
The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome. In experiments, measurements yield much richer information -…
Automated Design of Pulse Sequences for Magnetic Resonance Fingerprinting using Physics-Inspired Optimization
Stephen P. Jordan, Siyuan Hu, Ignacio Rozada +9
Magnetic Resonance Fingerprinting (MRF) is a method to extract quantitative tissue properties such as T1 and T2 relaxation rates from arbitrary pulse sequences using conventional m…
Toward a Union-Find decoder for quantum LDPC codes
Nicolas Delfosse, Vivien Londe, Michael Beverland
Quantum LDPC codes are a promising direction for low overhead quantum computing. In this paper, we propose a generalization of the Union-Find decoder as adecoder for quantum LDPC c…
The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
Michael E. Beverland, Aleksander Kubica, Krysta M. Svore
Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-…
Optimization of the surface code design for Majorana-based qubits
Rui Chao, Michael E. Beverland, Nicolas Delfosse +1
The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface co…
Noncommuting conserved quantities in quantum many-body thermalization
Nicole Yunger Halpern, Michael E. Beverland, Amir Kalev
In statistical mechanics, a small system exchanges conserved quantities---heat, particles, electric charge, etc.---with a bath. The small system thermalizes to the canonical ensemb…
Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard +1
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. O…
The role of entropy in topological quantum error correction
Michael E. Beverland, Benjamin J. Brown, Michael J. Kastoryano +1
The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of…
Modeling noise and error correction for Majorana-based quantum computing
Christina Knapp, Michael Beverland, Dmitry I. Pikulin +1
Majorana-based quantum computing seeks to use the non-local nature of Majorana zero modes to store and manipulate quantum information in a topologically protected way. While noise…
Three-dimensional color code thresholds via statistical-mechanical mapping
Aleksander Kubica, Michael E. Beverland, Fernando Brandao +2
Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfe…