The GHZ state in secret sharing and entanglement simulation

Abstract

In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log n - 2n bits of communication. Finally, we present a problem simpler than the complete simulation of the multi-party GHZ state, that could lead to a no-go theorem for GHZ state simulation.

5 pages

References in corpus (5)

• Graph States for Quantum Secret Sharing
• The Communication Cost of Simulating Bell Correlations
• Anonymous quantum communication
• Combinatorics and Quantum Nonlocality
• Can quantum mechanics help distributed computing?

Cited by in corpus (9)

• Experimental demonstration of graph-state quantum secret sharing
• Conference key agreement in a quantum network
• Bell scenarios with communication
• Rates of multi-partite entanglement transformations and applications in quantum networks
• New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
• Simulation of equatorial von Neumann measurements on GHZ states using nonlocal resources
• Exact simulation of the GHZ distribution
• Consensus-based qubit configuration optimization for variational algorithms on neutral atom quantum systems
• Access structure in graphs in high dimension and application to secret sharing