2010/08/31 by C. M. Chandrashekar, Subhashish Banerjee
Computer Science · Mathematics · Physics and Astronomy · #Discrete time and continuous time #Mathematical economics #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum computer #Quantum information #Quantum mechanics #Quantum pseudo-telepathy #Quantum walk #Statistical physics #Statistics #quant-ph
paper · pdf · doi:10.1016/j.physleta.2011.02.071
published as Physics Letters A 375 (2011), pp. 1553-1558 · 7 pages, 3 figures, In press : Phys. Lett. A (2011)
arxiv created 2011/03/04 · openalex publication_date 2011/03/05 · arxiv updated 2011/03/25 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06
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.