Long-time Entanglement in the Quantum Walk

Similar documents
arxiv:quant-ph/ v5 9 Oct 2008

Two-Dimensional Quantum Walks with Boundaries

Optimizing the discrete time quantum walk using a SU(2) coin

Recurrences and Full-revivals in Quantum Walks

arxiv: v1 [quant-ph] 10 Sep 2012

Decoherence on Szegedy s Quantum Walk

Recurrences in Quantum Walks

Implementing the quantum random walk

Quantum walk on a line with two entangled particles

Entanglement and Decoherence in Coined Quantum Walks

A quantum walk based search algorithm, and its optical realisation

Spatial correlations in quantum walks with two particles

Discrete quantum random walks

Generic quantum walk using a coin-embedded shift operator

!"#$%"&'(#)*+',$'-,+./0%0'#$1' 23$4$"3"+'5,&0'

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

Equal Superposition Transformations and Quantum Random Walks

Quantum Information Processing and Diagrams of States

Quantum Information Types

Quantum Entanglement and the Bell Matrix

Entanglement: concept, measures and open problems

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

New Journal of Physics

arxiv: v2 [quant-ph] 6 Feb 2018

1 Mathematical preliminaries

Lecture 3: Hilbert spaces, tensor products

MP 472 Quantum Information and Computation

2.1 Definition and general properties

Entropy in Classical and Quantum Information Theory

Return Probability of the Fibonacci Quantum Walk

Some Introductory Notes on Quantum Computing

arxiv: v3 [quant-ph] 29 Oct 2009

Likelihood in Quantum Random Walks

arxiv: v1 [quant-ph] 15 Nov 2018

arxiv: v1 [quant-ph] 1 Mar 2011

arxiv: v3 [quant-ph] 17 Nov 2014

By allowing randomization in the verification process, we obtain a class known as MA.

1 More on the Bloch Sphere (10 points)

Introduction to Quantum Computing

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

Single qubit + CNOT gates

Chapter 10. Quantum algorithms

arxiv:quant-ph/ v2 14 Jul 2005

Ensembles and incomplete information

Quantum Phase Estimation using Multivalued Logic

Lecture: Quantum Information

Energy Level Sets for the Morse Potential

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

arxiv: v2 [quant-ph] 7 Jun 2018

An Introduction to Quantum Computation and Quantum Information

Unitary Dynamics and Quantum Circuits

A fast quantum mechanical algorithm for estimating the median

Ph 219b/CS 219b. Exercises Due: Wednesday 20 November 2013

Ph 219b/CS 219b. Exercises Due: Wednesday 4 December 2013

An Introduction to Quantum Information and Applications

The Principles of Quantum Mechanics: Pt. 1

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

Introduction to Quantum Information Hermann Kampermann

Shared Purity of Multipartite Quantum States

On Alternating Quantum Walks

Universal computation by quantum walk

Imitating quantum mechanics: Qubit-based model for simulation

Entanglement Measures and Monotones

arxiv: v1 [quant-ph] 24 Mar 2008

Physics 239/139 Spring 2018 Assignment 6

Reflections in Hilbert Space III: Eigen-decomposition of Szegedy s operator

Lecture Notes on QUANTUM COMPUTING STEFANO OLIVARES. Dipartimento di Fisica - Università degli Studi di Milano. Ver. 2.0

1 Infinite-Dimensional Vector Spaces

Mixed-state sensitivity of several quantum-information benchmarks

Noisy quantum Parrondo games

in terms of the classical frequency, ω = , puts the classical Hamiltonian in the form H = p2 2m + mω2 x 2

Quantum Entanglement- Fundamental Aspects

Emergence of the classical world from quantum physics: Schrödinger cats, entanglement, and decoherence

An Architectural Framework For Quantum Algorithms Processing Unit (QAPU)

Lecture 4: Postulates of quantum mechanics

Physics 221A Fall 1996 Notes 14 Coupling of Angular Momenta

