Quantum secret sharing with qudit graph states

Abstract

We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.

13 pages, 12 figures. v2: Corrected to reflect imperfections of (n,n) QQ protocol. Also changed notation from $(n,m)$ to $(k,n)$, corrected typos, updated references, shortened introduction. v3: Updated acknowledgements

References in corpus (5)

• Experimental entanglement of six photons in graph states
• A No-Go Theorem for Gaussian Quantum Error Correction
• Quantum Error Correcting Codes Using Qudit Graph States
• Information Flow in Secret Sharing Protocols
• Blind encoding into qudits

Cited by in corpus (8)

• Experimental demonstration of graph-state quantum secret sharing
• Quantum secret sharing with polarization-entangled photon pairs
• Non-Threshold Quantum Secret Sharing Schemes in the Graph State Formalism
• Conditional Mutual Information of Bipartite Unitaries and Scrambling
• Generalized Semi-Quantum Secret Sharing Schemes
• Device Independent Quantum Secret Sharing in Arbitrary Even Dimension
• Bounds on the Information Rate of Quantum Secret Sharing Schemes
• Entropic Inequalities for a Class of Quantum Secret Sharing States