Multiparticle entanglement purification for graph states

Abstract

We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, GHZ states and various error correction codes all of which belong to the class of two-colorable graph states. We analyze these schemes under realistic conditions and observe that they are scalable, i.e. the threshold value for imperfect local operations does not depend on the number of parties for many of these states. When compared to schemes based on bipartite entanglement purification, the protocol is more efficient and the achievable quality of the purified states is larger. As an application we discuss an experimental realization of the protocol in optical lattices which allows one to purify cluster states.

4 pages, 2 figures; V2: some typos corrected; V3: published version

References in corpus (12)

• Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
• Mixed State Entanglement and Quantum Error Correction
• Quantum secret sharing
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Persistent entanglement in arrays of interacting particles
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• On the Improvement of Frequency Stardards with Quantum Entanglement
• Entanglement of atoms via cold controlled collisions
• Quantum repeaters based on entanglement purification
• Coherent transport of neutral atoms in spin-dependent optical lattice potentials
• Quantum error-correcting codes associated with graphs
• Multi-Particle Entanglement Purification Protocols

Cited by in corpus (125)

• Quantum entanglement
• Quantum Computing with Very Noisy Devices
• Multi-party entanglement in graph states
• Experimental entanglement of six photons in graph states
• A fault-tolerant one-way quantum computer
• Detecting Genuine Multipartite Entanglement with Two Local Measurements
• Valence Bond Solids for Quantum Computation
• Efficient polarization entanglement purification based on parametric down-conversion sources with cross-Kerr nonlinearity
• Graphical description of the action of local Clifford transformations on graph states
• Entanglement purification and quantum error correction
• Open-System Dynamics of Entanglement
• Experimental Analysis of a 4-Qubit Cluster State
• Entanglement Detection in the Stabilizer Formalism
• Bell Inequalities for Graph States
• Entanglement properties of multipartite entangled states under the influence of decoherence
• Fast simulation of stabilizer circuits using a graph state representation
• A quantum network stack and protocols for reliable entanglement-based networks
• Multiparticle entanglement purification for two-colorable graph states
• Not all pure entangled states are useful for sub shot-noise interferometry
• Quantum repeaters with imperfect memories: cost and scalability
• Advances in quantum entanglement purification
• Entanglement on mixed stabiliser states--I: Normal Forms and Reduction Procedures
• Laserless trapped-ion quantum simulations without spontaneous scattering using microtrap arrays
• 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
• Experimental one-step deterministic entanglement purification
• Computation by measurements: a unifying picture
• An efficient algorithm to recognize local Clifford equivalence of graph states
• Measurement-based Quantum Communication
• Purification of genuine multipartite entanglement
• Local unitary versus local Clifford equivalence of stabilizer states
• Two dimensional quantum repeaters
• Distillation of multipartite entanglement by complementary stabilizer measurements
• Entanglement Purification with Double Selection
• Two-setting Bell Inequalities for Graph States
• Recursive quantum repeater networks
• Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
• Large-scale quantum networks based on graphs
• Robust and parsimonious realisations of unitaries in the one-way model
• One-step preparation of cluster states in quantum dot molecules
• Multipartite entanglement measure for all discrete systems
• Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices
• Noisy entanglement evolution for graph states
• Local unitary versus local Clifford equivalence of stabilizer and graph states
• Photonic graph state generation from quantum dots and color centers for quantum communications
• Mapping graph state orbits under local complementation
• Entanglement in eight-qubit graph states
• Quantum simulation of interacting high-dimensional systems: the influence of noise
• Distributed quantum information processing with minimal local resources
• Optimal resource states for local state discrimination
• Multipartite secure state distribution
• Solutions of modular bootstrap constraints from quantum codes
• Entanglement purification for arbitrary unknown ionic states via linear optics
• Purification of large bicolorable graph states
• Efficient algorithm for multi-qudit twirling for ensemble quantum computation
• Entanglement purification by counting and locating errors with entangling measurements
• Growth of graph states in quantum networks
• Hashing protocol for distilling multipartite CSS states
• Quantum Repeater for W states
• Optimal purification of thermal graph states
• Graph States, Pivot Minor, and Universality of (X,Z)-measurements
• 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
• Finite set of invariants to characterize local Clifford equivalence of stabilizer states
• Quantum communication cost of preparing multipartite entanglement
• Purification to Locally Maximally Entangleable States
• Cluster-based architecture for fault-tolerant quantum computation
• Efficient estimation of multipartite quantum coherence
• Local invariants of stabilizer codes
• Purifying entanglement of noisy two-qubit states via entanglement swapping
• Remote entanglement preparation
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Towards Large-Scale Quantum Computation
• Phase map decompositions for unitaries
• Efficient Inner-product Algorithm for Stabilizer States
• Stabilizer state breeding
• No-Go Theorems for Universal Entanglement Purification
• Multipartite purification protocols: upper and optimal bounds
• Effect of weak measurement on entanglement distribution over noisy channels
• A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
• Reducing Computational Complexity of Quantum Correlations
• Arboreal Bound Entanglement
• Experimental anonymous quantum conferencing
• Graph Picture of Linear Quantum Networks and Entanglement
• Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
• Measurement-based infused circuits for variational quantum eigensolvers
• On the local equivalence of complete bipartite and repeater graph states
• Robust and scalable optical one-way quantum computation
• Certifying the purity of quantum states with temporal correlations
• Conference Key Agreement and Quantum Sharing of Classical Secrets with Noisy GHZ States
• Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
• Graph state generation with noisy mirror-inverting spin chains
• Collective Operations Can Exponentially Enhance Quantum State Verification
• Graph states in phase space
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Heterogeneous Multipartite Entanglement Purification for Size-Constrained Quantum Devices
• Error-correcting one-way quantum computation with global entangling gates
• Generation of 3-Dimensional graph state with Josephson charge qubits
• Simple Proof of Security of the multiparty Prepare and Measure QKD
• Extracting an arbitrary relative phase from a multiqubit two-component entangled state
• Quantum discord of states arising from graphs
• On the error analysis of quantum repeaters with encoding
• Construction of optimal resources for concatenated quantum protocols
• A modular entanglement-based quantum computer architecture
• High-efficient two-step entanglement purification using hyperentanglement
• Training iterated protocols for distillation of GHZ states with variational quantum algorithms
• Quantum Random State Generation with Predefined Entanglement Constraint
• Protocols for creating and distilling multipartite GHZ states with Bell pairs
• Designing locally maximally entangled quantum states with arbitrary local symmetries
• Recycled detection of genuine multiparty entanglement of unlimitedly stretched array of parties and arbitrarily long series of sequential observers
• Efficient entanglement purification based on noise guessing decoding
• Generating multipartite spin states with fermionic atoms in a driven optical lattice
• Learning quantum graph states with product measurements
• Minimally Universal Parity Quantum Computing
• Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances
• The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Continuous-Variable Multiplexed Quantum Repeater Networks
• Arbitrary high-dimensional entanglement purification with the superposition of paths
• Entanglement Superactivation in Multiphoton Distillation Networks
• Quantum Information Processing with Continuous Variables and Atomic Ensembles
• Integrating Entanglement Purification into All-Photonic Quantum Repeaters
• $\chi$-Colorable Graph States: Closed-Form Expressions and Quantum Orthogonal Arrays