Parrondo's game using a discrete-time quantum walk
C. M. Chandrashekar, Subhashish Banerjee

TL;DR
This paper introduces a quantum version of Parrondo's game using discrete-time quantum walks, where players with different quantum coins can develop strategies to turn losing positions into winning ones, with implications for information theory and physics.
Contribution
It presents a novel quantum Parrondo's game framework using discrete-time quantum walks and strategies for players to improve winning probabilities.
Findings
Players with different quantum coins can turn losing strategies into winning ones.
Strategies can be devised for individual players to increase their winning chances.
The game has potential applications in information theory and physical systems.
Abstract
We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using their coins alternatively, or in combination for each step of the quantum walk evolution. We also present a strategy for a player A (B) to have a winning probability more than player B (A). Significance of the game strategy in information theory and physical applications are also discussed.
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.
