Multi-partite quantum cryptographic protocols with noisy GHZ states

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revised Version, 21 pages, 7 figures. We have added a third-man cryptography protocol. Our protocols for the three cryptograph

Scientific paper

We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then apply our distillation schemes to the tri-partite case for three cryptographic tasks--namely, (a) conference key agreement, (b) quantum sharing of classical secrets and (c) third-man cryptography. Moreover, we construct ``prepare-and-measure'' protocols for the above three cryptographic tasks which can be implemented with the generation of only a single entangled pair at a time. This gives significant simplification over previous experimental implementations which require two entangled pairs generated simultaneously. We also study the yields of those protocols and the threshold values of the fidelity above which the protocols can function securely. Rather surprisingly, our protocols will function securely even when the initial state does not violate the standard Bell-inequalities for GHZ states.

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

Multi-partite quantum cryptographic protocols with noisy GHZ 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 Multi-partite quantum cryptographic protocols with noisy GHZ states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-partite quantum cryptographic protocols with noisy GHZ states will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-2052

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