67 citations · 103 across the 4 of their papers we have counts for
10 papers · 1 filter
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…
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…
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 -…
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-…