Fe b 20 02 Quantum Parrondo ’ s Games

arXiv: Quantum Physics, 2012

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 interference effects. This effect is analogous to that in Parrondo’s games, where alternating two losing (gambling) games can produce a winning game. The walker bias is produced by introducing a phase factor into the coin operator, with two different phase factors giving games A and B. We give the range of phases for which the Parrondo effect can be obtained with A and B played alternately or in other (repeated) deterministic sequences. The effect is transitory. For sufficiently large times the original bias resumes.

International Journal of Theoretical Physics, 2010

We study the effect of quantum noise on history dependent quantum Parrondo's games by taking into account different noise channels. Our calculations show that entanglement can play a crucial role in quantum Parrondo's games. It is seen that for the maximally entangled initial state in the presence of decoherence, the quantum phases strongly influence the payoffs for various sequences of the game. The effect of amplitude damping channel leads to winning payoffs. Whereas the depolarizing and phase damping channels lead to the losing payoffs. In case of amplitude damping channel, the payoffs are enhanced in the presence of decoherence for the sequence AAB. This is because the quantum phases interfere constructively which leads to the quantum enhancement of the payoffs in comparison to the undecohered case. It is also seen that the quantum phase angles damp the payoffs significantly in the presence of decoherence. Furthermore, it is seen that for multiple games of sequence AAB, under the influence of amplitude damping channel, the game still remains a winning game. However, the quantum enhancement reduces in comparison to the single game of sequence AAB because of the destructive interference of phase dependent terms. In case of depolarizing channel, the game becomes a loosing game. It is seen that for the game sequence B the game is loosing one and the behavior of sequences B and BB is similar for amplitude damping and depolarizing channels. In addition, the repeated games of A are only influenced by the amplitude damping channel and the game remains a losing game. Furthermore, it is also seen that for any sequence when played in series, the phase damping channel does not influence the game.

EPL (Europhysics Letters)

Playing a Parrondo's game with a qutrit is the subject of this paper. We show that a true quantum Parrondo's game can be played with a 3-state coin (qutrit) in a 1D quantum walk in contrast to the fact that playing a true Parrondo's game with a 2-state coin (qubit) in 1D quantum walk fails in the asymptotic limits.

Royal Society open science, 2018

Parrondo's paradox is ubiquitous in games, ratchets and random walks. The apparent paradox, devised by J. M. R. Parrondo, that two losing gamesandcan produce a winning outcome has been adapted in many physical and biological systems to explain their working. However, proposals on demonstrating Parrondo's paradox using quantum walks failed for a large number of steps. In this work, we show that instead of a single coin if we consider a two-coin initial state which may or may not be entangled, we can observe a genuine Parrondo's paradox with quantum walks. Furthermore, we focus on reasons for this and pin down the asymmetry in initial two-coin state or asymmetry in shift operator, either of which is necessary for observing a genuine Parrondo's paradox. We extend our work to a three-coin initial state too with similar results. The implications of our work for observing quantum ratchet-like behaviour using quantum walks are also discussed.

Quantum Information Processing, 2015

In a seminal paper, Meyer [David Meyer, Phys. Rev. Lett. 82, 1052 (1999)] described the advantages of quantum game theory by looking at the classical penny flip game. A player using a quantum strategy can win against a classical player almost 100% of the time. Here we make a slight modification to the quantum game, with the two players sharing an entangled state to begin with. We then analyze two different scenarios, first in which quantum player makes unitary transformations to his qubit while the classical player uses a pure strategy of either flipping or not flipping the state of his qubit. In this case the quantum player always wins against the classical player. In the second scenario we have the quantum player making similar unitary transformations while the classical player makes use of a mixed strategy wherein he either flips or not with some probability "p". We show that in the second scenario, 100% win record of a quantum player is drastically reduced and for a particular probability "p" the classical player can even win against the quantum player. This is of possible relevance to the field of quantum computation as we show that in this quantum game of preserving versus destroying entanglement a particular classical algorithm can beat the quantum algorithm.

2009

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 accuracy, via a circuit consisting entirely of variations of the quantum multiplexer, and that certain one player games, the history dependent Parrondo games, can be quantized as games via a particular variation of the quantum multiplexer. However, to date all such quantizations have lacked a certain fundamental game theoretic property. The main result in this dissertation is the development of quantizations of history dependent quantum Parrondo games that satisfy this fundamental game theoretic property. Our approach also yields fresh insight as to what should be considered as the proper quantum analogue of a classical Markov process and gives the first game theoretic measures of multiplexer behavior.

Physics Letters A, 2011

In the context of quantum information theory, “quantization” of various mathematical and computational constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of probability distribution with higher order randomization notions from quantum mechanics such as quantum superposition with measurement. For this to be done “properly”, a faithful copy of the original construction is required to exist within the new quantum one, just as is required when a function is extended to a larger domain. Here procedures for extending history-dependent Parrondo games, Markov processes and multiplexing circuits to their quantum versions are analyzed from a game theoretic viewpoint, and from this viewpoint, proper quantizations developed

We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level. PACS numbers: 03.67.-a, 03.67.Lx

Quantum Information Processing, 2021

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however less is known for infinitely repeated quantum games. Investigating infinitely repeated games is crucial since finitely repeated games do not much differ from single round games. In this work we establish the concept of general repeated quantum games and show the Quantum Folk Theorem, which claims that by iterating a game one can find an equilibrium strategy of the game and receive reward that is not obtained by a Nash equilibrium of the corresponding single round quantum game. A significant difference between repeated quantum prisoner's dilemma and repeated classical prisoner's dilemma is that the classical Pareto optimal solution is not always an equilibrium of the repeated quantum game when entanglement is sufficiently strong. When entanglement is sufficiently strong and reward is small, mutual cooperation cannot be an equilibrium of the repeated quantum game. In addition we present several concrete equilibrium strategies of the repeated quantum prisoner's dilemma.

2010

We study possible influence of not necessarily sincere arbiter on the course of classical and quantum 2 × 2 games and we show that this influence in the quantum case is much bigger than in the classical case. Extreme sensitivity of quantum games on initial states of quantum objects used as carriers of information in a game shows that a quantum game, contrary to a classical game, is not defined by a payoff matrix alone but also by an initial state of objects used to play a game. Therefore, two quantum games that have the same payoff matrices but begin with different initial states should be considered as different games. PACS numbers: 02.50.Le, 03.67.-a, 03.67.Hk