11 citations · 20 across the 6 of their papers we have counts for
6 papers
Advances in compilation for quantum hardware -- A demonstration of magic state distillation and repeat-until-success protocols
Natalie C. Brown, John Peter Campora, Cassandra Granade +8
Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a feed-forward processing of data, enabled by a hybrid of quantum and classical lo…
Splitting decoders for correcting hypergraph faults
Nicolas Delfosse, Adam Paetznick, Jeongwan Haah +1
The surface code is one of the most popular quantum error correction codes. It comes with efficient decoders, such as the Minimum Weight Perfect Matching (MWPM) decoder and the Uni…
Simulation of noisy Clifford circuits without fault propagation
Nicolas Delfosse, Adam Paetznick
The design and optimization of a large-scale fault-tolerant quantum computer architecture relies extensively on numerical simulations to assess the performance of each component of…
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,…
Spacetime codes of Clifford circuits
Nicolas Delfosse, Adam Paetznick
We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Cliffo…
Resource optimization for fault-tolerant quantum computing
Adam Paetznick
In this thesis we examine a variety of techniques for reducing the resources required for fault-tolerant quantum computation. First, we show how to simplify universal encoded compu…