Multipartite secure state distribution
arXiv:quant-ph/0411209 · doi:10.1103/PhysRevA.71.042336
Abstract
We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of two-colorable graph states (CSS codewords) can be created with high fidelity while it remains unknown to all parties. This is accomplished by either blind multipartite entanglement purification, which we introduce in this paper, or by multipartite entanglement purification of enlarged states, which offers advantages over an alternative scheme based on standard channel purification and teleportation. The parties are thus provided with a secret resource of their choice for distributed secure applications.
V2: Replaced with published version: title changed, 2 figures added, presentation improved
References in corpus (10)
- Mixed State Entanglement and Quantum Error Correction
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Quantum privacy amplification and the security of quantum cryptography over noisy channels
- Quantum repeaters based on entanglement purification
- Multi-Particle Entanglement Purification Protocols
- Entangling operations and their implementation using a small amount of entanglement
- Multiparticle entanglement purification for graph states
- Multiparticle entanglement purification for two-colorable graph states
Cited by in corpus (17)
- Entanglement purification and quantum error correction
- Open-System Dynamics of Entanglement
- On the role of memory errors in quantum repeaters
- Entanglement purification protocols for all graph states
- Open-system dynamics of graph-state entanglement
- Large-scale quantum networks based on graphs
- Graph states as ground states of many-body spin-1/2 Hamiltonians
- Quantum Router with Network Coding
- Noisy entanglement evolution for graph states
- Growth of graph states in quantum networks
- Hashing protocol for distilling multipartite CSS states
- Macroscopic bound entanglement in thermal graph states
- Stabilizer state breeding
- On the local equivalence of complete bipartite and repeater graph states
- Graph states in phase space
- Localizing genuine multiparty entanglement in noisy stabilizer states
- A solvable model for graph state decoherence dynamics