Quantum Parrondo's game with random strategies

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	KOŠÍK Jozef MISZCZAK Jarek A. BUŽEK Vladimír
Year of publication	2007
Type	Article in Periodical
Magazine / Source	Journal of Modern Optics
MU Faculty or unit	Faculty of Informatics
Citation
Field	Informatics
Keywords	quantum Parrondo game
Description	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.
Related projects:	Highly Parallel and Distributed Computing Systems Quantum multipartite computation, communication and security