Simple proof of fault tolerance in the graph-state model

Abstract

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by invoking the threshold theorem derived for quantum circuit computation. Lower bounds for the threshold in the graph-state model are then obtained from known bounds in the circuit model under the same noise process.

6 pages, 2 figures, REVTeX4. (v4): Minor revisions and new title; published version