Quantum algorithms based on quantum walks. Jérémie Roland (ULB - QuIC) Quantum walks Grenoble, Novembre / 39

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI

Chapter 5. Density matrix formalism

arxiv: v4 [cond-mat.stat-mech] 25 Jun 2015

PHY305: Notes on Entanglement and the Density Matrix

Tensor network simulations of strongly correlated quantum systems

arxiv: v2 [quant-ph] 16 Nov 2018

Homework 3 - Solutions

Quantum control of dissipative systems. 1 Density operators and mixed quantum states

Teleportation-based approaches to universal quantum computation with single-qubit measurements

arxiv: v1 [quant-ph] 18 Apr 2018

Linear Algebra and Dirac Notation, Pt. 3

Valerio Cappellini. References

arxiv: v1 [quant-ph] 17 Jun 2009

Implementing Quantum walks

arxiv:quant-ph/ v1 16 Jan 2003

A Holevo-type bound for a Hilbert Schmidt distance measure

Deleting a marked state in quantum database in a duality computing mode

arxiv:quant-ph/ v5 10 Feb 2003

arxiv: v1 [cond-mat.str-el] 7 Aug 2011

S.K. Saikin May 22, Lecture 13

Transcription:

WECIQ 6 - Artigos Long-time Entanglement in the Quantum Walk Gonzalo Abal 1, Raul Donangelo, Hugo Fort 3 1 Instituto de Física, Facultad de Ingeniería, Universidad de la República, C.C. 3, C.P. 11, Montevideo, Uruguay Instituto de Física, Universidade Federal do Rio de Janeiro (UFRJ), C.P. 6858, Rio de Janeiro 1941-97, Brazil 3 Instituto de Física, Facultad de Ciencias. Universidad de la República, C.P. 114, Montevideo, Uruguay abal@fing.edu.uy, donangel@if.ufrj.br, hugo@fisica.edu.uy Abstract. The coin-position entanglement generated by the evolution operator of a discrete time quantum walk is quantified, using the von Neumann entropy of the reduced density operator (entropy of entanglement). In the case of a single walker, the entropy of entanglement converges, in the long time limit, to a well defined value which depends on the initial state. Exact expressions are obtained for local and non-local initial conditions. We also discuss the asymptotic bi-partite entanglement generated by non-separable coin operations for two coherent quantum walkers. In this case, the entropy of entanglement is observed to increase logarithmically with time. 1. Introduction The discrete-time Quantum Walk (QW), first introduced in by Aharonov, Davidovich and Zagury [Aharonov et al. 1993], is a quantum analog for the classical random walk where the classical coin flipping is replaced by a unitary operation in a one-qubit Hilbert space. Quantum walks in several topologies [Kempe 3] have been used as the basis for optimal quantum search algorithms [Shenvi et al. 3, Childs et al. 3] which take advantage of quantum entanglement and parallelism. Entanglement is an essential resource in many quantum information processing protocols, such as teleportation, secure key distribution or even Shor s factorization algorithm [Kendon & Munro 4]. For pure bi-partite states, it can be quantified using the von Neumann entropy of the reduced density operator (henceforth, the entropy of entanglement S E ). The evolution operator of a QW generates quantum correlations between the coin and position degrees of freedom. This entanglement can be quantified in the long time limit [Abal et al. 6] where exact expressions for S E can be obtained, for given initial conditions. When two quantum walkers are considered, different kinds of bi-partite entanglement may appear. We shall discuss this situation and include some preliminary results for QWs with non-separable coin operators. This work is organized as follows. In Section, we briefly review the discretetime quantum walk on the line and define the entropy of entanglement. The dependence of the asymptotic entanglement for (i) localized initial conditions and (ii) non-local initial 189

