244 citations · 455 across the 21 of their papers we have counts for
4 papers · 1 filter
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Adam Paetznick, Krysta M. Svore
We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance and requires significantly fewer n…
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…
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…