Graph States for Quantum Secret Sharing

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This version amends the original security claim for QQ (n,n): in fact the secret is not completely denied to the adversary in

Scientific paper

10.1103/PhysRevA.78.042309

We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum information processing system.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-493282

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.