Purification of large bicolorable graph states

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.

12 pages, 5 figures, revtex; typos and clarifications added

References in corpus (3)

• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Distillation of multipartite entanglement by complementary stabilizer measurements
• Simple proof of fault tolerance in the graph-state model

Cited by in corpus (11)

• Entanglement purification and quantum error correction
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Entanglement purification protocols for all graph states
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
• Distributed quantum information processing with minimal local resources
• Growth of graph states in quantum networks
• Purification to Locally Maximally Entangleable States
• Multipartite purification protocols: upper and optimal bounds
• Atomic cluster state build up with macroscopic heralding
• A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
• Error-correcting one-way quantum computation with global entangling gates