Quantum Secret Sharing and Random Hopping; Using single states instead of entanglement
classification
🪐 quant-ph
keywords
entanglementsecretsharingprotocolquantumsequentialsingleachieve
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.