Entanglement Sharing Protocol via Quantum Error Correcting Codes
arXiv:1212.4217 · doi:10.1103/PhysRevA.87.032319
Abstract
We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analogue to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two non-trivial examples based on Shor's and the stabilizer code; we further demonstrate how other examples may be obtained from quantum error correcting codes through classical encryption. Finally, we demonstrate that entanglement sharing schemes can be applied to characterize leaked information in quantum ramp secret sharing.
References in corpus (17)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Quantum secret sharing
- Distributed Entanglement
- Device-independent security of quantum cryptography against collective attacks
- How to share a quantum secret
- General Monogamy Inequality for Bipartite Qubit Entanglement
- On the Theory of Quantum Secret Sharing
- Monogamy of entanglement and other correlations
- Graph States for Quantum Secret Sharing
- Secure device-independent quantum key distribution with causally independent measurement devices
- All Maximally Entangled Four Qubits States
- Locking entanglement measures with a single qubit
- Limitations to sharing entanglement
- Quantum Secret Sharing Schemes and Reversibility of Quantum Operations
- Reducing the quantum communication cost of quantum secret sharing
- Location of quantum information in additive graph codes