conditions spanned by the position eigenstates ± 1 are discussed. Section 3 is devoted to the case of two quantum walkers. Finally, in Section 4 we summarize our conclusions and discuss future developments.. Quantum walk on the line A step of the QW is a conditional translation between discrete sites on a line. The Hilbert space is the tensor product of two subspaces, H = H P H C. The first part, H P, is a quantum register spanned by the eigenstates of the position operator, X x = x x, with x an integer label. The second part, H C, is a single-qubit coin subspace spanned by two orthonormal states denoted {, 1 }. To avoid confusion, we use the symbol to indicate states in H P. A generic state for the walker is Ψ = x= x [a x + b x 1 ] (1) in terms of complex coefficients satisfying x a x + b x = 1 (in what follows, the summation limits are left implicit). The evolution of the walk is described by the unitary operator U = S (I P U C ) () where U C is a unitary operation in H C and I P is the identity in H P. A convenient choice for U C is a Hadamard operation, defined by H = ( + 1 )/ and H 1 = ( 1 )/. When U C = H one refers to the process as a Hadamard walk. The shift operator S = x { x + 1 x + x 1 x 1 1 } (3) conditionally changes the position one step to the right for or to the left for 1. This conditional shift entangles the coin and position of the quantum walker. In terms of the density operator, ρ = Ψ Ψ, the evolution is given by ρ(t) = U t ρ()u t where the non-negative integer t counts the discrete time steps that have been taken. The probability distribution for finding the walker at site x at time t is P(x,t) = tr(ρp x ) = a x + b x, where P x = x x I c. The variance of this distribution increases quadratically with time as opposed to the classical random walk, in which the increase is only linear. This property depends on quantum coherence and is lost in the presence of noise [Romanelli et al. 4a, Romanelli et al. 4b]. For pure, bi-partite states, entanglement can be quantified by the Entropy of Entanglement [Bennet et al. 1996, Myhr 4], defined as the von Neumann entropy of the reduced density operator. If the partial trace is conveniently taken over the position subspace, ρ c = tr x (ρ), and S E tr(ρ c log ρ c ). (4) This quantity is zero for a product state, unity for a maximally entangled state and it is invariant under LOCC (local operations with classical communication) [Vedral & Plenio 1998, Schlientz & Mahler 1995]. 19

In an early paper, Nayak and Vishwanath [Nayak & Vishwanath ] have shown that Fourier analysis may be used to obtain long-time asymptotic expressions for the amplitudes a x (t) and b x (t), for given initial conditions. We used this approach to characterize the asymptotic entanglement of the QW in [Abal et al. 6]. In the rest of this Section, we summarize and extend those results. We start by defining the dual space, Hk, spanned by the Fourier transformed kets k = x eikx x, with real wavenumbers k [ π,π]. In this representation the state vector is π dk [ Ψ = π k ã k + b ] k 1. (5) of the QW,, π These amplitudes are related to the position amplitudes in eq. (1) by ã k = x e ikx a x and b k = x e ikx b x, respectively. Since the step size is constant, the shift operator defined in eq. (3) U k = 1 ( ) e ik e ik. (6) e ik e ik is diagonal in k. Then, if Φ k is the spinor (ã k, b k ) T, the time evolution of an initial state can be expressed as Φ k (t) = Uk Φ t k () = e iωkt ϕ (1) k Φ k() ϕ (1) k + ( 1)t e iωkt ϕ () k Φ k() ϕ () k. (7) where ϕ (1,) k are the eigenvectors and ±e iω k the eigenvalues of Uk and the angle ω k [ π/,π/] is defined by sin ω k sin k/. In principle, eq. (7) may be transformed back to position space and the probability distribution P(x,t) obtained implicitly in terms of complicated integrals which, for arbitrary times, can only be done numerically. However, in the long time limit, approximate stationary phase methods can be used to evaluate these integrals for given initial conditions [Nayak & Vishwanath ]. We may avoid these technical difficulties, because the asymptotic entanglement S E may be obtained directly from eq. (7) and there is no need to transform back to position space. The entropy of entanglement of a quantum walker can be obtained after diagonalisation of the reduced density operator ( ) A B ρ c = tr x (ρ) = B, (8) C where A B C x x x a x = a x b x = b x = π π π π π π dk π ã k dk πãk b k (9) dk π b k. Normalization requires that tr(ρ) = A + C = 1. In terms of AC B (1) 191

