Abstract

We present a device independent quantum secret sharing scheme in arbitrary even dimension. We propose a $d$-dimensional $N$-partite linear game, utilizing a generic multipartite higher dimensional Bell inequality, a generalization of Mermin's inequality in the higher dimension. Probability to win this linear game defines the device independence test of the proposed scheme. The security is proved under causal independence of measurement devices and it is based on the polygamy property of entanglement. By defining $\epsilon_{cor}$-correctness and $\epsilon^c$-completeness for a quantum secret sharing scheme, we have also shown that the proposed scheme is $\epsilon_{cor}$-correct and $\epsilon^c$-complete.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call