In this paper, we formulate and analyze generalizations of the quantum penny flip game. In the penny flip game, one coin has two states, heads or tails, and two players apply alternating operations on the coin. In the original Meyer game, the first player is allowed to use quantum (i.e., non-commutative) operations, but the second player is still only allowed to use classical (i.e., commutative) operations. In our generalized games, both players are allowed to use non-commutative operations, with the second player being partially restricted in what operators they use. We show that even if the second player is allowed to use “phase-variable” operations, which are non-Abelian in general, the first player still has winning strategies. Furthermore, we show that even when the second player is allowed to choose one from two or more elements of the group |
U(2)|, the second player has winning strategies under certain conditions. These results suggest that there is often a method for restoring the quantum state disturbed by another agent.
This paper is inspired by the PQ penny flip game. It employs group-theoretic concepts to study the original game and its possible extensions. In this paper, it is shown that the PQ penny flip game can be associated, in a precise way, with the dihedral group D8 and that within D8 there exist precisely two classes of equivalent winning strategies for Q. This is achieved by proving that there are exactly two different sequences of states that can guarantee Q’s win with probability 1.0. It is demonstrated that the game can be played in every dihedral group D8n, where n≥1, without any significant change. A formal examination of what happens when Q can draw their moves from the entire U(2), leads to the conclusion that, again, there are exactly two classes of winning strategies for Q, each class containing an infinite number of equivalent strategies, but all of them sending the coin through the same sequence of states as before. Finally, when general extensions of the game, with the quantum player having U(2) at their disposal, are considered, a necessary and sufficient condition for Q to surely win against Picard is established: Q must make both the first and the last move in the game.