Simple proof of fault tolerance in the graph-state model

Simple item page
dc.creatorAliferis, Panos
dc.creatorLeung, Debbie W.
dc.date2005-03-15
dc.date2006-03-27
dc.date.accessioned2026-07-07T06:40:53Z
dc.date.available2026-07-07T06:40:53Z
dc.descriptionWe 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.
dc.description6 pages, 2 figures, REVTeX4. (v4): Minor revisions and new title; published version
dc.identifierhttps://arxiv.org/abs/quant-ph/0503130
dc.identifierhttp://arxiv.org/abs/quant-ph/0503130
dc.identifierPhys. Rev. A 73, 032308 (2006)
dc.identifierdoi:10.1103/PhysRevA.73.032308
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101519
dc.subjectQuantum Physics
dc.titleSimple proof of fault tolerance in the graph-state model
dc.typetext

Files

Collections

arXiv