Graph states for quantum secret sharing

By Damian Markham, Barry C. Sanders. 2008

421 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/8ee8f3457f3d5a9091b8f016e1015b4af9203201

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Joseph Francis Fitzsimons
2. Anne Broadbent
3. Elham Kashefi
4. Ashley Montanaro
5. Aram Wettroth Harrow

In Atomic and Molecular Physics, and Optics

1. Joseph Francis Fitzsimons
2. Anne Broadbent
3. Elham Kashefi
4. Aram Wettroth Harrow
5. Ashley Montanaro

Citations in the corpus

• Distributed Quantum Computing: a Survey (2022, neutral): “These states are referred to as entangled states and they represent the key ingredient in quantum computing [32, 33].”
• Universal Blind Quantum Computation (2008, background): “To the best of our knowledge, this is the first time that a new functionality has been achieved thanks to MBQC (other theoretical advances due to MBQC appear in [30, 25]).”
• Advances in quantum cryptography (2019, neutral): “[452] D.”