Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Implementing Parrondo's paradox with two coin quantum walks (1702.05927v3)

Published 20 Feb 2017 in quant-ph, cond-mat.mes-hall, and cs.CC

Abstract: Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological systems to explain their working. However, proposals on demonstrating Parrondo's paradox using quantum walks failed {for large number of steps}. In this work, we show that instead of a single coin if we consider a two coin initial state which may or may not be entangled, we can observe a genuine Parrondo's paradox with quantum walks. Further we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which are necessary for observing a genuine Parrondo's paradox. We extend our work to a 3-coin initial state too with similar results. The implications of our work for observing quantum ratchet like behavior using quantum walks is also discussed.

Citations (36)

Summary

We haven't generated a summary for this paper yet.