Quantum Secret Sharing and Random Hopping; Using single states instead of entanglement
Abstract
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single d- level state can do the same task of secret sharing between N parties, hence alleviating the need for entanglement. However the suggested protocol which is based on using mutually unbiased bases, works only when d is a prime number. We propose a new sequential protocol which is valid for any d.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.