Accessing quantum secrets via local operations and classical communication
arXiv:1305.0805 · doi:10.1103/PhysRevA.88.022340
Abstract
Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a reduced number of quantum communication channels between the players. Our scheme is based on embedding a classical linear code into a quantum error-correcting code. Our work paves the way towards the more general problem of simplifying the decoding of quantum error-correcting codes.
arXiv comment5 pages, 2 figures, replaced with the PRA published version
References in corpus (13)
- Quantum secret sharing
- Good Quantum Error-Correcting Codes Exist
- How to share a quantum secret
- Stabilizer Codes and Quantum Error Correction
- On the Theory of Quantum Secret Sharing
- Graph States for Quantum Secret Sharing
- Hiding classical data in multi-partite quantum states
- Quantum secret sharing with qudit graph states
- Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Reducing the quantum communication cost of quantum secret sharing
- Generalized Semi-Quantum Secret Sharing Schemes
- Types of quantum information
Cited by in corpus (5)
- Quantum secret sharing based on local distinguishability
- General approach to quantum channel impossibility by local operations and classical communication
- Distributed Encoding and Decoding of Quantum Information over Networks
- The construction of sets with strong quantum nonlocality using fewer states
- Quantum Access Structure and Secret Sharing