Multiparticle entanglement purification for two-colorable graph states
arXiv:quant-ph/0405045 · doi:10.1103/PhysRevA.71.012319
Abstract
We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes e.g. cluster states, GHZ states and codewords of various error correction codes. The schemes include both recurrence protocols and hashing protocols. We analyze these schemes under realistic conditions and observe for a generic error model that the threshold value for imperfect local operations depends on the structure of the corresponding interaction graph, but is otherwise independent of the number of parties. The qualitative behavior can be understood from an analytically solvable model which deals only with a restricted class of errors. We compare direct multiparticle entanglement purification protocols with schemes based on bipartite entanglement purification and show that the direct multiparticle entanglement purification is more efficient and the achievable fidelity of the purified states is larger. We also show that the purification protocol allows one to produce private entanglement, an important aspect when using the produced entangled states for secure applications. Finally we discuss an experimental realization of a multiparty purification protocol in optical lattices which is issued to improve the fidelity of cluster states created in such systems.
22 pages, 8 figures; replaced with published version
References in corpus (10)
- Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
- Measurement-based quantum computation with cluster states
- Multi-party entanglement in graph states
- Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
- Coherent transport of neutral atoms in spin-dependent optical lattice potentials
- Graphical description of the action of local Clifford transformations on graph states
- Stability of macroscopic entanglement under decoherence
- Multiparticle entanglement purification for graph states
- Entanglement purification for Quantum Computation
- An efficient algorithm to recognize local Clifford equivalence of graph states
Cited by in corpus (83)
- Quantum entanglement
- Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
- Entanglement purification and quantum error correction
- Open-System Dynamics of Entanglement
- Alkaline-Earth-Metal Atoms as Few-Qubit Quantum Registers
- A quantum network stack and protocols for reliable entanglement-based networks
- Modular architectures for quantum networks
- Advances in quantum entanglement purification
- Distributing Graph States Over Arbitrary Quantum Networks
- Universal and optimal error thresholds for measurement-based entanglement purification
- Practical figures of merit and thresholds for entanglement distribution in quantum networks
- Entanglement purification protocols for all graph states
- Encoding Hypergraphs into Quantum States
- Entanglement and local information access for graph states
- Purification of genuine multipartite entanglement
- Two dimensional quantum repeaters
- Open-system dynamics of graph-state entanglement
- Distillation of multipartite entanglement by complementary stabilizer measurements
- Entanglement Purification with Double Selection
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Efficient entanglement purification protocols for d-level systems
- Entanglement Purification of Any Stabilizer State
- Multipartite entanglement measure for all discrete systems
- Transforming graph states using single-qubit operations
- Noisy entanglement evolution for graph states
- Quantum simulation of interacting high-dimensional systems: the influence of noise
- Multipartite secure state distribution
- Distributed quantum information processing with minimal local resources
- Multipartite state generation in quantum networks with optimal scaling
- Purification of large bicolorable graph states
- Optimal Detection of Entanglement in GHZ States
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation
- Error-detection-based quantum fault tolerance against discrete Pauli noise
- Growth of graph states in quantum networks
- Hashing protocol for distilling multipartite CSS states
- Quantum Repeater for W states
- Quantum entanglement in states generated by bilocal group algebras
- Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
- Optimal purification of thermal graph states
- Realizing Exactly Solvable SU(N) Magnets with Thermal Atoms
- Thresholds for the distributed surface code in the presence of memory decoherence
- Measurement based quantum communication with resource states generated by entanglement purification
- Encoding graphs into quantum states: an axiomatic approach
- Quantum communication cost of preparing multipartite entanglement
- Purification to Locally Maximally Entangleable States
- Cluster-based architecture for fault-tolerant quantum computation
- Remote entanglement preparation
- Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
- Stabilizer state breeding
- Relationship among locally maximally entanglable states, W states and hypergraph states under local unitary transformations
- An introduction to one-way quantum computing in distributed architectures
- No-Go Theorems for Universal Entanglement Purification
- Multipartite purification protocols: upper and optimal bounds
- Reducing Computational Complexity of Quantum Correlations
- Arboreal Bound Entanglement
- Effect of weak measurement on entanglement distribution over noisy channels
- Qudit hypergraph states and their properties
- Multipartite Entanglement and Hypergraph states of three qubits
- Two-colorable graph states with maximal Schmidt measure
- Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
- Certifying the purity of quantum states with temporal correlations
- On the local equivalence of complete bipartite and repeater graph states
- Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
- Graph state generation with noisy mirror-inverting spin chains
- Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Simple Proof of Security of the multiparty Prepare and Measure QKD
- Entanglement Purification of Hypergraph States
- Preserving universal resources for one-way quantum computing
- Extracting an arbitrary relative phase from a multiqubit two-component entangled state
- Improving entanglement purification through coherent superposition of roles
- On the Minimum Degree up to Local Complementation: Bounds and Complexity
- Training iterated protocols for distillation of GHZ states with variational quantum algorithms
- A modular entanglement-based quantum computer architecture
- Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement
- Entropic measure and hypergraph states
- Efficient entanglement purification based on noise guessing decoding
- Simple proof of confidentiality for private quantum channels in noisy environments
- Minimally Universal Parity Quantum Computing
- Continuous-Variable Multiplexed Quantum Repeater Networks
- Quantum state identification of qutrits via a nonlinear protocol
- State-dependent Routing Dynamics in Noisy Quantum Computing Devices
- Quantum Information Processing with Continuous Variables and Atomic Ensembles