Physics – Quantum Physics
Scientific paper
2011-09-07
Physics
Quantum Physics
Scientific paper
We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, and Tapp. Parametrized by a graph G and a subset of its vertices A, the protocol consists in: (i) encoding the quantum secret into the corresponding graph state by acting on the qubits in A; (ii) use a classical encoding to ensure the existence of a threshold. These new protocols realize ((k,n)) quantum secret sharing i.e., any set of at least k players among n can reconstruct the quantum secret, whereas any set of less than k players has no information about the secret. In the particular case where the secret is encoded on all the qubits, we explore the values of k for which there exists a graph such that the corresponding protocol realizes a ((k,n)) secret sharing. We show that for any threshold k> n-n^{0.68} there exists a graph allowing a ((k,n)) protocol. On the other hand, we prove that for any k< 79n/156 there is no graph G allowing a ((k,n)) protocol. As a consequence there exists n_0 such that the protocols introduced by Markham and Sanders admit no threshold k when the secret is encoded on all the qubits and n>n_0.
Javelle Jérôme
Mhalla Mehdi
Perdrix Simon
No associations
LandOfFree
New Protocols and Lower Bound for Quantum Secret Sharing with Graph States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New Protocols and Lower Bound for Quantum Secret Sharing with Graph States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Protocols and Lower Bound for Quantum Secret Sharing with Graph States will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-306542