相关论文: Playing a true Parrondo's game with a three state …
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…
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…
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…
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…
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 consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed.
A quantum walker moves on the integers with four extra degrees of freedom, performing a coin-shift operation to alter its internal state and position at discrete units of time. The time evolution is described by a unitary process. We focus…
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…
We show that a genuine Parrondo paradox can emerge in two-state quantum walks without resorting to experimentally intricate high-dimensional coins. To achieve such goal we employ a time-dependent coin operator without breaking the…
We consider quantum variants of Parrondo games on low-dimensional Hilbert spaces. The two games which form the Parrondo game are implemented as quantum walks on a small cycle of length $M$. The dimension of the Hilbert space is $2M$. We…
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…
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…
Parrondo's Paradox arises when two losing games are combined to produce a winning one. A history dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by…
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…
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,…
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,…
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…
A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary…
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show its equivalence for circuit realization in ternary quantum…
We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, two different…