Unitary Reconstruction of Secret for Stabilizer Based Quantum Secret Sharing

Abstract

We propose a unitary procedure to reconstruct quantum secret for a quantum secret sharing scheme constructed from stabilizer quantum error-correcting codes. Erasure correcting procedures for stabilizer codes need to add missing shares for reconstruction of quantum secret while unitary reconstruction procedures for certain class of quantum secret sharing are known to work without adding missing shares. The proposed procedure also works without adding missing shares.

svjour3.cls, 8 pages, no figure. To be published in Quantum Information Processing

References in corpus (2)

• Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
• Quantum Strongly Secure Ramp Secret Sharing

Cited by in corpus (10)

• Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer
• Constructions of $\ell$-Adic $t$-Deletion-Correcting Quantum Codes
• Classical Access Structures of Ramp Secret Sharing Based on Quantum Stabilizer Codes
• Quantum $(r,\delta )$-locally recoverable codes
• Advance sharing of quantum shares for quantum secrets
• Quantum Stabilizer Codes Can Realize Access Structures Impossible by Classical Secret Sharing
• Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
• Measurement-free reconstruction circuit of quantum secrets in quantum secret sharing
• Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory
• Performance comparison of the two reconstruction methods for stabilizer-based quantum secret sharing