Purification of large bicolorable graph states
arXiv:quant-ph/0605228 · doi:10.1103/PhysRevA.74.032318
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 (17)
- Mixed State Entanglement and Quantum Error Correction
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Quantum Teleportation is a Universal Computational Primitive
- Quantum repeaters based on entanglement purification
- Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
- Multiparticle entanglement purification for graph states
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- Fault-tolerant quantum computation with cluster states
- Multiparticle entanglement purification for two-colorable graph states
- Noise thresholds for optical quantum computers
- Standard forms of noisy quantum operations via depolarization
- Quantum Error Correction in Spatially Correlated Quantum Noise
- Distillation of multipartite entanglement by complementary stabilizer measurements
- Simple proof of fault tolerance in the graph-state model
- Hashing protocol for distilling multipartite CSS states
- Quantum communication cost of preparing multipartite entanglement
Cited by in corpus (24)
- Entanglement purification and quantum error correction
- Open-System Dynamics of Entanglement
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Entanglement purification protocols for all graph states
- Entanglement Purification with Double Selection
- 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
- Entanglement purification by counting and locating errors with entangling measurements
- Probabilistic growth of large entangled states with low error accumulation
- Single-qubit rotations in 2D optical lattices with multi-qubit addressing
- Thresholds for the distributed surface code in the presence of memory decoherence
- Measurement based quantum communication with resource states generated by entanglement purification
- Cluster-based architecture for fault-tolerant quantum computation
- Purification to Locally Maximally Entangleable States
- Stabilizer state breeding
- Multipartite purification protocols: upper and optimal bounds
- An introduction to one-way quantum computing in distributed architectures
- A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
- Atomic cluster state build up with macroscopic heralding
- Entangling homogeneously broadened matter qubits in the weak-coupling cavity-QED regime
- Error-correcting one-way quantum computation with global entangling gates
- Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices
- Measurement-based quantum machine learning