S E 1,8,6 (a),4 4 6 8 1 t S E 1,8 (b) π/ 3π/8 π/4 π/8 α π/8 π/4 3π/4 π/ Figure 1. (color online) Entanglement vs discrete time for localized initial states with coin states χ parametrized in eq. (11); (a) time evolution of the entropy of entanglement S E for α = π/8 and β = π (black, full asymptotic entanglement), β = π/ (red, intermediate asymptotic entanglement) and β =, (blue, minimimum asymptotic entanglement); (b) asymptotic entropy of entanglement S E vs α from eq. (1) for β = (thick black line) β = π/4, (thin blue line) and β = ±π/ (dashed red line). [ ] the real, positive eigenvalues of ρ c are r = 1 1 + 1 4 and 1 r. The entropy of entanglement is obtained from S E = r log r (1 r) log (1 r). The units for bi-partite entanglement are e-bits, or entanglement bits, where one e-bit is the amount of entanglement contained in a Bell pair. The determinant [, 1/4] contains all the information required to quantify the coin-position entanglement in the QW. The greater the value of, the greater the entanglement..1. Local initial coins Consider a localized initial state (x =, without loss of generality) with an arbitrary coin parametrized in terms of two real angles α [ π/,π/] and β [ π,π], χ 1 [ cosα + e iβ sin α 1 ]. (11) In this case, the Fourier-transformed coefficients appearing in eq. (5) are ã () = cosα, b () = e iβ sin α and ã k () = b k () = for k. The integrands in eqs. (9) can be calculated from eq. (7) in terms of α and β. For long times, t 1, the k-averages in eqs. (9) are time-independent and the dependence of on the initial coin is lim t 1 = b 1 cos β sin(4α), (1) with = ( 1)/ and b 1 = ( )/4. The details of the calculation leading to this expression can be found in Appendix A of Ref. [Abal et al. 6] and will not be reproduced here. In panel (a) of Fig. 1 the time evolution of the entropy of entaglement is shown for fixed α = π/8 and β = π,π/, for which the asymptotic entanglement is maximum, intermediate or minimum respectively. In particular, the intermediate 19

asymptotic entanglement level, SE.87, has been erroneously reported as generic (i.e. resulting from all initial coins) in Ref. [Carneiro et al. 5]. In fact, as follows from expression (9), it is obtained for arbitrary α only if β = π/. Also apparent from Fig. 1 is the fact that lower entanglement levels result in larger oscillations and have a slower convergence to their asymptotic values. Panel (b) of this figure shows the variation of the asymptotic entanglement with α for three values of the relative phase β. For localized initial coins the minimum asymptotic entanglement is S E.736. However, as we discuss next, if non-local initial conditions are considered, arbitrary low values for asymptotic entanglement may be obtained... Non-local initial coins In order to explore the effects of non-locality in the initial conditions, let us consider a generic ket in the position subspace spanned by the eigenkets ±1, Ψ(θ,ϕ) = [ cos θ 1 + e iϕ sin θ 1 ] χ. (13) where the parameters θ [ π/,π/] and ϕ [ π,π] are real angles. The initial coin is fixed at + i 1 χ =. (14) Notice that in this case, localized states (θ =, ±π/) result in the intermediate entaglement S E.87. With these initial conditions, exact asymptotic expressions for the coefficients defined in eqs. (9) can be obtained (again, for the details see Ref. [Abal et al. 6]) leading to the eigenvalues r 1, = 1 ± [(B B sin θ cosϕ) + B + sin θ sin ϕ] 1/ (15) where B = ( 1)/, B = (3 4)/ and B + = ( 1) /. From this expression, the asymptotic entropy of entanglement S E (θ,ϕ) can be evaluated exactly. The left panel of Fig. shows a contour plot of this surface. For the initial conditions ( 1 ± 1 )/, the asymptotic entanglement is maximum S E.979 or minimum S E.661, respectively. The vertical dashed lines indicate initially localized position eigenstates and the horizontal dashed lines indicate initial position eigenstates with relative phase ϕ = ±π/. In both cases, the intermediate asymptotic entanglement S E.87 results. The right panel of Fig. shows the variation of S E with non-locality θ in the particular case when the relative phase is fixed at ϕ =. The minimum entanglement that can be obtained from non-local initial conditions in this subspace ( S E.661) is lower than the one attainable from local initial conditions ( S E.736, see Fig. 1). This raises a question about if further non-locality will result in even lower asymptotic entanglement levels. To illustrate the point, consider an initial Gaussian wave packet with a characteristic spread σ 1 in position space, with the same coin state χ as before. In this case, the Fourier transformed coefficients, ã k () σ e k σ /, describe a localized state in k-space. In fact, lim σ ã k () = πδ(k), where δ(k) is Dirac s delta function. In this limit, the eigenvalues of ρ c reduce to and 1 and the corresponding asymptotic entropy of entanglement becomes vanishingly small. Thus, for a particular uniform initial distribution in position space, a product state results in the long time limit if the appropriate relative phases are chosen. 193

