Related papers: Parrondo's game using a discrete-time quantum walk

Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In…

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at…

Parrondo's paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually.Several…

Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete…

An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.

In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…

We consider a collective version of Parrondo's games with probabilities parametrized by rho in (0,1) in which a fraction phi in (0,1] of an infinite number of players collectively choose and individually play at each turn the game that…

We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each…

Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…

We study two forms of a symmetric cooperative game played by three players, one classical and other quantum. In its classical form making a coalition gives advantage to players and they are motivated to do so. However in its quantum form…

We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…

We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…

Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…

In this work we propose and develop modified quantum games (zero and non-zero sum) in which payoffs and strategies are entangled. For the games studied, Nash and Pareto equilibriums are always obtained indicating that there are some…

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…

Attention to the very physical aspects of information characterizes the current research in quantum computation, quantum cryptography and quantum communication. In most of the cases quantum description of the system provides advantages over…

In this work, we introduce a general form of a two-parameter family of local interactions between quantum walkers conditioned on the internal state of their coins. By choosing their particular case, we systematically study the impact of…

We generalize the discrete quantum walk on the line using a time dependent unitary coin operator. We find an analytical relation between the long-time behaviors of the standard deviation and the coin operator. Selecting the coin time…