Work

Quantum Parrondo's game with random strategies¶

Year: 2007

Type: article

Abstract: 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.

Source: Journal of Modern Optics

DOI: 10.1080/09500340701408722

Authors: J. Košík, J. A. Miszczak∥, V. Bužek∥

Institutions: Slovak Academy of Sciences, Institute of Theoretical and Applied Informatics, Polish Academy of Sciences

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2155364765

FWCI: 1.179

Cites: 16

Cited by: 21

Related to: