315 citations · 2.1k across the 42 of their papers we have counts for
42 papers
A gauge-invariant theory of small Markovian errors in quantum gate sets
Juan Gonzalez De Mendoza, Corey Ostrove, Timothy Proctor +3
Noisy logic operations on a quantum computational register -- e.g., one or more qubits -- can be described by transfer matrices (a.k.a. CPTP maps or superoperators) that act linear…
The Road to Useful Quantum Computers
Timothy Proctor, Robin Blume-Kohout, Andrew Baczewski
Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin…
A simple asymptotically optimal Clifford circuit compilation algorithm
Timothy Proctor, Kevin Young
We present an algorithm that decomposes any -qubit Clifford operator into a circuit consisting of three subcircuits containing only CNOT or CPHASE gates with layers of one-qubit…
Fully scalable randomized benchmarking without motion reversal
Jordan Hines, Daniel Hothem, Robin Blume-Kohout +2
We introduce binary randomized benchmarking (BiRB), a protocol that streamlines traditional RB by using circuits consisting almost entirely of i.i.d. layers of gates. BiRB reliably…
Predictive Models from Quantum Computer Benchmarks
Daniel Hothem, Jordan Hines, Karthik Nataraj +2
Holistic benchmarks for quantum computers are essential for testing and summarizing the performance of quantum hardware. However, holistic benchmarks -- such as algorithmic or rand…
Learning a quantum computer's capability
Daniel Hothem, Kevin Young, Tommie Catanach +1
Accurately predicting a quantum computer's capability -- which circuits it can run and how well it can run them -- is a foundational goal of quantum characterization and benchmarki…