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.
No takes yet. Share an insight, caveat, or question.
Goyal et al. (2006) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: