    # Playing a true Parrondo's game with a three state coin on a quantum walk

A coin with three states is not necessarily an anomaly. A coin falls on either of its two sides head or tail. However, there is a remote possibility that it may not fall but roll on its edge and get stuck somewhere without falling on either of its sides. This possibility is remote for a classical coin so much so that it is never analyzed. For a three state quantum coin(qutrit), this is a fact. It has three states, period. 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 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.

## Authors

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

Quantum walks(QW), motivated from classical random walks, have proven to be of great utility in simulating many physical systems [1, 2] as well as in developing better quantum algorithms [3, 4, 5], such as the universal computational primitive

. Similar to a classical random walk, quantum walk can be described in a one-dimensional lattice with walker starting from the origin, however, unlike the classical random walk here the walker is described quantum mechanically by a wave function. Similar to a classical random walk, quantum walks consist of a walker and a coin. In case of classical random walks, the walker starts from origin moves left or right according to a coin toss, say if the coin toss yields head the walker moves right otherwise moves left. Probability distribution of the classical random walk in a one-dimensional lattice after

steps is a binomial distribution . In case of quantum walks the walker is a quantum object. The coin corresponding to a quantum walker in case of a two-state(head and tail) coin is a qubit. Similar to the classical random walks, in quantum walks if the coin toss yields head the walker moves towards right otherwise left. In addition to head or tail, the coin in quantum case can be in a superposition of head and tail and then walker will move to a corresponding superposition of left and right lattice sites. The probability distribution of the quantum walk is a two-peaked distribution peaking around the two edges, which is evidently different from that of classical random walk where peak is at origin. Similar to a quantum walk with two state coin(qubit), one can devise a quantum walk with a three-state coin too which is a qutrit. Quantum walk with a three state coin is not new, in fact studies have been attempted in context of localization[9, 10], weak limit and coin eigenstates of a one dimensional quantum walk with qutrits. Qubits are the quantum analogue for head and tail, similarly, qutrit is the quantum analogue of a three-state coin with a head, tail and a side. Similar to the two-state coin quantum walk described above, for a three-state coin quantum walk, if the coin lands on its head the walker moves right, if on tails walker moves to left and if the coin falls on side then the walker stays in the same position, this wait state of walker staying in the same position is the main difference between qutrit and qubit quantum walks. In case of classical random walk the walker with three state coin moves toward right when the coin lands on its head, moves left when coin lands on its tail but there is also a small probability that the coin falls on its side, then the coin toss is repeated this is one way of making analogy with the quantum walk with qutrit(three state coin).

The relevance of game theory spreads throughout many scientific fields. Quantum effects introduced to the classical game theory led to the development of quantum game theory, where the probabilities are taken in to account with quantum effects like superposition and interference. Parrondo’s games, in its simplest form, is a gambling game consisting two games A and B. whose outcome is determined by the toss of a biased coin. When a player plays each of them individually it results in losing whereas if played alternatively can result in a winning outcome. This apparent paradox when each of these games is losing when played individually but when played alternately or in some other deterministic or random sequence (such as ,, etc.) can become a winning game is known as Parrondo’s paradox. Originally J. M. R. Parrondo devised this paradox to provide a mechanism for Brownian ratchets where a directed motion can be harnessed from Brownian motion. In Ref.

Parrondo’s games are analysed using classical and quantum Markov Chains. In Ref.

 a super-activation-like effect for the capacity of classical as well as quantum communication channels with memory is constructed with the help of Parrondo’s paradox. The previous attempt for a Parrondo’s paradox with a single coin qubit on quantum walks failed in asymptotic limits[17, 18]. In one of our previous works, we showed how to realize a genuine quantum Parrondo’s paradox in the asymptotic limits not with a single coin but with two coins. In this work, our aim is to replicate the quantum Parrondo’s paradox in asymptotic limits in a 1D quantum walk not with two coins but with a single three-state coin(qutrit). The paper is organized in the following manner, starting with a brief introduction and motivation, in the next section we discuss how Parrondo’s games cannot be implemented in asymptotic limits with a 1D qubit quantum walk and then in the following section we discuss 1D quantum walks with a qutrit and an implementation of true Parrondo’s games in QWs with qutrits is devised. In the section on Discussions we discuss the reasons behind why a three-state coin(qutrit) delivers a genuine Parrondo’s paradox while a two-state coin(qubit) doesn’t and finally we end with a conclusion. Figure 1: An illustration for win or loss conditions for 1-D QW

## 2 Parrondo’s games in quantum walks with a qubit (two state coin)

In this section, we show why the implementation of Parrondo’s paradox failed in case of quantum walks with a qubit as shown in [17, 18]. This part is included as a motivation for our next section to implement a true Parrondo’s paradox in 1D quantum walks with a qutrit. To understand the reasons behind the failure to see a genuine Parrondo’s paradox in quantum walks with a single qubit, we proceed as follows: Two unitary operators and , representing two games A and B are alternately played in each time step-

 U(α,β,γ)=(eiαcosβ−e−iγsinβeiγsinβe−iαcosβ). (1)

The quantum walker is in an initial state where subscript refers to the position space and refers to the single two state coin (qubit) space which is initially in a superposition of and . The dynamics of the walker is governed by an unitary shift operator () acting in the position space defined as,

 S=∞∑n=−∞|n+1⟩p⟨n|p⊗|0⟩⟨0|+∞∑n=−∞|n−1⟩p⟨n|p⊗|1⟩⟨1|. (2)

The games A and B can be played in any sequence, i.e., (representing game A) is operated on time steps and (representing game B) is operated on time steps , where is the period and is an integer. The above scheme produces a game sequence- for . Similarly, game sequences such as for , etc., can also be generated. The evolution operator combining shift and coin operators can be written as:

 U={S⋅(Ip⊗U(αA,βA,γA))if t=nq,n∈ZS⋅(Ip⊗U(αB,βB,γB))if t≠nq,n∈Z (3) Figure 2: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√2(|0⟩q−i|1⟩q) with coin operator A=U(−45,45,0), b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√2(|0⟩q−i|1⟩q) with coin operator B=U(0,88,−15), c) PR−PL for the sequence ABBBABBB… with initial state |0⟩p⊗1√2(|0⟩q−i|1⟩q) with coin operator A=U(−45,40,0) and B=U(0,88,−15)

and after steps the final state is- . As illustrated in Fig. 1, after steps, if the probability of finding the walker to the right of the origin , is greater than the probability to be found to the left of the origin, i.e., , then the player wins. Similarly, if , the player losses. If , it’s a draw. Parrondo’s games using 1D discrete time QW are formulated by making use of above scheme. Two different coin operators and are used to construct the two losing games AAA.. and BBB.., for AND , i.e., for , we obtain the Fig.2. Individually each of the games is losing (See Fig. 2(a),(b))and for the sequence- the result is winning at the beginning but in the asymptotic limit the player loses again as in Fig. 2(c), one can check for different sequences, like- , etc., and in all cases in the asymptotic limits one loses. Hence Parrondo’s paradox does not exist in case of 1-D discrete time QW with a single qubit as also established in Refs. [17, 18].

To see a Parrondo’s paradox in 1D discrete quantum walks is thus the main motivation of this work and we show in the next section a recipe to do just that using a single three-state coin (qutrit).

## 3 True Parrondo’s games in quantum walks with a qutrit(three state coin)

In this section, we define a one-dimensional discrete time QW with a three-state coin. The position of the walker is defined by a vector in the Hilbert space

spanned by an orthogonal normal basis . At each position, the walker is in a superposition of three coin basis states. This coin state is a vector in Hilbert space with basis states represented by the following orthogonal vectors:

 |1⟩=⎡⎢⎣100⎤⎥⎦,|0⟩=⎡⎢⎣010⎤⎥⎦,|2⟩=⎡⎢⎣001⎤⎥⎦ (4)

The state of the walker at each time step is defined on the Hilbert space , the initial state of the walker at time step is

 |ψ0⟩=|0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) (5)

where, is the initial coin state.
A 1D QW with qutrit is defined with the position of the walker shifted by the shift operator after the coin operator is operated on the qutrit state as:

 |ψt+1⟩=S′⋅(I⊗C)|ψt⟩ (6)

where,

 S′ = ∞∑n=−∞|n+1⟩p⟨n|p⊗|0⟩⟨0|+∞∑n=−∞|n⟩p⟨n|p⊗|1⟩⟨1| (7) + ∞∑n=−∞|n−1⟩p⟨n|p⊗|2⟩⟨2|.

The shift operator is defined in such a way that only when the coin is in the state or the walker moves else when walker is in state the walker stays in the same position. The coin operator is defined as follows:

 C=C(α,β,γ,θ)=⎛⎜⎝IJKKIJJKI⎞⎟⎠+i⎛⎜⎝RBGBGRGRB⎞⎟⎠ (8)

where , , and are four real parameters defining the elements: and with

 3I=cos(γ)+2cos(θ)cos(α)3J=cos(γ)+2cos(θ)cos(α+2π/3)3K=cos(γ)+2cos(θ)cos(α+π/3)3R=sin(γ)+2sin(θ)cos(β)3G=sin(γ)+2sin(θ)cos(β+2π/3)3B=sin(γ)+2sin(θ)cos(β+4π/3) (9)

This kind of unitary operators are used in particle physics in the density matrix formalism for elementary particles. Similar to that of single two state coin or qubit QW scheme discussed in preceding section, we define an evolution operator as follows:

 U′={S′⋅(Ip⊗C(αA,βA,γA,θA)),if % t=nq,n∈Z,S′⋅(Ip⊗C(αB,βB,γB,θB)),if t≠nq,n∈Z. (10)

The evolution of the walker after steps is . Similar to that of the two state coin quantum walks, winning and losing is defined as follows: if the probability of finding the walker to the right of the origin , is greater than the probability to be found to the left of the origin , i.e., , then the player wins. Similarly, if , the player losses. If , it’s a draw. The two coin operators corresponding to the two games and are defined as follows:

 A=C(αA,βA,γA,θA)=C(π,π2,π,π),B=C(αB,βB,γB,θB)=C(π2,π2,3π2,π2). (11) Figure 3: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator B=C(π/2,π/2,3π/2,π/2) c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) and B=C(π/2,π/2,3π/2,π/2) for 500 steps

Here is operated on time steps and is played on time steps , where is the period and is an integer same as discussed in preceding section. For the choice of as shown in Eq. 11 we obtain Fig. 3. When game AAAA… and BBBB… are played it results in losing (see Figs. 3(a),(b)), whereas when they were played in the sequence we obtain a winning outcome (see Fig. 3(c)). Thus unlike a two state coin(qubit), in case of a three state coin(qutrit) in asymptotic limits we obtain a true Parrondo’s paradox.

## 4 Discussion

When a two-state coin(qubit) was considered the Parrondo’s games did not give rise to the paradox in asymptotic limits of the 1D QW (see Fig. 2) whereas when a three-state coin is used for quantum walks we obtain a true Parrondo’s paradox. In order to obtain a true Parrondo’s paradox, a three-state coin is needed. In Refs.[17, 18] it was shown that in asymptotic limits for a two-state coin the paradox does not exist. To identify the reasons for the success of three state coin as compared to a two-state coin we first study the influence of the initial state in Parrondo’s games. Let us consider a different initial state given as:

 |ψ0⟩=|0⟩p⊗1√3(|1⟩+|0⟩−|2⟩) (12) Figure 4: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−|2⟩) with coin operator A=C(π,π/2,π,π) b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−|2⟩) with coin operator B=C(π/2,π/2,3π/2,π/2) c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−|2⟩) with coin operator A=C(π,π/2,π,π) and B=C(π/2,π/2,3π/2,π/2) for 200 steps

which is different from the initial state (Eq. 5) considered in the preceding section. Now with this new initial state but with the same shift (Eq. 7), we now obtain Fig. 4. It is clear that the new initial state does not give us a paradox, when the games are played in sequence (see Fig. 4(c)). Now considering again another initial state given as:

 |ψ0⟩=|0⟩p⊗1√3(i|1⟩+|0⟩−|2⟩) (13) Figure 5: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(i|0⟩+|1⟩−|2⟩) with coin operator A=C(π,π/2,π,π) b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(i|0⟩+|1⟩−|2⟩) with coin operator B=C(π/2,π/2,3π/2,π/2) c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(i|0⟩+|1⟩−|2⟩) with coin operator A=C(π,π/2,π,π) and B=C(π/2,π/2,3π/2,π/2) for 400 steps

in this case, plot of the median shown in Fig. 5 results in a Parrondo’s paradox. This implies that the initial state plays a crucial role in the Parrondo’s games, with different initial states one may or may not obtain a true Parrondo’s paradox.

Next we consider the influence of the shift operator, using a different shift operator for the same initial state as in Eq. (5). Here we define a new shift -

 S′1 = ∞∑n=−∞|n+1⟩p⟨n|p⊗|1⟩⟨1|+∞∑n=−∞|n⟩p⟨n|p⊗|0⟩⟨0| (14) + ∞∑n=−∞|n−1⟩p⟨n|p⊗|2⟩⟨2| Figure 6: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator B=C(π/2,π/2,3π/2,π/2) c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) and B=C(π/2,π/2,3π/2,π/2) for the shift operator S′1 defined in Eq. 14

The shift operator as defined in Eq. 14 also gives us a Parrondo’s paradox after around steps(almost asymptotic limit) as in Fig. 6. One can see that the change in shift operator has changed the behavior of the Parrondo’s games, here the yield of the player is changing. Now if we consider another shift operator

 S′2 = ∞∑n=−∞|n+1⟩p⟨n|p⊗|1⟩⟨1|+∞∑n=−∞|n−1⟩p⟨n|p⊗|0⟩⟨0| (15) + ∞∑n=−∞|n⟩p⟨n|p⊗|2⟩⟨2| Figure 7: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator B=C(π/2,π/2,3π/2,π/2) c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|1⟩+|0⟩−i|2⟩) with coin operator A=C(π,π/2,π,π) and B=C(π/2,π/2,3π/2,π/2) for the shift operator S′1 defined in Eq. 15

where the state is the wait state, we obtain the plot of median, as in Fig. 7. Here the game sequence gives us a draw and the sequence provides a winning outcome whereas the sequence gives us a losing outcome, which is also a paradox with a role reversal with the definitions of win and loss from Fig. 1 is reversed. Thus we can conclude that the change of shift operator does not affect the paradox but only the yield of the player. So what does the qutrit QW have which the qubit QW doesn’t have? To understand this we focus on the difference between the shift operators used for qubit versus that used for qutrit case. In case of a qutrit, there are 3 states, and the shift operators: is of the form as given in Eqs. (7,14,15), have a wait state, a left going and another right going state. In qubit quantum walk, the shift operator is defined as in Eq. 2, is bereft of any wait state. Thus, the most plausible reason behind observing the paradox in qutrits but not in qubits is the possibility of a wait state. Of course the initial state of qutrit with three coin states as opposed to only two possible coin states for a qubit has an important bearing in observing Parrondo’s paradox as shown in Figs. 3,4. Figure 8: (a) PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π8,3π8,3π4,π4), (b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator B=C(2π3,7π,3π2,2π), (c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π8,3π8,3π4,π4) and B=C(2π3,7π,3π2,2π) for 400 steps for shift operator S′ as defined in Eq. 7 Figure 9: a) PR−PL for the sequence AAAA… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π8,2π8,3π4,6π4), (b) PR−PL for the sequence BBBB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator B=C(2π,3π,2π,π), (c) PR−PL for the sequence ABAB… with initial state |0⟩p⊗1√3(|0⟩+|1⟩−i|2⟩) with coin operator A=C(π8,2π8,3π4,6π4) and B=C(2π,3π,2π,π) for 400 steps for shift operator S′ as defined in Eq. 7

Finally, we consider the role of the qutrit coin operators as defined in Eq. (11). In Figs. 8,9, we can see that for different parameters as in Eq. (8) we can change the outcome of the game, i.e., we may or may not obtain a Parrondo’s paradox. Fig. 8 shows Parrondo’s paradox for different qutrit coin operators and . On the other hand Fig. 9 doesn’t show Parrondo’s paradox for a different set of parameters for the qutrit coin operator and as in Eqs. (8,9). The set of parameters for which we obtain the paradox are not special in any way and one can obtain many such set of parameters for which Parrondo’s paradox can be seen.

To understand the physical mechanism, one can allude to Ref. which shows a quantum walk modeled with cold atoms. In case of cold atoms the shift operators and coin operators are modeled using optical lattice and lasers, such a model can be used to physically realize the shift operators in Eqs.(7,14,15). In Ref. too, it has been shown that Parrondo’s paradox does not exist for a single qubit coin quantum walk considered. Qutrits can be physically realized with biphotons, demonstrated in Ref., using two correlated photons- a ”Biphotonic qutrit”. Such a biphotonic qutrit and optical lattice can be used to physically realize a three state quantum walk. Quantum walks with qutrits can be used for quantum algorithms and its non-trivial nature with Parrondo’s games can be helpful for better insights into quantum ratchets and quantum algorithms.

