Related papers: Quantum Parrondo's game with random strategies

We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are state-dependent. By identifying the game state…

Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0>…

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint…

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…

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…

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…

When confined to a topological environment consisting of a cycle coupled with a half-line, quantum walks exhibit long-term statistical tendencies which differ dramatically from the tendencies of classical random walks in the same…

Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…

Random access codes have provided many examples of quantum advantage in communication, but concern only one kind of information retrieval task. We introduce a related task - the Torpedo Game - and show that it admits greater quantum…

The original Parrondo game, denoted as AB3, contains two independent games: A and B. The winning or losing of A and B game is defined by the change of one unit of capital. Game A is a losing game if played continuously, with winning…

We introduce a method of analyzing entanglement enhanced quantum games on regular lattices of agents. Our method is valid for setups with periodic and non-periodic boundary conditions. To demonstrate our approach we study two different…

We introduce a new family of Parrondo's games of alternating losing strategies in order to get a winning result. In our version of the games we consider an ensemble of players and use "social" rules in which the probabilities of the games…

Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum…

We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…

Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…

We study a particular class of trace-preserving completely positive maps, called PQ-channels, for which classical and quantum evolutions are isolated in a certain sense. By combining open quantum random walks with a notion of recurrence, we…

This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important…

Although quantum walks exhibit peculiar properties that distinguish them from random walks, classical behavior can be recovered in the asymptotic limit by destroying the coherence of the pure state associated to the quantum system. Here I…

Parrondo's paradox was introduced by Juan Parrondo in 1996. In game theory, this paradox is described as: A combination of losing strategies becomes a winning strategy. At first glance, this paradox is quite surprising, but we can easily…

We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…