David A. Meyer, Heather Blumer
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, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.
Earlier work on the quantization of the history dependent (HD) Parrondo game by Flitney, Ng, and Abbott led to the FNA protocol. We propose an alternative quantization protocol for this game which differs from the FNA protocol in various aspects.
Parrondo's game of quantum search based on quantum walk
本文结合量子行走帕隆多博弈与量子行走搜索算法，提出基于量子行走的量子搜索帕隆多博弈，经数值模拟验证其在一、二维环面存在帕隆多悖论，且顶点为偶数、单标记顶点的d维环面上悖论范围关于原点对称。
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.
Quantum Parrondo Games in Low-Dimensional Hilbert Spaces
本文研究低维Hilbert空间上的量子Parrondo博弈，将组成博弈实现为环上量子行走，并利用量子硬币引入随机序列，发现长时间下因纠缠与自干涉产生复杂的系统性输赢结构。
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 general SU(2) operators to transform the game into the quantum domain. In the initial state, a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case.
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 study cooperative Parrondo's games in a quantum setup. The game is modeled using multidimensional quantum random walks with biased coins. We use the GHZ and W entangled states as the initial state of the coins. Our analysis shows than an apparent paradox in cooperative quantum games and some interesting phenomena can be observed.
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 paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme.
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 obtaine…
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 disse…
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.
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 coins (two-state) operators representing two losing games A and B, respectively, to create the Parrondo effect in the quantum domain. We exhibit that games A and B are losing games when played individually but could produce a winning expectation when played alternatively for a particular sequence of different periods for distinct choices of the relative phase.…
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 their coins alternatively, or in combination for each step of the quantum walk evolution. We also present a strategy for a player A (B) to have a winning probability more than player B (A). Significance of the game strategy in information theory and physical applications are also discussed.
We discuss the effect of correlated noise on the robustness of quantum coherent phenomena. First we consider a simple, toy model to illustrate the effect of such correlations on the decoherence process. Then we show how decoherence rates can be suppressed using a Parrondo-like effect. Finally, we report the results of many-body calculations in which an experimentally-measurable quantum coherence phenomenon is significantly enhanced by non-Markovian dynamics arising from the noise source.
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 hi…
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}(α_{A},β_{A},γ_{A})$ and $U_{B}(α_{B},β_{B},γ_{B})$, we may win the game. Here we mix the two games in position instead of time. With a number of selections of the parameters, we can win the game with sequences ABB, ABBB, \emph{et al}. If we set $β_{A}=45^{\circ},γ_{A}=0,α_{B}=0,β_{B}=88^{\circ}$, we find the game 1\emph{}with {\normalsize $U_{A}^{S}=U^{S}(-51^{\circ},45^{\circ},0)$, $U_{B}^{S}=U^{S}(0,88^{\circ},-16^{\circ}…
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 …
We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.
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 on finding the limit probability law for the position of the walker and study it by means of Fourier analysis. The quantum walker exhibits both localization and a ballistic behavior. Our two results are given as limit theorems for a 2-period time-dependent walk and they describe the location of the walker after it has repeated the unitary process a large num…
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 systems to explain their working. However, proposals on demonstrating Parrondo's paradox using quantum walks failed {for 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. Further we focus on reasons f…
Scouring Parrondo's Paradox in Discrete-Time Quantum Walks
本文在基于硬币的离散时间量子游走中提出一种量子博弈，并给出确定性方案识别 Parrondo 悖论，证明单个均失败的量子步按序组合后可变为获胜策略，从而深化对量子游走期望值演化的理解。
Quantum Parrondo Paradox via a Single Phase Defect Symmetry Breaking and Directed Transport
本文通过单个量子比特硬币、固定周期的SU(2)算符序列及单个局域相位缺陷，实现量子帕尔米多效应，展示了非对称性破缺如何产生定向量子马达，且验证了位置期望值作为验证悖论的正确度量。
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 types games, namely the prisoner's dilemma game and a cooperative Parrondo's game. In both cases we obtain results showing, that entanglement is a crucial resource necessary for the agents to achieve positive capital gain.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。