Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism

Details Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism

2012-02-15

arxiv.org/abs/1202.3433v1

Physics

Quantum Physics

LaTeX, 6 pages

Scientific paper

In a recent work, Markham and Sanders have 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, most work on secret sharing based on graph states 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 (CSS) codes and graph state QSS schemes sharing one qubit. With these results we are able to construct a large class of quantum secret sharing schemes with arbitrary access structures.

Affiliated with

Also associated with

No associations

Rating

Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism 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 Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124489