arXiv subjects

Bryan Eastin

Publications and source records attributed to Bryan Eastin.

12 recordsLinked to original sources

arXiv2018

Randomized Benchmarking with Restricted Gate Sets

Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2 designs. We introduce a general method for analyzing such protocols and subsequently apply it to two subgroups, the group generated by controlled-NOT, Hadamard, and Pauli gates and that generated by only controlled-NOT and Pauli gates. In both cases the error probability can be estimated to within a factor of two or less where the factor can be arranged to be conservative and to decay exponentially in the number of qubits. For randomized benchmarking of logical qubits even better accuracy will typically be obtained. Thus, we show that sampling a distribution which is close to a unitary 2 design, although sufficient, is not necessary for randomized benchmarking to high accuracy.

quant-ph↗

arXiv2013

Distilling one-qubit magic states into Toffoli states

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. I show that the overhead for magic-state distillation can be reduced by merging distillation with the implementation of Toffoli gates. The resulting routine distills 8 one-qubit magic states directly to a Toffoli state, which can be used without further magic to perform a Toffoli gate.

quant-ph↗

arXiv2012

Magic-state distillation with the four-qubit code

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 negligible by other means. We present a routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest. Each iteration of the routine uses a four-qubit error-detecting code to distill the +1 eigenstate of the Hadamard gate at a cost of ten input states per two improved output states. Use of this routine in combination with the 15-to-1 distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.

quant-ph↗

arXiv2010

Simulating Concordant Computations

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 each time step, is concordant. In this paper, I describe a classical algorithm that, given a product state as input, permits the efficient simulation of any concordant quantum computation having a conventional form and composed of gates acting on two or fewer qubits. This shows that such a quantum computation must generate quantum discord if it is to efficiently solve a problem that requires super-polynomial time classically. While I employ the restriction to two-qubit gates sparingly, a crucial component of the simulation algorithm appears not to be extensible to gates acting on higher-dimensional systems.

quant-ph↗

arXiv2009

Restrictions on Transversal Encoded Quantum Gate Sets

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 do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.

quant-ph↗

arXiv2008

Graphical description of Pauli measurements on stabilizer states

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 our earlier work [Phys. Rev. A 77, 042307 (2008)], which described in graphical terms the action of Clifford operations on stabilizer states.

quant-ph↗

arXiv2007

Error Channels and the Threshold for Fault-tolerant Quantum Computation

This dissertation treats the topics of threshold calculation, ancilla construction, and non-standard error models. Chapter 2 introduces background material ranging from quantum mechanics to classical coding to thresholds for quantum computation. In Chapter 3 numerical and analytical means are used to generate estimates of and bounds on the threshold given an error model described by a restricted stochastic Pauli channel. Chapter 4 develops a simple, flexible means of estimating the threshold and applies it to some cases of interest. Finally, a novel method of ancilla construction is proposed in Chapter 5, and the difficulties associated with implementing it are discussed.

quant-ph↗

arXiv2007

Graphical description of the action of Clifford operators on stabilizer states

We introduce a graphical representation of stabilizer states and translate the action of Clifford operators on stabilizer states into graph operations on the corresponding stabilizer-state graphs. Our stabilizer graphs are constructed of solid and hollow nodes, with (undirected) edges between nodes and with loops and signs attached to individual nodes. We find that local Clifford transformations are completely described in terms of local complementation on nodes and along edges, loop complementation, and change of node type or sign. Additionally, we show that a small set of equivalence rules generates all graphs corresponding to a given stabilizer state; we do this by constructing an efficient procedure for testing the equality of any two stabilizer graphs.

quant-ph↗

arXiv2006

Fault-Tolerant Thresholds for Encoded Ancillae with Homogeneous Errors

I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are determined via a simple counting argument performed on a single qubit of an infinitely large CSS code. I give concrete examples of thresholds thus achievable for both Steane and Knill style fault-tolerant implementations and investigate their relation to threshold estimates in the literature.

quant-ph↗

arXiv2006

Modeling Pauli measurements on graph states with nearest-neighbor classical communication

We propose a communication-assisted local-hidden-variable model that yields the correct outcome for the measurement of any product of Pauli operators on an arbitrary graph state, i.e., that yields the correct global correlation among the individual measurements in the Pauli product. Within this model, communication is restricted to a single round of message passing between adjacent nodes of the graph. We show that any model sharing some general properties with our own is incapable, for at least some graph states, of reproducing the expected correlations among all subsets of the individual measurements. The ability to reproduce all such correlations is found to depend on both the communication distance and the symmetries of the communication protocol.

quant-ph↗

arXiv2005

Optimal classical-communication-assisted local model of n-qubit Greenberger-Horne-Zeilinger correlations

We present a model, motivated by the criterion of reality put forward by Einstein, Podolsky, and Rosen and supplemented by classical communication, which correctly reproduces the quantum-mechanical predictions for measurements of all products of Pauli operators on an n-qubit GHZ state (or ``cat state''). The n-2 bits employed by our model are shown to be optimal for the allowed set of measurements, demonstrating that the required communication overhead scales linearly with n. We formulate a connection between the generation of the local values utilized by our model and the stabilizer formalism, which leads us to conjecture that a generalization of this method will shed light on the content of the Gottesman-Knill theorem.

quant-ph↗

arXiv2004

Q-circuit Tutorial

Q-circuit is a list of macros that greatly simplifies the construction of quantum circuit diagrams (QCDs) in LaTeX with the help of the Xy-pic package. This tutorial should help the reader acquire the skill to render arbitrary QCDs in a matter of minutes. Q-circuit is available for free at http://info.phys.unm.edu/Qcircuit/.

quant-ph↗