136 citations · 1.1k across the 29 of their papers we have counts for
7 papers · 1 filter
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-…