Abstract

Two players of coin-flipping game randomly choose one of two strategies, flipping over or not. Meyer quantized states of the game to be described instead by density matrices of the two-dimensional Hilbert space. In order to obtain and unify generation of the two players coin-flipping game with more than two strategies, we renew the need for equivalently describing Meyer’s PQ coin-flipping game by representing player’s strategies as elements of permutation groups. Expanding the dimension of quantum vector to arbitrary N-dimension in the coin-flipping game model, we generalize Meyer’s PQ coin-flipping game to PQ arbitrary finite strategies game. Owing to the quantum Fourier transform, quantum contrivance of Q has a winning strategy in PQ coin-flipping game with arbitrary finite strategies. Even though the player Q has a small probability of winning his opponent in the classical PQ coin-flipping game with arbitrary finite strategies, he can win his opponent who uses classical mixed strategies by his quantum strategies. Furthermore, we realize the winning quantum strategies of quantum player Q of PQ coin-flipping game with arbitrary finite strategies in macro world.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call