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

Chinese Physics Letters

Quantum Information Theoretical Analysis of Quantum Secret Sharing

Heling Xiao, Wang-Mei Guo, Xiao Wang

Published Nov 1, 2012• 1 citation
Publisher

Abstract

Quantum secret sharing (QSS) schemes are analyzed from an information theoretical perspective centered on the Araki—Lieb inequality. Based on this inequality, mathematical characterizations of QSS schemes and quantum error-correcting codes (QECCs) are given. Furthermore, we present a proof of the relation between QSS schemes and QECCs. This information theoretic description of QSS schemes is used to derive the quantum Singleton bound.

DOI
10.1088/0256-307x/29/11/110301

Related papers

Quantum secret sharing based on quantum error-correcting codes

Zu-Rong Zhang, Wei-Tao Liu, Cheng-Zu Li

Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2 k − 1, 1, k ] quantum error-correcting code (QECC) to implement a quantum ( k , 2 k − 1) threshold scheme. It also takes advantage of classical enhancement of the [2 k − 1, 1, k ] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.

Chinese Physics B•May 1, 2011•23 citations

Quantum Secret Sharing Rates

Gabrielle Lalou, Husein Natur, Uzi Pereg

This paper studies the capacity limits for quantum secret sharing (QSS). The goal of a QSS scheme is to distribute a quantum secret among multiple participants, such that only authorized parties can recover it through collaboration, while no information can be obtained without such collaboration. We introduce an information-theoretic model for the rate analysis of QSS and its relation to compound quantum channels, following a similar approach as of Zou et al. (2015) on classical secret sharing. We establish a regularized characterization for the QSS capacity, and determine the capacity for QSS with dephasing noise.

quant-pharXiv:2512.22049•IEEE International Symposium on Information Theory (ISIT)•Dec 29, 2025•1 citation

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

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•19 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

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•15 citations
Quantum secret sharing (QSS) schemes are analyzed from an information theoretical perspective centered on the Araki—Lieb inequality. Based on this inequality, mathematical characterizations of QSS schemes and quantum error-correcting codes (QECCs) are given. Furthermore, we present a proof of the relation between QSS schemes and QECCs. This information theoretic description of QSS schemes is used to derive the quantum Singleton bound.
Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2 k − 1, 1, k ] quantum error-correcting code (QECC) to implement a quantum ( k , 2 k − 1) threshold scheme. It also takes advantage of classical enhancement of the [2 k − 1, 1, k ] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
This paper studies the capacity limits for quantum secret sharing (QSS). The goal of a QSS scheme is to distribute a quantum secret among multiple participants, such that only authorized parties can recover it through collaboration, while no information can be obtained without such collaboration. We introduce an information-theoretic model for the rate analysis of QSS and its relation to compound quantum channels, following a similar approach as of Zou et al. (2015) on classical secret sharing. We establish a regularized characterization for the QSS capacity, and determine the capacity for QSS with dephasing noise.
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
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.
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.
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.