Publications (20)
Fault-tolerant quantum computation with a neutral atom processor
Ben W. Reichardt, Adam Paetznick, David Aasen +69
Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and ha…
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…
Dequantizing read-once quantum formulas
Alessandro Cosentino, Robin Kothari, Adam Paetznick
Quantum formulas, defined by Yao [FOCS '93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once…
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…
Quantum circuit optimization by topological compaction in the surface code
Adam Paetznick, Austin G. Fowler
The fragile nature of quantum information limits our ability to construct large quantities of quantum bits suitable for quantum computing. An important goal, therefore, is to minim…
Universal fault-tolerant quantum computation with only transversal gates and error correction
Adam Paetznick, Ben W. Reichardt
Transversal implementations of encoded unitary gates are highly desirable for fault-tolerant quantum computation. Though transversal gates alone cannot be computationally universal…