π/ π/4 θ π/4 π/ π π/ S E 1.9 ϕ=.979.87 ϕ.8 π/ π.7.6 -π/ -π/4 π/4 π/ θ.661 Figure. (Left) contour plot of the asymptotic entanglement for non-local initial conditions obtained from eq. (15). Clear areas indicate maxima and dark areas, the minimum values. (Right) variation of asymptotic entanglement with non-locality θ for the particular relative phase ϕ =. 3. Two entangled walkers Entanglement in two-particle quantum walks [Carneiro et al. 5, Mackay et al., Omar et al. 4, Tregenna et al. 3] has not been fully characterized yet. The Hilbert space for two walkers is just the tensor product of two one-particle spaces, H AB = H A H B, where both H A and H B are isomorphic to the one-particle space H = H C H P described in Section. We label the positions of the walkers with pairs of integers (x,y), so that a generic two-particle pure state Ψ is Ψ = x,y {α x,y + β x,y 1 + γ x,y 1 + δ x,y 11 } x,y (16) with complex coefficients satisfying the normalization requirement α x,y + β x,y + γ x,y + δ x,y = 1. (17) x,y The two-particle evolution operator is composed of a unitary operation U C in the two-qubit coin subspace H C, followed by a conditional shift S in position space, U AB = S (I P U C ) (18) where I P is the identity in the two-particle position subspace H P. The shift operator S = x,y { x + 1,y + 1 x,y + x + 1,y 1 x,y 1 1 + x 1,y + 1 x,y 1 1 + x 1,y 1 x,y 11 11 } (19) performs single-step conditional displacements. An initial two-particle pure state, characterized by a density operator ρ() = Ψ() Ψ(), evolves to ( t ρ(t) = UAB t ρ() U AB) () 194

