CaltechAUTHORS
  A Caltech Library Service

Simple proof of fault tolerance in the graph-state model

Aliferis, Pannos and Leung, Debbie W. (2006) Simple proof of fault tolerance in the graph-state model. Physical Review A, 73 (3). Art. No. 032308. ISSN 1050-2947. doi:10.1103/PhysRevA.73.032308. https://resolver.caltech.edu/CaltechAUTHORS:ALIpra06

[img]
Preview
PDF
See Usage Policy.

110kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:ALIpra06

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1103/PhysRevA.73.032308DOIUNSPECIFIED
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.
Subject Keywords:quantum computing; quantum noise; graph theory
Issue or Number:3
DOI:10.1103/PhysRevA.73.032308
Record Number:CaltechAUTHORS:ALIpra06
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:ALIpra06
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3222
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:23 May 2006
Last Modified:08 Nov 2021 19:54

Repository Staff Only: item control page