Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published March 1, 2006 | public
Journal Article Open

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.

Additional Information

©2006 The American Physical Society (Received 12 September 2005; published 8 March 2006) We thank Michael Nielsen and Robert Raussendorf for helpful discussions on their work in this problem. P.A. and D.L. are supported by the U.S. NSF under Grant No. EIA-0086038. D.L. is also supported by the Richard Tolman Foundation and the Croucher Foundation.

Files

ALIpra06.pdf
Files (110.6 kB)
Name Size Download all
md5:e93b66e97f2cff0cd537d12088c705b6
110.6 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023