Qunatum Parrondo's games constructed by quantum random walk
Min Li, Yong-Sheng Zhang, Guang-Can Guo

TL;DR
This paper constructs a quantum version of Parrondo's game using discrete quantum walks, demonstrating how mixing two losing quantum games can lead to winning strategies depending on parameter choices.
Contribution
It introduces a novel quantum Parrondo's game framework based on position mixing of coin operators in quantum walks, revealing conditions for winning strategies.
Findings
Certain parameter settings lead to winning outcomes.
Mixing two losing quantum games can produce winning results.
Large step numbers eventually lead to losses.
Abstract
We construct a Parrondo's game using discrete time quantum walks. Two lossing games are represented by two different coin operators. By mixing the two coin operators and , we may win the game. Here we mix the two games in position instead of time. With a number of selections of the parameters, we can win the game with sequences ABB, ABBB, \emph{et al}. If we set , we find the game 1\emph{}with {\normalsize , will win and get the most profit.}If we set and{\normalsize{} the game 2 with , , will win…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
