Purification of large bicolorable graph states
Quantum Physics
2007-05-23 v2
Abstract
We 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.
Keywords
Cite
@article{arxiv.quant-ph/0605228,
title = {Purification of large bicolorable graph states},
author = {Kovid Goyal and Alex McCauley and Robert Raussendorf},
journal= {arXiv preprint arXiv:quant-ph/0605228},
year = {2007}
}
Comments
12 pages, 5 figures, revtex; typos and clarifications added