Reply to: Comment on (t, n) Threshold d-level Quantum Secret Sharing
Chuang Li (1), Longwei Zhang (2), Xiuli Song (2) ((1) School of, computer science, technology, Chongqing university of posts and, telecommunications, Chongqing 400065, China, (2) School of cyber security and, information law, Chongqing university of posts, telecommunications,

TL;DR
This paper addresses a critique of (t, n) threshold d-level quantum secret sharing, demonstrating that with an added disentanglement step, the scheme can successfully recover the secret as intended.
Contribution
The authors show that incorporating a disentanglement step allows the TDQSS scheme to correctly reconstruct the secret, countering previous claims of failure.
Findings
The modified TDQSS scheme successfully retrieves the secret.
Adding disentanglement step resolves previous reconstruction issues.
The scheme remains secure with the added step.
Abstract
A corresponding comment, raised by Kao and Hwang, claims that the reconstructor Bob1 is unable to obtain the expected secret information in (t, n) Threshold d-level Quantum Secret Sharing (TDQSS)[Scientific Reports, Vol. 7, No. 1 (2017), pp.6366] . In this reply, we show the TDQSS scheme can obtain the dealer's secret information in the condition of adding a step on disentanglement.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