.6.5.4.3..1.18.16.14.1.1.8.6.4. -15-1 -5 X 5 1-1 15-15 -5 15 1 5 Y -15-1 -5 X 5 1-1 15-15 -5 15 1 5 Y Figure 3. DRAFT Probability distribution P(x, y) after t = 1 steps with the separable Hadamard coin, eq. (). (Left) Initial coins χ 1, eq. (3), which result in a symmetrical evolution, i.e. P A (x,t) = P A ( x,t) and P B (y,t) = P B ( y,t); (Right) Initial coins χ, eq. (4). In both cases, there is no entanglement between A and B. after t time steps. The resulting joint probability distribution for finding walker A at site x and walker B at site y, is P AB (x,y;t) = tr C (ρ) = α x,y + β x,y + γ x,y + δ x,y. (1) Note that, if ρ describes a pure, separable state (i.e. ρ = ρ A ρ B ), the joint distribution is a product of the two single particle distributions, P AB (x,y;t) = P A (x,t)p B (y,t). In the generic case, ρ describes an entangled state and a measurement of the position of one walker will affect the position of the other. In this initial work, we restrict consideration to pure states, since the quantification of entanglement in mixed states is more involved. 3.1. Separable coin operations In the simplest case, the coin operation U C in eq. (18) may be separable, U C = U A U B, where U A and U B are local unitary operators in H C. For these coin operations, entanglement between subspaces H A and H B can arise only from the choice of initial conditions and it is left unchanged by the evolution. As a simple example, let us consider the two particle Hadamard walk with U C = H H = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1. () Figure 3 shows the probability distribution obtained after t = 1 steps, from two initial initial conditions localized at the origin with the balanced coins χ 1 = 1 [ + i 1 + i 1 11 ] (3) χ = 1 [ 1 1 + 11 ]. (4) Note that both coins are separable so that in this case there is no entanglement between the two particles. 195

.35.35.3.3.5.5...15.15.1.1.5.5-15 -1-5 X 5 1-1 15-15 -5 15 1 5 Y -15-1 -5 X 5 1-1 15-15 -5 15 1 5 Y Figure 4. DRAFT Probability distribution P(x, y) after t = 1 steps with Grover s coin, eq. (5). (Left) Initial coins χ 1, eq. (3), which results in a distribution which remains highly peaked at the origin; (Right) Initial coins χ, eq. (4), which results in maximum spread. 3.. Non-separable coin operations A more interesting situation is the case of non-separable coins which may change the entanglement between the A and B subspaces. Now entanglement may be introduced by the initial condition or by the coin operation. There are now several kinds of entanglement, since the shift operation still entangles the coin and position degrees of freedom as described in the previous section. We shall consider the entanglement between both RPA coin particles, generated by the coin operation U C, thus we use unentangled initial coins from s1 eqs. (3) and (4). A B H.18.16.14.1.1.8.6.4. 15 1-15 -1-5 X 5 1-15 -1-5 5 Y Figure 5. (Left) Schematic diagram showing the action of the coin operation (6) in two-qubit space; (Right) Probability distribution P(x, y) after t = 1 steps with the coin operaton defined in eq. (6) corresponding to a Random-Pavlov quantum game. The initial state is localized with coins χ 1, eq. (3). As a first example of non-separable coin operator, consider Grover s coin G = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 (5) which plays a central role in Grover s search algorithm [Grover 1996]. The probability distribution corresponding to this coin operation remains strongly peaked at the origin for most initial coins, see Fig. 4, left panel. However, for the specific initial coin χ, eq. (4), the distribution has a maximum spread [Tregenna et al. 3], see right panel. 196

S E Grover s coin 7 6 5 4 3 1 1 3 4 log t 5 6 7 S E RP coin 7 6 5 4 3 1 1 3 4 log t 5 6 7 Figure 6. (color online) Entropy of entaglement S E vs log (t) for Grover s coin operation (left panel) and RP coin operation (right panel). Two initial states corresponding to localized states with coins χ 1 (black circles) and χ (blue triangles) are shown. The straight lines are the linear regression fits as discussed in the text. Another example of considerable interest is provided by the coin operations associated to quantum strategies in bi-partite quantum games [Abal et al. 6]. In particular, the coin operation U C = CNOT (H I) = 1 1 1 1 1 1 1 1 1 (6) describes a quantum game (RP) in which agent A implements a Random-like strategy, represented by a Hadamard operation H and B responds with a particular Pavlovian strategy (using a CNOT gate). Note that this coin operation, described by the circuit in Fig. 5 (left), generates the Bell states from the computational basis states. The resulting probability distribution (right panel) has a triangular form in (x,y) space. The time dependence of the bi-partite entanglement generated by the Grover and RP coin operations, quantified with the entropy of entanglement S E, is shown in Fig. 6. It increases logarithmically with the number of iterations, namely S E log (t c ). This may be associated to the fact that more sites on the plane become occupied and more position eigenstates become entangled as time increases. We estimated the constant c using a linear regression. For Grover s coin operation with initial coin χ 1, which leads to minimum spread, c =.5. In the case of the initial coin χ, which leads to maximum spread, the entanglement increases faster and c =.89. The RP coin, while producing a very different spatial distribution, generates entanglement (for both initial conditions) with c =.87, which is a very similar rate to that of Grover s coin in the maximally spreading case. These linear fits are the straight lines shown in Fig. 6. 4. Conclusions The evolution operator of the QW generates different kinds of entanglement. The conditional shift operation entangles the coin and position degrees of freedom of each walker. 197

