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

International Journal of Theoretical Physics

Verifiable Quantum Secret Sharing Scheme Based on LDPC Codes

Chen‐Ming Bai, Yanan Feng, Sujuan Zhang, Lu Liu

Published Jan 5, 2024• 10 citations
Publisher
DOI
10.1007/s10773-023-05533-3

Related papers

A quantum secret sharing scheme with verifiable function

Li-Juan Liu, Zhi-Hui Li, Zhao-Wei Han +1 more

arXiv:2003.04309•The European Physical Journal D•Jul 1, 2020•18 citations

A verifiable (k, n)-threshold dynamic quantum secret sharing scheme

Fulin Li, Hang Hu, Shixin Zhu +2 more

Quantum Information Processing•Jul 26, 2022•50 citations

Efficient Verifiable Quantum Secret Sharing Schemes via Eight-Quantum-Entangled States

Shaohua Jiang, Zehong Liu, Xiaoping Lou +3 more

International Journal of Theoretical Physics•Apr 16, 2021•15 citations

Verifiable Quantum Secret Sharing Scheme Using d-dimensional GHZ State

Chen‐Ming Bai, Sujuan Zhang, Lu Liu

International Journal of Theoretical Physics•Sep 23, 2021•21 citations

An Efficient Verifiable Quantum Secret Sharing Scheme Via Quantum Walk Teleportation

Xiaoxiao Chen, Xiaoping Lou

International Journal of Theoretical Physics•Apr 1, 2022•10 citations

Verifiable hybrid secret sharing with few qubits

Victoria Lipińska, Gláucia Murta, Jérémy Ribeiro +1 more

We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve this, we combine classical encryption of the quantum secret with an existing verifiable quantum secret sharing scheme based on Calderbank-Shor-Steane quantum error correcting codes. In this way we obtain a verifiable hybrid secret sharing scheme for sharing qubits, which combines the benefits of quantum and classical schemes. Our scheme does not reveal any information to any group of less than half of the $n$ nodes participating in the protocol. Moreover, for sharing a one-qubit state each node needs a quantum memory to store $n$ single-qubit shares, and requires a workspace of at most $3n$ qubits in total to verify the quantum secret. Importantly, in our scheme an individual share is encoded in a single qubit, as opposed to previous schemes requiring $\mathrm{\ensuremath{\Omega}}(logn)$ qubits per share. Furthermore, we define a ramp verifiable hybrid scheme. We give explicit examples of various verifiable hybrid schemes based on existing quantum error correcting codes.

arXiv:1911.09470•Physical Review A•Mar 20, 2020•31 citations
We consider the task of sharing a secret quantum state in a quantum network in a verifiable way. We propose a protocol that achieves this task, while reducing the number of required qubits, as compared to the existing protocols. To achieve this, we combine classical encryption of the quantum secret with an existing verifiable quantum secret sharing scheme based on Calderbank-Shor-Steane quantum error correcting codes. In this way we obtain a verifiable hybrid secret sharing scheme for sharing qubits, which combines the benefits of quantum and classical schemes. Our scheme does not reveal any information to any group of less than half of the nnn nodes participating in the protocol. Moreover, for sharing a one-qubit state each node needs a quantum memory to store nnn single-qubit shares, and requires a workspace of at most 3n3n3n qubits in total to verify the quantum secret. Importantly, in our scheme an individual share is encoded in a single qubit, as opposed to previous schemes requiring $\mathrm{\ensuremath{\Omega}}(logn)$ qubits per share. Furthermore, we define a ramp verifiable hybrid scheme. We give explicit examples of various verifiable hybrid schemes based on existing quantum error correcting codes.