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:1202.3433 · Physical Review A

Nonthreshold quantum secret-sharing schemes in the graph-state formalism

Pradeep Kiran Sarvepalli

Published Oct 1, 2012• 52 citations
arXivHTMLPDF

Abstract

In a recent work, Markham and Sanders proposed a framework to study quantum secret-sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, previous work on graph-state secret sharing mostly focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph-state formalism. We show an equivalence between $[[n,1]]$ binary quantum codes and graph-state secret-sharing schemes sharing one bit. We also establish a similar (but restricted) equivalence between a class of $[[n,1]]$ Calderbank-Shor-Steane codes and graph-state QSS schemes sharing one qubit. With these results we are able to construct a large class of graph-state quantum secret-sharing schemes with arbitrary access structures.

DOI
10.1103/physreva.86.042303

Related papers

Graph states for quantum secret sharing

Damian Markham, Barry C. Sanders

We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum-information processing system.

arXiv:0808.1532•Physical Review A•Oct 10, 2008•473 citations

Computational Quantum Secret Sharing

Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang +1 more

Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over twenty years ago, previous works focused only on existence of perfectly secure schemes, and the share size of the known schemes is exponential even for access structures computed by polynomial size monotone circuits. This stands in contrast to the classical case, where efficient computationally-secure schemes have been long known for all access structures in $\mathsf{monotone~P}$, and one can even obtain shares which are much shorter than the secret which is impossible with perfect security. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time QSS schemes under standard assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS required exponential share size. We also construct QSS schemes for which the size of the shares is significantly smaller than the size of the secret. As in the classical case, this is impossible with perfect security. We also use our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of access structures to $1.5^{n+o(n)}$, improving upon best known schemes and matching the best known result for general access structures in the classical case. Finally, we show construct efficient schemes for all access structures in $\mathsf{P}$ and $\mathsf{NP}$ when the quantum secret sharing scheme is given multiple of copies of the secret.

arXiv:2305.00356•Leibniz international proceedings in informatics•Jan 1, 2023•6 citations

Quantum secret sharing with qudit graph states

Adrian Keet, Ben Fortescue, Damian Markham +1 more

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

arXiv:1004.4619•Physical Review A•Dec 14, 2010•175 citations

Sharing classical secrets with Calderbank-Shor-Steane codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker

In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error-correcting code, the converse is not true. Motivated by this we sought to find quantum codes which can be converted to secret sharing schemes. If we are interested in sharing classical secrets using quantum information, then we show that a class of pure ${[[n,1,d]]}_{q}$ Calderbank-Shor-Steane (CSS) codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense that the unauthorized parties do not learn anything about the secret. Gottesman had given conditions to test whether a given subset is an authorized or unauthorized set; they enable us to determine the access structure of quantum secret sharing schemes. For the secret sharing schemes proposed in this paper the access structure can be characterized in terms of minimal codewords of the classical code underlying the CSS code. This characterization of the access structure for quantum secret sharing schemes is thought to be notable.

arXiv:0905.1661•Physical Review A•Aug 18, 2009•46 citations

Quantum Secret Sharing and Error Correction vs No-Cloning

Steven Chien, Ishani Mukherjee, Mark Zhandry

Secret sharing is ubiquitous throughout cryptography. All possible access structures are classically feasible, and in the case of threshold access structures, the protocols are even very efficient. However, when moving to the quantum setting, the no-cloning theorem shows that many access structures are impossible. In fact, no-cloning exactly characterizes feasibility: for thresholds, quantum secret sharing is possible if and only if the threshold $t$ is strictly more than $n/2$. In this work, we propose a variant of quantum secret sharing (QSS) where two or more identical copies of the input state are provided, but the output is only required to recover one copy. This notion circumvents the simple one-copy no-cloning obstruction, though the natural $k$-copy generalization still gives much milder obstructions. For thresholds using $k$ copies, no-cloning implies that QSS is impossible whenever $t\leq n/(k+1)$. It is tempting to hypothesize that no-cloning continues to exactly characterize the many-copy case. However, we show that this is not the case. We give positive results showing that multiple copies allow for going slightly beyond the single-copy obstruction: for thresholds, we construct QSS whenever $t>(n-k+1)/2$. On the other hand, we give a novel obstruction we call the Clique Path obstruction, which applies to arbitrary access structures. For thresholds, it shows that QSS is impossible whenever $t\leq (n-1)/k$. Our upper and lower bounds exactly match for $k=2$. Both our results leverage connections to the $k$-colorability of certain graphs derived from the access structure. We leave closing the gap for $k\geq 3$ copies as a fascinating direction for future work. Secret sharing is closely related to error correction, which can also be considered in the many-copy setting. Our results imply similar obstructions for quantum error correction for erasure channels.

quant-pharXiv:2610.00441•Oct 1, 2026•0 citations

Equivalence between sharing quantum and classical secrets and error correction

Anne Marin, Damian Markham

We present a general scheme for sharing quantum secrets, and an extension to sharing classical secrets, which contain all known quantum-secret-sharing schemes. In this framework, we show the equivalence of existence of both schemes, that is, the existence of a scheme sharing a quantum secret implies that the extended classical-secret-sharing scheme works, and vice versa. As a consequence of this, we find schemes sharing classical secrets for arbitrary access structures. We then clarify the relationship to quantum error correction and observe several restrictions thereby imposed, which for example indicates that for pure-state threshold schemes the share size $q$ must scale with the number of players $n$ as $q\ensuremath{\ge}\sqrt{n}$. These results also provide a way of searching for quantum-error-correcting codes.

