Graph state secret sharing in higher-dimensional systems

摘要

We present a formalism within which, using entangled graph states of prime-dimensional systems, a variety of different secret-sharing schemes (involving both quantum and classical secrets and quantum and classical channels shared between parties) may be unified. We review the explicit protocols we have found for three varieties of secret sharing within this formalism, including some for which the analogous formalism using qubit graph states is not sufficient.