Michael E. Beverland
YOU?
Author Swipe
View article: Improved belief propagation is sufficient for real-time decoding of quantum memory
Improved belief propagation is sufficient for real-time decoding of quantum memory Open
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 decoding problems: significantly outperforming BP+OSD+CS-1…
View article: Decision-tree decoders for general quantum LDPC codes
Decision-tree decoders for general quantum LDPC codes Open
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-check (qLDPC) code and fault-tolerant quantum circuits. DTDs…
View article: Fault tolerance of stabilizer channels
Fault tolerance of stabilizer channels Open
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 implement fault tolerant error correction and logical operation…
View article: Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes
Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes Open
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 of errors.Hypergraph product codes are a promising family of…
View article: Stabilizer circuit verification
Stabilizer circuit verification Open
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, which aims to replicate their behavior using a classical co…
View article: Assessing requirements to scale to practical quantum advantage
Assessing requirements to scale to practical quantum advantage Open
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale quantum machine. Understanding the impact of …
View article: Constant-Overhead Quantum Error Correction with Thin Planar Connectivity
Constant-Overhead Quantum Error Correction with Thin Planar Connectivity Open
Quantum low density parity check (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 distant qubits with crossing conn…
View article: Surface Code Compilation via Edge-Disjoint Paths
Surface Code Compilation via Edge-Disjoint Paths Open
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a two-dimensional grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit’s…
View article: Toward a Union-Find Decoder for Quantum LDPC Codes
Toward a Union-Find Decoder for Quantum LDPC Codes Open
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 codes. We prove that this decoder corrects all errors with w…
View article: Automated design of pulse sequences for magnetic resonance fingerprinting using physics-inspired optimization
Automated design of pulse sequences for magnetic resonance fingerprinting using physics-inspired optimization Open
Significance Magnetic resonance is a widely used noninvasive medical imaging technology. Most clinical MRI scans generate qualitative or “weighted” images. A recent new technology, magnetic resonance fingerprinting (MRF), simultaneously ex…
View article: Constant-overhead quantum error correction with thin planar connectivity
Constant-overhead quantum error correction with thin planar connectivity Open
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 distant qubits with crossing connections which could be hard…
View article: Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes Open
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 graphs: the Tanner graph of the set of measured Pauli operator…
View article: Improved quantum error correction using soft information
Improved quantum error correction using soft information Open
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 - e.g., continuous current values, discrete photon counts - …
View article: Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes
Cost of Universality: A Comparative Study of the Overhead of State Distillation and Code Switching with Color Codes Open
Estimating and reducing the overhead of fault tolerance (FT) schemes is a\ncrucial step toward realizing scalable quantum computers. Of particular\ninterest are schemes based on two-dimensional (2D) topological codes such as\nthe surface a…
View article: Optimization of the surface code design for Majorana-based qubits
Optimization of the surface code design for Majorana-based qubits Open
The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT gat…
View article: Noncommuting conserved charges in quantum many-body thermalization
Noncommuting conserved charges in quantum many-body thermalization Open
In statistical mechanics, a small system exchanges conserved quantities-heat, particles, electric charge, etc.-with a bath. The small system thermalizes to the canonical ensemble or the grand canonical ensemble, etc., depending on the quan…
View article: Lower bounds on the non-Clifford resources for quantum computations
Lower bounds on the non-Clifford resources for quantum computations Open
Treating stabilizer operations as free, we establish lower bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks. Our bounds apply to adaptive computations using measurements…
View article: Three-Dimensional Color Code Thresholds via Statistical-Mechanical Mapping
Three-Dimensional Color Code Thresholds via Statistical-Mechanical Mapping Open
Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfect measurement of error syndromes. Here we investigate the …
View article: Spectrum Estimation of Density Operators with Alkaline-Earth Atoms
Spectrum Estimation of Density Operators with Alkaline-Earth Atoms Open
We show that Ramsey spectroscopy of fermionic alkaline-earth atoms in a square-well trap provides an efficient and accurate estimate for the eigenspectrum of a density matrix whose n copies are stored in the nuclear spins of n such atoms. …
View article: Protected gates for topological quantum field theories
Protected gates for topological quantum field theories Open
We study restrictions on locality-preserving unitary logical gates for topological quantum codes in two spatial dimensions. A locality-preserving operation is one which maps local operators to local operators — for example, a constant-dept…
View article: Universal transversal gates with color codes: A simplified approach
Universal transversal gates with color codes: A simplified approach Open
We provide a simplified yet rigorous presentation of the ideas from Bombín's paper (arXiv:1311.0879v3). Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide an explicit construction …