arXiv:1205.4182•Physical Review A•Oct 25, 2013•34 citations
In a recent work, Markham and Sanders proposed a framework to study quantum secret-sharing (QSS) schemes using graph states. This framework unified three classes of QSS protocols, namely, sharing classical secrets over private and public channels, and sharing quantum secrets. However, previous work on graph-state secret sharing mostly focused on threshold schemes. In this paper, we focus on general access structures. We show how to realize a large class of arbitrary access structures using the graph-state formalism. We show an equivalence between [[n,1]][[n,1]][[n,1]] binary quantum codes and graph-state secret-sharing schemes sharing one bit. We also establish a similar (but restricted) equivalence between a class of [[n,1]][[n,1]][[n,1]] Calderbank-Shor-Steane codes and graph-state QSS schemes sharing one qubit. With these results we are able to construct a large class of graph-state quantum secret-sharing schemes with arbitrary access structures.
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum-information processing system.
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over twenty years ago, previous works focused only on existence of perfectly secure schemes, and the share size of the known schemes is exponential even for access structures computed by polynomial size monotone circuits. This stands in contrast to the classical case, where efficient computationally-secure schemes have been long known for all access structures in monotone P\mathsf{monotone~P}monotone P, and one can even obtain shares which are much shorter than the secret which is impossible with perfect security. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time QSS schemes under standard assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS required exponential share size. We also construct QSS schemes for which the size of the shares is significantly smaller than the size of the secret. As in the classical case, this is impossible with perfect security. We also use our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of access structures to 1.5n+o(n)1.5^{n+o(n)}1.5n+o(n), improving upon best known schemes and matching the best known result for general access structures in the classical case. Finally, we show construct efficient schemes for all access structures in P\mathsf{P}P and NP\mathsf{NP}NP when the quantum secret sharing scheme is given multiple of copies of the secret.
In this paper we investigate the use of quantum information to share classical secrets. While every quantum secret sharing scheme is a quantum error-correcting code, the converse is not true. Motivated by this we sought to find quantum codes which can be converted to secret sharing schemes. If we are interested in sharing classical secrets using quantum information, then we show that a class of pure [[n,1,d]]q{[[n,1,d]]}_{q}[[n,1,d]]q​ Calderbank-Shor-Steane (CSS) codes can be converted to perfect secret sharing schemes. These secret sharing schemes are perfect in the sense that the unauthorized parties do not learn anything about the secret. Gottesman had given conditions to test whether a given subset is an authorized or unauthorized set; they enable us to determine the access structure of quantum secret sharing schemes. For the secret sharing schemes proposed in this paper the access structure can be characterized in terms of minimal codewords of the classical code underlying the CSS code. This characterization of the access structure for quantum secret sharing schemes is thought to be notable.
Secret sharing is ubiquitous throughout cryptography. All possible access structures are classically feasible, and in the case of threshold access structures, the protocols are even very efficient. However, when moving to the quantum setting, the no-cloning theorem shows that many access structures are impossible. In fact, no-cloning exactly characterizes feasibility: for thresholds, quantum secret sharing is possible if and only if the threshold ttt is strictly more than n/2n/2n/2. In this work, we propose a variant of quantum secret sharing (QSS) where two or more identical copies of the input state are provided, but the output is only required to recover one copy. This notion circumvents the simple one-copy no-cloning obstruction, though the natural kkk-copy generalization still gives much milder obstructions. For thresholds using kkk copies, no-cloning implies that QSS is impossible whenever t≤n/(k+1)t\leq n/(k+1)t≤n/(k+1). It is tempting to hypothesize that no-cloning continues to exactly characterize the many-copy case. However, we show that this is not the case. We give positive results showing that multiple copies allow for going slightly beyond the single-copy obstruction: for thresholds, we construct QSS whenever t>(n−k+1)/2t>(n-k+1)/2t>(n−k+1)/2. On the other hand, we give a novel obstruction we call the Clique Path obstruction, which applies to arbitrary access structures. For thresholds, it shows that QSS is impossible whenever t≤(n−1)/kt\leq (n-1)/kt≤(n−1)/k. Our upper and lower bounds exactly match for k=2k=2k=2. Both our results leverage connections to the kkk-colorability of certain graphs derived from the access structure. We leave closing the gap for k≥3k\geq 3k≥3 copies as a fascinating direction for future work. Secret sharing is closely related to error correction, which can also be considered in the many-copy setting. Our results imply similar obstructions for quantum error correction for erasure channels.
We present a general scheme for sharing quantum secrets, and an extension to sharing classical secrets, which contain all known quantum-secret-sharing schemes. In this framework, we show the equivalence of existence of both schemes, that is, the existence of a scheme sharing a quantum secret implies that the extended classical-secret-sharing scheme works, and vice versa. As a consequence of this, we find schemes sharing classical secrets for arbitrary access structures. We then clarify the relationship to quantum error correction and observe several restrictions thereby imposed, which for example indicates that for pure-state threshold schemes the share size qqq must scale with the number of players nnn as $q\ensuremath{\ge}\sqrt{n}$. These results also provide a way of searching for quantum-error-correcting codes.