相关论文: Quantum Parrondo's Games

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…

Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones. In this paper, we study one-dimensional discrete-time quantum walks, manipulating two different…

We study a quantum walk in one-dimension using two different "coin" operators. By mixing two operators, both of which give a biased walk with negative expectation value for the walker position, it is possible to reverse the bias through…

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,…

Parrondo paradox describes the counterintuitive phenomenon in which alternating two individually losing games yields a winning outcome. Extending this effect to the quantum regime has typically required high dimensional coin spaces,…

Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…

Parrondo's paradox is about a paradoxical game and gambling where two probabilistic losing games can be combined to form a winning game. While the counter intuitive game is interesting in itself, it can be thought of a discrete version of…

The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…

We construct a Parrondo's game using discrete time quantum walks. Two lossing games are represented by two different coin operators. By mixing the two coin operators $U_{A}(\alpha_{A},\beta_{A},\gamma_{A})$ and…

The Parrondo game, devised by Parrondo, means that winning strategy is constructed a combination of losing strategy. This situation is called the Parrondo paradox. The Parrondo game based on quantum walk and the search algorithm via quantum…

That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…

We propose a quantum game based on coin-based quantum walks. Given a quantum walk and a Hermitian operator on the coin-position composite space, winning this game involves choosing an initial coin state such that the given quantum walk…

The Parrondo's paradox is a counterintuitive phenomenon where individually-losing strategies can be combined in producing a winning expectation. In this paper, the issues surrounding the Parrondo's paradox are investigated. The focus is…

Parrondo's paradox, a counterintuitive phenomenon where two losing strategies combine to produce a winning outcome, has been a subject of interest across various scientific fields, including quantum mechanics. In this study, we investigate…

Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the…

Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we…

Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…

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…

Coordination and cooperation are among the most important issues of game theory. Recently, the attention turned to game theory on graphs and social networks. Encouraged by interesting results obtained in quantum evolutionary game analysis,…

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…