460 citations · 644 across the 12 of their papers we have counts for
12 papers
Randomized Benchmarking with Restricted Gate Sets
Winton G. Brown, Bryan Eastin
Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols base…
Distilling one-qubit magic states into Toffoli states
Bryan Eastin
For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates.…
Magic-state distillation with the four-qubit code
Adam M. Meier, Bryan Eastin, Emanuel Knill
The distillation of magic states is an often-cited technique for enabling universal quantum computing once the error probability for a special subset of gates has been made negligi…
Simulating Concordant Computations
Bryan Eastin
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at…
Restrictions on Transversal Encoded Quantum Gate Sets
Bryan Eastin, Emanuel Knill
Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators d…
Graphical description of Pauli measurements on stabilizer states
Matthew B. Elliott, Bryan Eastin, Carlton M. Caves
We use a graphical representation of stabilizer states to describe, simply and efficiently, the effect of measurements of Pauli products on stabilizer states. This work complements…