Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0311136

A Quantum Information Theoretical Model for Quantum Secret Sharing Schemes

Hideki Imai, Mueller-Quade, Joern, Anderson C. A. Nascimento, Pim Tuyls, Andreas Winter

Published Nov 20, 2003• 16 citations
arXivHTMLPDF

Abstract

In this paper we introduce a quantum information theoretical model for quantum secret sharing schemes. We show that quantum information theory provides a unifying framework for the study of these schemes. We prove that the information theoretical requirements for a class of quantum secret sharing schemes reduce to only one requirement (the recoverability condition) as a consequence of the no-cloning principle. We give also a shorter proof of the fact that the size of the shares in a quantum secret sharing scheme must be at least as large as the secret itself.

DOI
10.48550/arxiv.quant-ph/0311136

Related papers

An information theoretical model for quantum secret sharing schemes

H. Imai, Joern Mueller-Quade, Anderson C. A. Nascimento +2 more

Similarly to earlier models for quantum error correcting codes, we introduce a quantum information theoretical model for quantum secret sharing schemes. This model provides new insights into the theory of quantum secret sharing. By using our model, among other results, we give a shorter proof of Gottesman's theorem that the size of the shares in a quantum secret sharing scheme must be as large as the secret itself. Also, we introduced approximate quantum secret sharing schemes and showed robustness of quantum secret sharing schemes by extending Gottesman's theorem to the approximate case.

Quantum Information and Computation•Jan 1, 2005•18 citations

Quantum secret sharing and quantum operations

Heling Xiao, Wang-Mei Guo, Xiao Wang

In this paper, we investigate the notion of quantum secret sharing (QSS) schemes based on quantum operations. We present the information theoretical model for QSS schemes using reversible operations and erase operations at first. We show that in pure state schemes, the recoverability requirement and the secrecy requirement are equivalent, which is regarded as a variant of nocloning theorem. By establishing a relation between the quantum information quantity--coherent information and QSS schemes, the upper bound of quantum information rate is given. Finally, we propose a pure state threshold scheme with the form of quantum operations. The operations formalism of quantum secret sharing generalizes the theorey of QSS, and provides a unifying framework for the study of these schemes.

•Jan 1, 2012•0 citations

An Information Theoretical Model for Quantum Secret Sharing

Hideki Imai, Jörn Müller‐Quade, Anderson C. A. Nascimento +2 more

Similarly to earlier models for quantum error correcting codes, we introduce a quantuminformation theoretical model for quantum secret sharing schemes. This model providesnew insights into the theory of quantum secret sharing. By using our model, among otherresults, we give a shorter proof of Gottesman's theorem that the size of the shares in aquantum secret sharing scheme must be as large as the secret itself. Also, we introducedapproximate quantum secret sharing schemes and showed robustness of quantum secretsharing schemes by extending Gottesman's theorem to the approximate case.

•Jan 1, 2005•13 citations

Quantum information theoretical analysis of various constructions for quantum secret sharing

Karin Rietjens, Berry Schoenmakers, Pim Tuyls

Recently, an information theoretical model for quantum secret sharing (QSS) schemes was introduced. By using this model, we prove that pure state quantum threshold schemes (QTS) can be constructed from quantum MDS codes and vice versa. In particular, we consider stabilizer codes and give a constructive proof of their relation with QTS. Furthermore, we reformulate the monotone span program (MSP) construction according to the information theoretical model and check the recoverability and secrecy requirement. Finally, we consider QSS schemes which are based on quantum teleportation

arXiv:quant-ph/0502009•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•9 citations

Theory of quantum secret sharing

Daniel Gottesman

I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum secret sharing scheme must be at least as large as the size of the secret. I show that the only constraints on the existence of quantum secret sharing schemes with general access structures are monotonicity (if a set is authorized, so are larger sets) and the no-cloning theorem. I also discuss some aspects of sharing classical secrets using quantum states. In this situation, the size of each share can sometimes be half the size of the classical secret.

