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.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.

arXiv:1707.00938Progress of Theoretical and Experimental PhysicsNov 29, 20171 citation

Fair Game of Quantum Penny Flip

Xiaoken Yang, Wei Li, Yong-Chang Huang

The Quantum Penny Flip is a classic thought experiment in quantum mechanics that demonstrates the weird and counterintuitive nature of the quantum world. To solve the “PQ” problem, we proposed a quantum strategy selection and optimization algorithm, and designed a quantum algorithm for this problem. In terms of practical applications and Case study, this paper reviews the classic two player game – “PQ coin flipping” problem, and shows that when one of the participants adopts quantum strategies, he can defeat his classic opponent and obtain higher returns. By using quantitative methods, the entire “PQ” problem is placed under a more general and fair condition, and it is promoted and studied again from multiple aspects and perspectives. At the same time, this article provides the definitions of “incomplete fair game” and “complete fair game”, modifies the quantum coin flipping game [Meyer, Phys. Rev. lett. 82 (1999) 1052] to make the game fair, and studies the multi round versions of quantum coin flipping. We have drawn some basic conclusions about fair quantum games and explained the meaning of completely fair games in practice. We discussed the limitations and scalability of the “PQ” problem and looked forward to the future development direction of quantum game research.The Quantum Penny Flip is a classic thought experiment in quantum mechanics that demonstrates the weird and counterintuitive nature of the quantum world. To solve the “PQ” problem, we proposed a quantum strategy selection and optimization algorithm, and designed a quantum algorithm for this problem. In terms of practical applications and Case study, this paper reviews the classic two player game – “PQ coin flipping” problem, and shows that when one of the participants adopts quantum strategies, he can defeat his classic opponent and obtain higher returns. By using quantitative methods, the entire “PQ” problem is placed under a more general and fair condition, and it is promoted and studied again from multiple aspects and perspectives. At the same time, this article provides the definitions of “incomplete fair game” and “complete fair game”, modifies the quantum coin flipping game [Meyer, Phys. Rev. lett. 82 (1999) 1052] to make the game fair, and studies the multi round versions of quantum coin flipping. We have drawn some basic conclusions about fair quantum games and explained the meaning of completely fair games in practice. We discussed the limitations and scalability of the “PQ” problem and looked forward to the future development direction of quantum game research.

Advances in transdisciplinary engineeringOct 17, 20230 citations

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.