## 5 Conclusion

Earlier attempts using a single two-state coin failed in asymptotic limit [17, 18]. Here with the aid of a qutrit we successfully implemented a true Parrondo’s paradox (see Figs.  3,5,8). Quantum Parrondo’s games play an important role in quantum ratchets, providing a mechanism for a particle to transport against an applied bias, quantum analogue for Brownian ratchets. Different kinds of quantum walks and its applications can help the community in better understanding and for developing new quantum algorithms.

###### Acknowledgements.
This work was supported by the grant “Non-local correlations in nanoscale systems: Role of decoherence, interactions, disorder and pairing symmetry” from SCIENCE & ENGINEERING RESEARCH BOARD, New Delhi, Government of India, Grant No. EMR/20l5/001836, Principal Investigator: Dr. Colin Benjamin, National Institute of Science Education and Research, Bhubaneswar, India.

## References

•  A. Schreiber, et. al., A 2D quantum walk simulation of two-particle dynamics, Science 336, 55 (2012).
•  I. Márquez-Martín, G. Di Molfetta, and A. Pérez, Fermion confinement via quantum walks in -dimensional and -dimensional space-time, Phys. Rev. A 95, 042112 (2017)
•  A. Ambainis, Quantum walks and their algorithmic applications, Int. Journal of Quantum Information (4) (2003) 507
• 

A. M. Childs, et. al. in: Proceedings of the 35th ACM Symposium on Theory of Computing, ACM Press, New York, 2003, p.

59.
•  N. Shenvi, J. Kempe, K. B. Whaley, Quantum random-walk search algorithm. Phys. Rev. A 67 (2003) 052307.
•  A. M. Childs, Universal Computation by Quantum Walk, Phys. Rev. Lett. 102, 180501 (2009).
•  R. Portugal, Quantum Walks and Search Algorithms, Springer, Berlin 10.1007/978-1-4614-6336-8 (2013)
•  S. E. Venegas-Andraca, Quantum walks: a comprehensive review , Quantum Information Processing October 2012, Volume 11, Issue 5, pp 1015-1106.
•  N. Inui, N. Konno, and E. Segawa, One-dimensional three-state quantum walk. Phys. Rev. E 72, 056112
•  T. Machida, C. M.  Chandrashekar. Localization and limit laws of a three-state alternate quantum walk on a two-dimensional lattice, Phys. Rev. A 92, 062307 (2015)
•  S. Falkner and S. Boettcher, Weak limit of the three-state quantum walk on the line, Phys. Rev. A 90, 012307 (2014)
•  M. Štefaňák,I. Bezděková, I. Jex, Limit distributions of three-state quantum walks: the role of coin eigenstates, Phys. Rev. A 90, 012342 (2014)
•  David A. Meyer, Quantum Strategies, Phys. Rev. Lett. 82 (1999) 1052–1055
•  J. M. R. Parrondo and L. Dinis, Brownian motion and gambling: from ratchets to paradoxical games, Contemporary Physics, 45, 147 (2004).
•  F. A. Grünbaum, M. Pejic, Lett Math Phys (2016), 106, 251 .
•  S. Strelchuk, Parrondo’s paradox and superactivation of classical and quantum capacity of communication channels with memory, Phys. Rev. A 88, 032311
•  M. Li, Y. S. Zhang, G.-C. Guo, Quantum Parrondo’s games constructed by quantum random walk, Fluct. Noise Lett. 12, 1350024 (2013).
•  A. P. Flitney, Quantum Parrondo’s games using quantum walks, arXiv:1209.2252 (2012).
•  J. Rajendran and C. Benjamin, Implementing Parrondo’s paradox with two coin quantum walks, R. Soc. open sci. 2018 5 171599
•  C. Brannen, Density Operator Theory and Elementary Particles, available at:http://www.brannenworks.com/densitytime.pdf
•  S. Mugel, et. al., Topological bound states of a quantum walk with cold atoms, Phys. Rev. A 94, 023631 (2016)
•  B. P. Lanyon, et. al., Manipulating Biphotonic Qutrits, Phys. Rev. Lett. 100, 060504 (2008)