2007/04/23 by J. Kosik, J. Košík, J. A. Miszczak +3 · 1 citation
Computer Science · Physics and Astronomy · #Game theory #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum information #Quantum network #Quantum pseudo-telepathy #Quantum walk #Random walk #Scheme (mathematics) #quant-ph
paper · pdf · doi:10.1080/09500340701408722
published as J. Mod. Optics, Vol. 54, 13 (2007), pp. 2275 - 2287
arxiv created 2007/04/23 · openalex publication_date 2007/09/10 · arxiv updated 2011/11/09 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We present a quantum implementation of Parrondo's game with randomly switched strategies using (1) a quantum walk as a source of ‘randomness’ and (2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum-walk scheme.