This kind of entanglement has a well defined asymptotic value that depends on the initial conditions. In the case of a Hadamard walk with spatially localized initial conditions, the asymptotic entanglement varies between almost full entanglement and a minimum entanglement of S E.736. However, when non-local initial conditions are considered, any asymptotic entanglement level may be obtained. When two quantum walkers with a non-separable coin operation are considered, the inter-particle entanglement increases at a logarithmic rate. The time dependence of the entanglement generated by Grover s coin and by the RP coin (associated to a particular strategic choice in bi-partite quantum games) has been considered for two initial coins. In most of the cases, the entanglement increases as S E log t c with c.9. However, for Grover s coin operation with the initial coin χ 1 (which leads to a localized probability distribution), the entanglement increases more slowly, with c =.5. Entanglement is a basic resource in quantum algorithms, and further work is required in order to fully understand its properties in the QW. The analytical method outlined in Section for the case of a single walker, may be extended to the case of two walkers and this should provide a more profound understanding of the time dependence we have described in Section 4 of this work. Akwnowledgements. Work supported by PEDECIBA and PDT under project 9/84 (Uruguay). R.D. acknowledges support from CNPq and FAPERJ (Brazil). References Y. Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A 48, 1687 (1993). J. Kempe, Contemp. Phys. 44, 37 (3), preprint quant-ph/3381. N. Shenvi, J. Kempe, and B. Whaley, Phys. Rev. A 67, 537 (3). A. Childs et al., Exponential algorithmic speedup by quantum walk, in Proc. 35th ACM Symposium on Theory of Computing (STOC 3), pp. 59 68, 3, preprint quantph/9131. V. Kendon and W. Munro, preprint quant-ph/414. G. Abal, R. Siri, A. Romanelli, and R. Donangelo, Phys. Rev. A 73, 43 (6), updated version in quant-ph/414. A. Romanelli et al., Phys. A 338, 395 (4a), preprint quant-ph/31171. A. Romanelli, R. Siri, G. Abal, A. Auyuanet, and R. Donangelo, Phys. A 347, 137 (4b), preprint quant-ph/4319. C. Bennet et al., Phys. Rev. A 53, 46 (1996). G. Myhr, Measures of entanglement in quantum mechanics, Master s thesis, NTNU, 4, arxiv preprint quant-ph/4894. V. Vedral and M. Plenio, Phys. Rev. A 57, 1619 (1998). Schlientz and G. Mahler, Phys. Rev. A 5, 4396 (1995). A. Nayak and A. Vishwanath, preprint quant-ph/1117 (). I. Carneiro et al., New J. Phys. 7, 156 (5), preprint quant-ph/544. 198

T. Mackay, S. Bartlett, L. Stephenson, and B. Sanders, J. Phys. A 35, 745 (), preprint quant-ph/184. Y. Omar, N. Paunkovic, L. Sheridan, and S. Bose, arxiv preprint quant-ph/41165 (4). B. Tregenna, W. Flannagan, R. Maile, and V. Kendon, New. J. Phys. 5, 83 (3), preprint quant-ph/344. L. Grover, in Proc. 8 th ACM Symposium in the Theory of Computation, pp. 1 19, ACM Press, New York, 1996. G. Abal, R. R. Donangelo, and H. Fort, quant-ph/67143 (6). 199