252 citations · 1.6k across the 32 of their papers we have counts for
6 papers · 2 filters
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…
Near-Minimal Gate Set Tomography Experiment Designs
Corey Ostrove, Kenneth Rudinger, Stefan Seritan +2
Gate set tomography (GST) provides precise, self-consistent estimates of the noise channels for all of a quantum processor's logic gates. But GST experiments are large, involving m…
Tomography of entangling two-qubit logic operations in exchange-coupled donor electron spin qubits
Holly G. Stemp, Serwan Asaad, Mark R. van Blankenstein +19
Scalable quantum processors require high-fidelity universal quantum logic operations in a manufacturable physical platform. Donors in silicon provide atomic size, excellent quantum…
Two-Qubit Gate Set Tomography with Fewer Circuits
Kenneth M. Rudinger, Corey I. Ostrove, Stefan K. Seritan +4
Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, includin…
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…
A Theory of Direct Randomized Benchmarking
Anthony M. Polloreno, Arnaud Carignan-Dugas, Jordan Hines +3
Randomized benchmarking (RB) protocols are widely used to measure an average error rate for a set of quantum logic gates. However, the standard version of RB is limited because it…