Quantum Secret Sharing with Multi-level Mutually (Un-)Biased Bases

Authors:
  • IYI-Ching Yu
    I-Ching Yu
  • FLFeng-Li Lin
    Feng-Li Lin
  • CHChing-Yu Huang
    Ching-Yu Huang

Abstract
We construct the general schemes for multi-partite quantum secret sharing using higher dimensional mutually (un-)biased bases by generalizing the two-level scheme proposed by Hillery {\it et al.}[Phys. Rev. A {\bf 59}, 1829(1999)]. We find that the consistent lookup table for secret sharing can be summarized in two algebraic conditions in a natural way, this highly simplifies practical en/de-coding procedures. We then prove that these higher dimensional schemes are secure against the eavesdropper via ancilla entanglement. Moreover, we give a formula of error-detecting rate as the estimator for these schemes against the intercept-and-resend cheating, and find out the optimal scheme in comprise of error-detecting and efficiency.