Multipartite purification protocols: upper and optimal bounds
arXiv:quant-ph/0608080 · doi:10.1103/PhysRevA.75.062307
Abstract
A method for producing an upper bound for all multipartite purification protocols is devised, based on knowing the optimal protocol for purifying bipartite states. When applied to a range of noise models, both local and correlated, the optimality of certain protocols can be demonstrated for a variety of graph and valence bond states.
15 pages, 16 figures. v3: published version
References in corpus (31)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Measurement-based quantum computation with cluster states
- Quantum privacy amplification and the security of quantum cryptography over noisy channels
- Multi-party entanglement in graph states
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Robustness of entanglement
- DMRG and periodic boundary conditions: a quantum information perspective
- Separability of very noisy mixed states and implications for NMR quantum computing
- Diverging Entanglement Length in Gapped Quantum Spin Systems
- Valence Bond Solids for Quantum Computation
- Stability of macroscopic entanglement under decoherence
- Classification of multi-qubit mixed states: separability and distillability properties
- Repeat-Until-Success Quantum Computing
- Localizable Entanglement
- Multi-Particle Entanglement Purification Protocols
- Multiparticle entanglement purification for graph states
- Long-range quantum entanglement in noisy cluster states
- Multiparticle entanglement purification for two-colorable graph states
- Entanglement in spin chains and lattices with long-range Ising-type interactions
- Quantum Anonymous Transmissions
- Efficient bipartite quantum state purification in arbitrary dimensional Hilbert spaces
- Entanglement purification protocols for all graph states
- Potential and limits to cluster state quantum computing using probabilistic gates
- The Lorentz singular value decomposition and its applications to pure states of 3 qubits
- Entanglement Purification of Any Stabilizer State
- Local unitary versus local Clifford equivalence of stabilizer and graph states
- Purification of large bicolorable graph states
- Optimal purification of thermal graph states
- Distillation Protocols for Mixed States of Multilevel Qubits and the Quantum Renormalization Group
Cited by in corpus (7)
- Open-System Dynamics of Entanglement
- Optimal Detection of Entanglement in GHZ States
- Growth of graph states in quantum networks
- A Witness of Multipartite Entanglement Strata
- Arboreal Bound Entanglement
- Atomic cluster state build up with macroscopic heralding
- Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation