2001/10/04 by David Meyer, David A. Meyer, Meyer, David A. +2
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #Optimization and Search Problems #nlin.CG #quant-ph #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.quant-ph/0110028
12 pages, plain TeX, 10 PostScript figures included with epsf.tex (ignore the under/overfull \vbox error messages); for related work see http://math.ucsd.edu/~dmeyer/research.html
arxiv created 2001/10/04 · arxiv updated 2009/11/30
Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.