Related papers: Implementing Parrondo's paradox with two coin quan…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
We present two collective games with new paradoxical features when they are combined. Besides reproducing the so--called Parrondo effect, where a winning game is obtained from the alternation of two fair games, a new effect appears, i.e.,…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
This paper investigates the different effects of chaotic switching on Parrondo's games, as compared to random and periodic switching. The rate of winning of Parrondo's games with chaotic switching depends on coefficient(s) defining the…
Parrondo's paradox, where the alternation of two losing strategies can produce a winning outcome, has recently been demonstrated in continuous-time quantum walks (CTQWs) through periodic defect modulation. We extend this phenomenon to…
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…
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>…
We present the first manifestation of a Parrondo's effect in a continuous-time quantum walk (CTQW). In our protocol we consider a CTQW in the presence of time-dependent transition defect. Our results show that the alternation between…
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…
One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, albeit the system is translationally invariant. The effect is…
We present a quantum image encryption protocol that harnesses discrete-time quantum walks (DTQWs) on cycles and explicitly examines the role of the Parrondo paradox in security. Using the NEQR representation, a DTQW-generated probability…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
We study one-dimensional quantum walk with four internal degrees of freedom resulted from two entangled qubits. We will demonstrate that the entanglement between the qubits and its corresponding coin operator enable one to steer the…
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…
We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
Each step in a quantum random walk is typically understood to have two basic components; a `coin-toss' which produces a random superposition of two states, and a displacement which moves each component of the superposition by different…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
In the original Parrondo game, a single player combines two losing strategies to a winning strategy. In this paper we investigate the question what happens, if two or more players play Parrondo games in a coordinated way. We introduce a…