A Resilient Quantum Secret Sharing Scheme
arXiv:1501.07756v18 citations
Originality Incremental advance
AI Analysis
This addresses the need for robust quantum information distribution in quantum computing or cryptography, though it appears incremental as it builds on existing quantum error correcting codes.
The paper tackles the problem of designing a resilient quantum secret sharing scheme that can correctly generate a secret even when some shares are damaged, by exploiting quantum error correcting codes to share a quantum state among multiple parties.
A resilient secret sharing scheme is supposed to generate the secret correctly even after some shares are damaged. In this paper, we show how quantum error correcting codes can be exploited to design a resilient quantum secret sharing scheme, where a quantum state is shared among more than one parties.