Purification of large bicolorable graph states

Simple item page
dc.creatorGoyal, Kovid
dc.creatorMcCauley, Alex
dc.creatorRaussendorf, Robert
dc.date2006-05-28
dc.date2006-09-17
dc.date.accessioned2026-07-07T07:15:25Z
dc.date.available2026-07-07T07:15:25Z
dc.descriptionWe describe novel purification protocols for bicolorable graph states. The protocols scale efficiently for large graph states. We introduce a method of analysis that allows us to derive simple recursion relations characterizing their behavior as well as analytical expressions for their thresholds and fixed point behavior. We introduce two purification protocols with high threshold. They can, for graph degree four, tolerate 1% (3%) gate error or 20% (30%) local error.
dc.description12 pages, 5 figures, revtex; typos and clarifications added
dc.identifierhttps://arxiv.org/abs/quant-ph/0605228
dc.identifierhttp://arxiv.org/abs/quant-ph/0605228
dc.identifierPhys. Rev. A 74, 032318 (2006)
dc.identifierdoi:10.1103/PhysRevA.74.032318
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113252
dc.subjectQuantum Physics
dc.titlePurification of large bicolorable graph states
dc.typetext

Files

Collections

arXiv