Purification of large bicolorable graph states

Research output: Contribution to journalArticleResearchpeer review

Authors

External Research Organisations

  • California Institute of Caltech (Caltech)
  • Perimeter Institute for Theoretical Physics
View graph of relations

Details

Original languageEnglish
Article number032318
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume74
Issue number3
Publication statusPublished - 15 Sept 2006
Externally publishedYes

Abstract

We describe 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 4, tolerate 1% (3%) gate error or 20% (30%) local error.

ASJC Scopus subject areas

Cite this

Purification of large bicolorable graph states. / Goyal, Kovid; McCauley, Alex; Raussendorf, Robert.
In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 74, No. 3, 032318, 15.09.2006.

Research output: Contribution to journalArticleResearchpeer review

Goyal K, McCauley A, Raussendorf R. Purification of large bicolorable graph states. Physical Review A - Atomic, Molecular, and Optical Physics. 2006 Sept 15;74(3):032318. doi: 10.48550/arXiv.quant-ph/0605228, 10.1103/PhysRevA.74.032318
Download
@article{f5437ec21d9441709f1c9e012da6dcce,
title = "Purification of large bicolorable graph states",
abstract = "We describe 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 4, tolerate 1% (3%) gate error or 20% (30%) local error.",
author = "Kovid Goyal and Alex McCauley and Robert Raussendorf",
year = "2006",
month = sep,
day = "15",
doi = "10.48550/arXiv.quant-ph/0605228",
language = "English",
volume = "74",
journal = "Physical Review A - Atomic, Molecular, and Optical Physics",
issn = "1094-1622",
publisher = "American Physical Society",
number = "3",

}

Download

TY - JOUR

T1 - Purification of large bicolorable graph states

AU - Goyal, Kovid

AU - McCauley, Alex

AU - Raussendorf, Robert

PY - 2006/9/15

Y1 - 2006/9/15

N2 - We describe 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 4, tolerate 1% (3%) gate error or 20% (30%) local error.

AB - We describe 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 4, tolerate 1% (3%) gate error or 20% (30%) local error.

UR - http://www.scopus.com/inward/record.url?scp=33748693329&partnerID=8YFLogxK

U2 - 10.48550/arXiv.quant-ph/0605228

DO - 10.48550/arXiv.quant-ph/0605228

M3 - Article

AN - SCOPUS:33748693329

VL - 74

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1094-1622

IS - 3

M1 - 032318

ER -

By the same author(s)