Quantum Protocol for Decision Making and Verifying Truthfulness among $N$-quantum Parties: Solution and Extension of the Quantum Coin Flipping Game

Abstract

We devised a protocol that allows two parties, who may malfunction or intentionally convey incorrect information in communication through a quantum channel, to verify each other's measurements and agree on each other's results. This has particular relevance in a modified version of the quantum coin flipping game where the possibility of the players cheating is now removed. Furthermore, the analysis is extended to $N$-parties communicating with each other, where we propose multiple solutions for the verification of each player's measurement. The results in the $N$-party scenario could have particular relevance for the implementation of future quantum networks, where verification of quantum information is a necessity.

References in corpus (5)

• The Quantum Internet
• Device-independent security of quantum cryptography against collective attacks
• A large family of quantum weak coin-flipping protocols
• Quantum Extensive Form Games
• Quantum interactive proofs using quantum energy teleportation

Cited by in corpus (8)

• Long-range quantum energy teleportation and distribution on a hyperbolic quantum network
• Quantum interactive proofs using quantum energy teleportation
• A Multiparty Quantum Private Equality Comparison scheme relying on $|GH{Z}_3⟩$ states
• One-to-Many Simultaneous Secure Quantum Information Transmission
• A Quantum Approach to News Verification from the Perspective of a News Aggregator
• A distributed and parallel $(k,n)$ QSS scheme with verification capability
• A novel $2$ \& $3$ player scheme for Quantum Direct Communication
• A Novel Scalable Quantum Protocol for the Dining Cryptographers Problem