Graph states for quantum secret sharing
From MaRDI portal
Publication:4903159
DOI10.1103/PHYSREVA.78.042309zbMATH Open1255.81125arXiv0808.1532OpenAlexW1988251240WikidataQ59441074 ScholiaQ59441074MaRDI QIDQ4903159
Author name not available (Why is that?)
Publication date: 19 January 2013
Published in: (Search for Journal in Brave)
Abstract: We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum information processing system.
Full work available at URL: https://arxiv.org/abs/0808.1532
No records found.
No records found.
This page was built for publication: Graph states for quantum secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903159)
