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

Quantum Information Processing

An efficient restricted (k, n)-threshold quantum-secret-sharing scheme based on local distinguishability

Jing-Tao Wang, Xin-Yu Chen, Yun Pan, Jing Li, Yanrong Lu

Published Mar 27, 2026• 1 citation
Publisher
DOI
10.1007/s11128-026-05147-8

Related papers

Restricted (k, n)-threshold quantum secret sharing scheme based on local distinguishability of orthogonal multiqudit entangled states

Chen‐Ming Bai, Zhihui Li, Jing-Tao Wang +2 more

Quantum Information Processing•Oct 5, 2018•16 citations

Searching for optimal quantum secret sharing scheme based on local distinguishability

Zhao Dou, Gang Xu, Xiu‐Bo Chen +3 more

Quantum Information Processing•Oct 1, 2020•4 citations

Quantum secret sharing scheme based on prime dimensional locally distinguishable states

Kangyi Hu, Zhihui Li, Xingjia Wei +1 more

Quantum Information Processing•Aug 27, 2024•3 citations

Quantum-Secret-Sharing Scheme Based on Local Distinguishability of Orthogonal Seven-Qudit Entangled States

Chengji Liu, Zhihui Li, Chen‐Ming Bai +1 more

International Journal of Theoretical Physics•Oct 19, 2017•21 citations

Quantum-secret-sharing Scheme Based on Local Distinguishability of Orthogonal Six-qudit Entangled States

Chengji Liu, Zhihui Li, Meng-Meng Si +1 more

Xinxi wangluo anquan•Apr 15, 2018•0 citations

Quantum scheme for secret sharing based on local distinguishability

Ramij Rahaman, Matthew Geoffrey Parker

In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting $(2,n)$-threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most $(k,n)$-threshold quantum secret sharing schemes have the restriction $k\ensuremath{\ge}\ensuremath{\lceil}\frac{n}{2}\ensuremath{\rceil}$.

arXiv:1403.1097•Physical Review A•Feb 20, 2015•149 citations
In this paper, we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under restricted local operation and classical communication. Based on this local distinguishability analysis, we propose a quantum secret sharing scheme (which we call LOCC-QSS). Our LOCC-QSS scheme is quite general and cost efficient compared to other schemes. In our scheme, no joint quantum operation is needed to reconstruct the secret. We also present an interesting (2,n)(2,n)(2,n)-threshold LOCC-QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can always reconstruct the secret. This LOCC-QSS scheme is quite uncommon, as most (k,n)(k,n)(k,n)-threshold quantum secret sharing schemes have the restriction $k\ensuremath{\ge}\ensuremath{\lceil}\frac{n}{2}\ensuremath{\rceil}$.