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.