arXiv:quant-ph/9910067•Physical Review A•Mar 16, 2000•618 citations

Quantum Information Theoretical Analysis of Various Constructions for Quantum Secret Sharing. (arXiv:quant-ph/0502009v1 CROSS LISTED)

Karin Rietjens, Berry Schoenmakers, Pim Tuyls

Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) can be constructed from quantum MDS codes and vice versa. In particular, we consider stabilizer codes and give a constructive proof of their relation with QTS. Furthermore, we reformulate the Monotone Span Program (MSP) construction according to the information theoretical model and check the recoverability and secrecy requirement. Finally, we consider QSS schemes which are based on quantum teleportation.

•Feb 12, 2018•0 citations
In this paper we introduce a quantum information theoretical model for quantum secret sharing schemes. We show that quantum information theory provides a unifying framework for the study of these schemes. We prove that the information theoretical requirements for a class of quantum secret sharing schemes reduce to only one requirement (the recoverability condition) as a consequence of the no-cloning principle. We give also a shorter proof of the fact that the size of the shares in a quantum secret sharing scheme must be at least as large as the secret itself.
Similarly to earlier models for quantum error correcting codes, we introduce a quantum information theoretical model for quantum secret sharing schemes. This model provides new insights into the theory of quantum secret sharing. By using our model, among other results, we give a shorter proof of Gottesman's theorem that the size of the shares in a quantum secret sharing scheme must be as large as the secret itself. Also, we introduced approximate quantum secret sharing schemes and showed robustness of quantum secret sharing schemes by extending Gottesman's theorem to the approximate case.
In this paper, we investigate the notion of quantum secret sharing (QSS) schemes based on quantum operations. We present the information theoretical model for QSS schemes using reversible operations and erase operations at first. We show that in pure state schemes, the recoverability requirement and the secrecy requirement are equivalent, which is regarded as a variant of nocloning theorem. By establishing a relation between the quantum information quantity--coherent information and QSS schemes, the upper bound of quantum information rate is given. Finally, we propose a pure state threshold scheme with the form of quantum operations. The operations formalism of quantum secret sharing generalizes the theorey of QSS, and provides a unifying framework for the study of these schemes.
Similarly to earlier models for quantum error correcting codes, we introduce a quantuminformation theoretical model for quantum secret sharing schemes. This model providesnew insights into the theory of quantum secret sharing. By using our model, among otherresults, we give a shorter proof of Gottesman's theorem that the size of the shares in aquantum secret sharing scheme must be as large as the secret itself. Also, we introducedapproximate quantum secret sharing schemes and showed robustness of quantum secretsharing schemes by extending Gottesman's theorem to the approximate case.
Recently, an information theoretical model for quantum secret sharing (QSS) schemes was introduced. By using this model, we prove that pure state quantum threshold schemes (QTS) can be constructed from quantum MDS codes and vice versa. In particular, we consider stabilizer codes and give a constructive proof of their relation with QTS. Furthermore, we reformulate the monotone span program (MSP) construction according to the information theoretical model and check the recoverability and secrecy requirement. Finally, we consider QSS schemes which are based on quantum teleportation
I present a variety of results on the theory of quantum secret sharing. I show that any mixed state quantum secret sharing scheme can be derived by discarding a share from a pure state scheme, and that the size of each share in a quantum secret sharing scheme must be at least as large as the size of the secret. I show that the only constraints on the existence of quantum secret sharing schemes with general access structures are monotonicity (if a set is authorized, so are larger sets) and the no-cloning theorem. I also discuss some aspects of sharing classical secrets using quantum states. In this situation, the size of each share can sometimes be half the size of the classical secret.
Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) can be constructed from quantum MDS codes and vice versa. In particular, we consider stabilizer codes and give a constructive proof of their relation with QTS. Furthermore, we reformulate the Monotone Span Program (MSP) construction according to the information theoretical model and check the recoverability and secrecy requirement. Finally, we consider QSS schemes which are based on quantum teleportation.