Abstract
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson localisation. Here, we consider a directed discretetime quantum walk as a model to study quantum percolation of a twostate particle on a twodimensional lattice. Using numerical analysis we determine the fraction of connected edges required (transition point) in the lattice for the twostate particle to percolate with finite (nonzero) probability for three fundamental lattice geometries, finite square lattice, honeycomb lattice and nanotube structure and show that it tends towards unity for increasing lattice sizes. To support the numerical results we also use a continuum approximation to analytically derive the expression for the percolation probability for the case of the square lattice and show that it agrees with the numerically obtained results for the discrete case. Beyond the fundamental interest to understand the dynamics of a twostate particle on a lattice (network) with disconnected vertices, our study has the potential to shed light on the transport dynamics in various quantum condensed matter systems and the construction of quantum information processing and communication protocols.
Introduction
Percolation theory, which describes the dynamics of particles in random media^{1,2}, is an established area of research with numerous applications in diverse fields^{3,4}. The main figure of merit which quantifies the transport efficiency of a particle in percolation theory is the socalled percolation threshold^{5}. To illustrate its meaning in the classical setting, one can consider transport on a square lattice with neighbouring vertices connected with probability p. For p = 0, all vertices are disconnected from each other and no path for the particle to move across the lattice exists. With increasing p more and more vertices will be connected and once p = p_{c} = 0.5 a connection across the full lattice is established.
The corresponding problem of percolation of a quantum particle differs from the classical setting in that quantum interference plays a significant role^{6,7,8}. One consequence of that is that in a random or disordered system the interference of the different phases accumulated by the quantum particle along different routes during the evolution can lead to the particle's wave function becoming exponentially localized. This process is well known as Anderson localisation^{9,10,11} and has recently been experimentally observed in different disordered systems^{12,13,14}. Using a one parameter scaling argument it has been shown that all twodimensional (2D) Anderson systems are exponentially localised for any amount of disorder^{15}. Quantum interference therefore becomes as important in quantum percolation as the existence of the connection between the vertices, making it a more intriguing setting when compared to the classical counterpart^{16,17,18,19}.
Transport of a twostate quantum system (qubit) across a large network is an important process in quantum information processing and communication protocols^{20} and by today many physical systems are tested for their scalability and engineering properties. Furthermore, in last couple of years quantum transport models have also shown a certain applicability to understanding transport processes in biological and chemical systems^{21,22,23}. These natural or synthetic systems are not guaranteed to have a perfectly connected lattice structure and can possess a directed evolution in any particular direction. Therefore, it is important to consider the possible role quantum percolation can play in understanding transport in these systems and the effects of directed evolution on the Anderson localization length (the spatial spread of the localized state). In this work we present a model which is discrete in time to study the percolation of twostate quantum particle on a twodimensional lattice with directed transport in one of the dimensions. This study will complement the previously reported studies on quantum percolation using continuoustime Hamiltonian (see articles in lecture notes^{8} and references therein).
To model the dynamics of the twostate quantum particle we choose the process of quantum walks^{24,25,26,27,28}, which in recent years has been shown to be an important and highly versatile mechanism^{29}. Recently, first studies of twostate quantum walks in percolating graphs have been reported for circular and linear geometries^{30} as well as for square lattices using a fourstate particle^{31,32}. Here we present the physically applicable model of a directed discretetime quantum walk (DDQW) of a twostate particle to study quantum percolation on a 2D lattice. Not unexpectedly we find a nonzero percolation probability on a lattice of finite size when the fraction of missing edges is small. An increase in this fraction, however, quickly results in a zero percolation probability highlighting the importance of wellconnected lattice structure for quantum percolation. Using the continuum approximation of the discrete dynamics we then derive an analytical expression for the percolation probability and show that it is in perfect agreement with the numerical result. Since the percolation threshold tends towards unity for large lattices, we find that the directed evolution in also agreement with the scaling prediction of localization for any amount of disorder^{15}.
Below we will first establish a benchmark by describing the dynamics of the DDQW on a completely connected twodimensional lattice and introduce the modifications necessary to describe the dynamics when some of the connections between the vertices are missing. In Results we present the numerically obtained percolation probabilities for different fractions of disconnections between the vertices and for different lattice geometries and also give the analytically obtained formula for the square lattice case in the continuum limit. All of these results are interpreted in Discussion and we finally detail the analytical approach in Methods.
Directed discretetime quantum walk
Let us first define the dynamics of a DDQW on a completely connected square lattice of dimension n × n. The Hilbert space of the complete system is given by , where the space of the particle (coin space) contains its internal states, and and the space of the square lattice contains the vertices (x, y) of the lattice, x, y〉. For each step of the DDQW we will consider the standard DQW evolution in the x direction^{27,28}, followed by the directed evolution in the y direction, which is based on a scheme presented by Hoyer and Meyer^{33}. The evolution in x direction on a completely connected lattice consists of the coinflip operation
followed by the shift along the connected edges
Here  ↓〉 and  ↑〉 can equivalently be used to indicate the edge along the negative or positive x direction. For the directed evolution along the positive y direction we define the walk using one directed edge and r − 1 selflooping edges at each vertex (x, y) and assign a basis vector to each edge^{33}. Thus, every state at each edge is a linear combination of the states
where +〉 indicates the edge along the positive y direction and each indicates a distinct selfloop. As shown in Ref. [33], this is equivalent to an effective coin space at each vertex and the coinflip operation can be defined as
with the shift along the edges given by
The state of the twostate walker at any vertex is therefore given by , where the latter identity indicates that the edge dependent basis states for y direction can be the same as the ones for the x direction. However, in general the operation corresponding to one complete step of the DDQW on a completely connected lattice will then be
where the subscripts on the square brackets represent the basis on which the operators act. In Fig. 1(a) we show a schematic for the first two steps on a twodimensional lattice. With the particle initially at the origin, , the state after t steps is given by
and in Fig. 1(b) the direction of the spread of the wavepacket on the lattice is indicated. To find the probability of detecting the particle outside of a sublattice of size n × n on an infinitely large lattice after t steps one then has to calculate
where ρ(t) = Ψ_{t}〉 〈Ψ_{t} and the term describes the probability of finding the particle on the sublattice. For a onedimensional DQW the probability distributions are well known to spread over the range [−t cos(θ), t cos(θ)] and to decrease exponentially outside that region^{34,35} and for a onedimensional DDQW the interval of spread is given by ^{36}. For the twodimensional DDQW described above we show the probability distributions in Fig. 2 for t = 100, θ = π/4, r = 2 and the same basis states along the x and y direction ( ↓〉 = +〉 and ) and one can clearly see that the spread in the x direction is over the interval [−t, t] and in the y direction across the range [0, t]. The details of the evolved probability distributions depend of the initial state of the particle (see Figs. 2(a), (b) and (c)) and for long time evolutions (t → ∞) the probability for the particle to be found outside of a finite sublattice will approach P(t) → 1.
In case of a missing selflooping edge, the basis state along the edge connecting y with y + 1 will be specific to the vertex, +〉 = α_{x}_{,y} ↓〉 + β_{x}_{,y} ↑〉. This corresponds to a 1D DQW traversing a 2D lattice, as shown in Fig. 2(d) and complete transfer (P(t) = 1) will already be achieved for t > n. In Fig. 3 we show the probability of finding the particle outside the sublattice of size 200 × 200 as a function of time steps t for all the four cases of Fig. 2. Choosing a different value of θ in the coin operation along the x direction would lead to different rates of increase in P(t).
Directed discretetime quantum walk on a lattice with missing edges
Let us now consider lattice structures in which some of the edges connecting the vertices are missing. For the evolution along the x direction, for which the basis states are  ↓〉 and  ↑〉, the coin operation will be C_{θ} [Eq. (1)] and the shift operator has to be defined according to the number of edges at each vertex. If both edges in the xdirection are present we have
where x′ is (x + 1) and (x − 1), whereas the absence of even one of the edges requires
Alternatively, this shift operator can be written using a different selflooping edge for both basis states. The operator corresponding to each step along the x direction is then given by
A similar description applies to the evolution in the y direction. When an edge connecting (x, y) and (x, y + 1) is present, the shift operator will be
where y′ is (y + 1). When this edge is missing, both states, +〉 and are basis states for different selflooping edges and the shift operator will be
Thus, the operator corresponding to evolution along the y direction can be written as
and one complete step of the DDQW on a lattice which is not fully connected is given by
Here again the subscripts on the square brackets indicate the basis states of the edges for the evolution along each direction and the state of the particle after t steps is then given by
In a classical setting the percolation threshold for a square lattice can be calculated to be p_{c} = 0.5 and is known to be independent of the lattice size. In a quantum system, however, a disconnected vertex breaks the ordered interference of the multiple traversing paths, which can result in the trapping of a fraction of the amplitude at this point. This disturbance of the interference due to the disorder is known to result in Anderson localization^{9,10} and consequently a large percentage of connected vertices is required to reach a nonzero probability for the particle to cross the lattice. In the following we will define the percolation probability as
where ρ^{d}(t, p) = Ψ_{t}〉 〈Ψ_{t} and is the probability of finding the particle in the sublattice of size n × n as t → ∞ for a fixed percentage of disconnected vertices p. From this description of the dynamics we can note that a state gets trapped at a vertex (x, y) only if the edge connecting (x, y) with (x, y + 1) and one or both of the edges connecting (x, y) with (x + 1, y) and (x − 1, y) are missing. From all other vertices a state eventually finds a path and moves on. Therefore, the probability of finding a particle trapped on the sublattice for t → ∞ will stem only from states trapped at vertices with a missing edge along the positive y direction and one or two missing edges along x direction. We will call the critical value at which the fraction of connected vertices p is large enough to reach a certain, nonzero ζ(p) the transition point, p_{a}. While the value chosen for this is, of course, somewhat arbitrary, the results presented below only require our choice to be consistent and we therefore fix ζ(p) = 0.01. In fact, for any values smaller than 0.01, no noticeable changes are seen in our simulations. The transition point is then obtained by averaging over a large number of realisations, in which an initial state is evolved for a time t that is large enough to give all parts of the state a chance to find their way through the lattice and contribute to the probability. To make this numerically efficient we will in the following concentrate on the case where the basis state along y is given by +〉 = α_{x}_{,y} ↓〉 + β_{x}_{,y} ↑〉, as it has the narrowest probability distribution in the y direction for a perfectly connected lattice. A schematic of the walk for a fully connected square lattice is shown in Fig. 4(a) and an example for a broken lattice in Fig. 4(b).
In addition to considering quantum percolation on the fundamental square lattices, transport processes on honeycomb lattices and nanotubes have attracted considerable attention in recent years^{38} and the twostate quantum percolation model can be expected to give useful insight into the behaviour of quantum currents and their transition points. In Fig. 4(c) we show the path taken by the twostate DDQW on a honeycomb lattice of dimension 9 × 9 and in Fig. 4(d) we give an example for the situation where some connections are missing. For the later case each step of the DDQW consists of
where the quantum coin operators, and and the shift operator for the directed evolution in the ydirection, S_{y}(x, y), are same ones as the ones used for the evolution on the square lattice. Due to the honeycomb geometry however, the shift operator S′(q) transition W_{q} from q to q ± 1 corresponds to a shift along two edges, first in the ±x direction and then along the positive y direction.
Results
Numerical
In Fig. 5(a) we show the average ζ(p) for square lattices of different sizes, which have been obtained by taking the arithmetic mean of 200 independent numerical realizations and ensuring that the error bars are small. One can immediately see that p_{a} is significantly larger than p_{c} = 0.5 and even grows towards unity with increasing lattice size, which is a clear indicator of the important role Anderson localisation plays in the dynamical process. The inset of Fig. 5(a) shows the dependence of p_{a} on θ and the increase visible for larger angles can be understood by first considering a square lattice with all vertices fully connected and the initial position given by (x, y) = (0, 0). If the coin parameter is chosen as θ = 0, the two basis states move away from each other along the xaxis (no interference takes place) and exit from the sides at t = n/2. For finite values of θ, the exit point is pushed towards the positive y direction due to interference in the x direction and on an imperfect lattice the walker encounters potentially more broken connections (which lead to additional interferences). For small values of θ however, a large fraction of the state will still exit along the sides without interference and therefore only a smaller number of connections are needed.
The assumption of having the same coin operator at each lattice site is a rather strong one and in the following we will relax this condition to account for applications in more realistic situations. For this we replace θ by a vertex dependent parameter, θ_{x}_{,y} ∈ [0, π] that does not only account for local variations, but also allows for cos(θ_{x}_{,y}) to be negative if θ_{x}_{,y} ∈ [π/2, π]. This corresponds to a displacement of the left moving component to the right and of the right moving component to the left in the xdirection, which in turn can lead to localization in transverse direction^{37}. To illustrate the effect of this, an example for a single realisation is shown in Fig. 6 for a completely connected square lattice. A significantly reduced transversal spread compared to a walk with θ = π/4 is clearly visible. The average percolation probability as a function of p for this evolution is shown in Fig. 5(b) and, interestingly, we find that the disorder in the form of θ_{x}_{,y} does not result in any noticeable change in the value of p_{a} when compared to θ = π/4. This is due to that fact that θ_{x}_{,y} and θ = π/4 give rise to nearly the same degree of interference^{37} and it highlights the dominance of the localization effects along the transverse direction.
The resulting average percolation probability for an honeycomb lattice is shown in Fig. 7(a) as a function of the percentage of connected vertices with randomly assigned value of θ_{x}_{,y} ∈ [0, π]. Again, the data points were obtained by taking the arithmetic mean of 200 independent realizations and ensuring that the error bars a small. Similarly to the case of the square lattice we find that p_{a} is significantly larger than the classical percolation threshold p_{c} = 0.652^{39} and also lattice size dependent. Note that, compared to a square lattice of the same size, p_{a} for a honeycomb lattice is smaller, which gives the honeycomb structure an advantage over the square lattice for quantum percolation using a twostate DDQW. This can be understood by considering the geometry of the honeycomb lattice: the edges in the honeycomb lattice are such that the both operators S′(q) and S_{y}(x, y) contribute to the shift in y direction, whereas in the square lattice only S_{y}(x, y) contributes to this shift.
An interesting extension to the honeycomb lattice is the introduction of periodic boundary conditions in the xdirection, which transforms the flat lattice into a nanotube geometry. This corresponds to allowing transitions from q to (q ± 1 mod n), where n is the number of vertices along the xaxis and in Fig. 7(b) we show the percolation probability for such a structure as a function of the percentage of connected vertices with randomly assigned values of θ_{x}_{,y} ∈ [0, π] at each vertex. One can see that the transition point is same as that of a flat honeycomb structure with the same number of edges in the transverse direction, which can be understood by realising that the periodic boundary conditions increase the probability for a particle to encounter the disconnected vertices more than once. A nanotube with a small number of vertices in the radial direction therefore corresponds to an effectively larger flat system with the same defect density and from the earlier studies we know that larger lattices have higher p_{a}. Due to the absence of an exit point along the radial axis, the only direction the particle can exit is the positive ydirection, which explains the independence of p_{a} from the number of radial vertices. To summarise our numerical results, we show a comparison of p_{a} for the different geometries discussed above in Table I.
Analytical
The differential form of the discretetime evolution in the continuum limit allows to analytically derive an expression for the percolation probability, ζ(p), for a square lattice. It shows the clear dependence on the fraction of connections, p, between vertices and the lattice size n × n
however it is noteworthy that it is independent of θ. The details for deriving this expression are given below in Methods and in Table II we show the comparison of the transition point obtained from Eq. (19) and from the numerical analysis. Both approaches can be seen to give similar values.
Discussion
Above, we have investigated quantum percolation using a directed twostate DQW as a model for quantum transport processes. One of the main findings is that the transition point p_{a}, beyond which quantum transport can be seen, is much larger than the classical percolation threshold, p_{c}, due to localisation effects stemming from the dynamics relating to missing edges in the lattice. Therefore a small number of disconnected vertices in a large system can obstruct directed quantum transport significantly, which shows that even for the case of directed discretetime evolution, just like for the case of continuoustime Hamiltonians^{8,15}, Anderson localization can be a dominant process. In addition, for finite lattice sizes and unlike the classical case, we have found that p_{a} scales with the size of the lattice tending towards unity for large lattices. This can be understood by realising that the size of the Anderson localization length in a 2D system with disorder can be quite large^{15}, which means that on a smaller lattice one can always find a nonzero percolation probability to reach the edge of the lattice. However, this will decrease with increasing in lattice size. In our study the localization length in the x direction is very small, which results in a negligible (though nonzero) contribution to the percolation probability in this direction. The directed nature of the evolution in the positive y direction, however, contributes to an extended Anderson localization length, which in turn results in a nonzero percolation probability for small lattice sizes and small disorder. This can also be clearly seen in the analytical expressions derived for respective percolations along the x and y directions (see Methods below). Comparing different lattice geometries we have shown that p_{a} is smaller for honeycomb structures and nanotube geometries than for a square lattice of the same size. This variation suggests that one can explore the dynamics on different lattice structures to find the one most suitable for a required purpose. For example, a system with a high p_{a} can be well suited for quantum storage applications, whereas one with a low value will allow for more efficient transport.
Using twostate DDQWs to model quantum percolation can be seen as a realistic approach to studying transport processes in various directed physical systems such as photon dynamics in waveguides with disconnected paths or quantum currents on nanotubes. We have demonstrated its generality by allowing the parameter θ to vary randomly at each vertex and shown that this does not lead to any significant change in p_{a}. This is also confirmed by the analytical expression being independent of θ. Finally, our model can be extended to twostate quantum walks on threedimensional lattices by alternating the evolution along the different dimensions^{41}. Therefore, the DDQW can be defined on 3D systems and a similar studies can be carried out when advanced computation resources are available.
Given the current experimental interest and advances in implementing quantum walks in various physical systems^{42,43,44,45,46,47,48,49,50}, we believe that our discrete model is a strong candidate for upcoming experimental studies and its continuous form, which is detailed in the Methods, will also be of interest for further theoretical analysis with different evolution schemes.
Finally, it is interesting and important to understand which universality class the presented DDQW model belongs to. While it is well known that the twostate quantum walk with disorder given by a coin parameter (θ) is classified in the chiral symmetry class^{51}, the presence of the disconnected vertices represent another source of disorder, which might have the potential to lead to the system moving into a different universality class. To determine this, one has to realise that the disconnected vertices lead to 8 different forms of unitary operators (see Methods), which leads to 8 different forms for the effective Hamiltonian. Finding the universality class for our model has therefore to take the combination of the different dynamics stemming from all effective Hamiltonians into account, which is a task beyond the scope of the current work and which we will address in a future communication.
Methods
Derivation of Quantum Percolation Probability on square lattice
Here we will derive the continuous limit of the percolation probability of a twostate particle on a square lattice using the dynamics described in Fig. 2(b), where  ↓〉 and  ↑〉 are the basis state for evolution in x direction and +〉 = α_{x}_{,y}0〉 + β_{x}_{,y}1〉 is the basis state for evolution in the y direction. To do so we need to consider all possible 8 configurations the walking particle can encounter on a broken lattice, which are schematically shown in Fig. 8. The first row depicts the four possible vertex configurations that result in transport along the ydirection, i.e. from (x ± 1, y − 1) and (x, y − 1) to (x, y) and the second row shows the four configurations that result in transport of the state from (x ± 1, y − 1) to (x, y − 1) and the configuration that is trapped at position (x, y − 1). These latter four ones are equivalent to the configurations that result in transport of state from (x ± 1, y) to (x, y) and the configuration that is trapped at position (x, y).
In the following, by approximating the unit displacement with a differential operator form, we will derive a continuous expression describing the dynamics for all possible configurations. By summing up the differential operator forms for each configuration, weighted by their respective probabilities, we then obtain an effective differential equation, which we use to calculate the dispersion relation and percolation probability.
Figure 8(a)
For a completely connected lattice, it is straightforward to write the state of the particle at position (x, y), , as function of θ in its iterative form
These equations can be easily decoupled
and subtracting from both sides of Eq. (22), allows to obtain a difference form, which can be written as a second order differential wave equation
Note that this is in the form of the KleinGordon equation^{40}.
Figure 8(b)
For the configuration with a missing edge from the vertex (x, y − 1) to (x + 1, y − 1), the states arriving from (x, y − 2) and (x − 1, y − 1) will both proceed fully to (x, y), which gives
After decoupling we get
and subtracting on both sides lets us obtain the difference form
The right hand side can be further simplified to give
and the probability for this configuration is p^{2}(1 − p).
Figure 8(c)
For configuration with a missing edge from the vertex (x, y − 1) to (x − 1, y − 1), the states arriving from (x, y − 2) and (x + 1, y − 1) will both proceed fully to (x, y), which gives
After decoupling we get
and subtracting from both sides we obtain the difference form
The right hand side can be further simplified to obtain
and the probability for this configuration is p^{2}(1 − p).
Figure 8(d)
For a configuration with missing edges from the vertex (x + 1, y − 1) to (x, y − 1) and from the vertex (x − 1, y − 1) to (x, y − 1), the state at vertex (x, y) will be,
which, after decoupling, gives
Subtracting from both sides, the difference form can be obtained as
and the probability for this possibility is p(1 − p)^{2}.
The common feature of the next four configurations, Figs. 8(e)–(h), is the missing edge from the vertex (x, y − 1) to the vertex (x, y), which will result in the absence of any transport along the y direction.
Figure 8(e)
For a configuration with missing edges from the vertex (x + 1, y − 1) to (x, y) and from vertex (x, y − 1) to (x, y) the state will be
which is equivalent to
After decoupling we get
and subtracting from both sides we find the difference form
The probability for this possibility is p(1 − p)^{2}.
Figure 8(f)
For a configuration with missing edges from the vertex (x − 1, y − 1) to (x, y) and from vertex (x, y − 1) to (x, y) the state will be
which is equivalent to
After decoupling we get
and subtracting from both sides the difference form can be found as
The probability for this possibility is p(1 − p)^{2}.
Figure 8(g)
For the configuration where only the edge from vertex (x, y − 1) to (x, y) is missing, the state will be
which is equivalent to
After decoupling we get
and subtracting from both sides we obtain the difference form
The probability for this possibility is p^{2}(1 − p). This situation does not lead to localisation, since the states will move back to (x, ±1, y − 1) at the next time step and can then continue to evolve in the positive y direction.
Figure 8(h)
For the configuration with the three missing edges from (x + 1, y − 1) and (x − 1, y − 1) to (x, y − 1) and from (x, y − 1) to (x, y) all transport is suppressed and the state can be written as,
which is equivalent to
These expressions can be decoupled and written as
and the probability for this possibility is (1 − p)^{3}.
Effective differential expression
Adding the differential expression for all eight case above weighted by their respective probabilities, we get
which can be simplified as
One can now seek a Fouriermode wave like solution of the form
where ω_{x} is the frequency and k_{x} the wavenumber, which is bounded by for this differential form of the DQW^{37}. By substituting the first and second derivative of into the Eq. (62) we get a dispersion relation of the form,
which can be decomposed into its real and imaginary parts to give the two conditions
The solution to the real part of the dispersion relation describes the propagation properties of the wave, whereas the complex part relates to absorption (the trapped part in our case)^{52}. Therefore, in order to calculate the percolation probability of the propagating component, we only need to consider the solution for ω_{x} corresponding to the real part of the dispersion relation. This can be found as
The derivative of ω_{x}(k_{x}) with respect to k_{x} describes the fraction of the amplitude transported in ±x direction for each shift in the y direction and in Fig. 9(a) one can see that it increases with larger values of k_{x} and p (for ) and reaches a maximum for and p = 1. Since the transition probability will be the square of this amplitude, the percolation probability ζ_{x}(p) along the x axis for a square lattice of n × n dimensions in the continuum limit is given by
For the case of maximal transport we show this percolation probability for n = 50 and for different values of θ in Fig. 9(b). One can note that already for small values of θ (see curve for θ = π/12) the percolation probability along the x direction is very small, despite the fraction of the amplitude transported at each displacement being maximal. This is consistent with our earlier observation for the discrete evolution and leads to the conclusion that the percolation for the DDQW is mainly due to the transition along y–axis.
To obtain the percolation probability along ydirection we go back to Fig. 8 and write down the iterative form for transport of the state from y − 1 to y for each instance of time t. Defining , all the four cases in the first row lead to
and all four cases shown in second row give
The differential equations for all eight configuration properly weighted with their respective probabilities is then given by
Again, one can seek a Fouriermode wave like solution with ω_{y} as the frequency and k_{y} as the wavenumber of the form
which leads to
The percolation probability ζ_{y}(p) along the yaxis for a square lattice of n × n dimension in continuum limit as a function of p can then be found as
and we show this quantity in Fig. 9(c) as a function of lattice size n and p. Since in general its value is much larger than the percolation probability in the x direction we can finally write
which is independent of θ. In Fig. 9(d) we shown ζ(p) as a function of p for different lattice sizes and obtain values for the transition point very close to the ones obtained numerically for the discrete evolution presented in Results.
References
Kirkpatrick, S. Percolation and Conduction. Rev. Mod. Phys. 45, 574–588 (1973).
B. Bollobás, B. & Riordan, O. Percolation (Cambridge University Press, 2006).
Sahini, M. & Sahimi, M. Applications Of Percolation Theory (CRC Press, 1994).
Kieling, K. & Eisert, J. J. [Percolation in Quantum Computation and Communication]. Quantum and Semiclassical Percolation and Breakdown in Disordered Solids, Lecture Notes in Physics 762, [287–319] (Springer, Berlin, 2009).
Stauffer, D. & Aharony, A. Introduction to Percolation Theory (CRC Press, 1994).
Odagaki, T. Transport and Relaxation in Random Materials [Klafter, J.,Rubin, R. J. & Shlesinger, M. F. (ed.)] (World Scientific, Singapore, 1986).
Mookerjee, A., Dasgupta, I. & Saha, T. Quantum Percolation. Int. J. Mod. Phys. B 09, 2989 (1995).
Quantum and Semiclassical Percolation and Breakdown in Disordered Solids, Lecture Notes in Physics 762, (Springer, Berlin, 2009).
Anderson, P. W. Absence of Diffusion in Certain Random Lattices. Phys. Rev. 109, 1492 (1958).
Lee, P. A. & Ramakrishnan, T. V. Disordered Electronic Systems. Rev. Mod. Phys. 57, 287 (1985).
Evers, F. & Mirlin, A. D. Anderson Transitions. Rev. Mod. Phys. 80, 1355 (2008).
Schwartz, T., Bartal, G., Fishman, S. & Segev, M. Transport and Anderson localization in disordered twodimensional photonic lattices. Nature 446, 52–55 (2007 March 1).
Chabé, J. et al. Experimental Observation of the Anderson MetalInsulator Transition with Atomic Matter Waves. Phys. Rev. Lett. 101, 255702 (2008).
Crespi, A. et al. Anderson localization of entangled photons in an integrated quantum walk. Nature Photonics 7, 322–328 (2013).
Abrahams, E., Anderson, P. W., Licciardello, D. C. & Ramakrishnan, T. V. Scaling Theory of Localization: Absence of Quantum Diffusion in Two Dimensions. Phys. Rev. Lett. 42, 673 (1979).
Vollhardt, D. & Wölfle, P. [Selfconsistent theory of Anderson localization]. Electronic Phase Transitions [Hanke, W. & Kopaev, Yu. V. (ed.)] [1–78. (North Holland, Amsterdam, 1992).
Schubert, G. & Fehske, H. [Quantum Percolation in Disordered Structures]. Quantum and Semiclassical Percolation and Breakdown in Disordered Solids, Lecture Notes in Physics 762, [135–163] (Springer, Berlin, 2009).
Kirkpatrick, S. & Eggarter, T. P. Localized States of a Binary Alloy. Phys. Rev. B 6, 3598 (1972).
Shapir, Y., Aharony, A. & Brooks Harris, A. Localization and Quantum Percolation. Phys. Rev. Lett. 49, 486 (1982).
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information. (Cambridge University Press, 2000).
Engel, G. S. et al., Evidence for wavelike energy transfer through quantum coherence in photosynthetic systems. Nature 446, 782–786 (2007).
Mohseni, M., Rebentrost, P., Lloyd, S. & AspuruGuzik, A. Environmentassisted quantum walks in photosynthetic energy transfer. J. Chem. Phys. 129, 174106 (2008).
Plenio, M. B. & Huelga, S. F. Dephasingassisted transport: quantum networks and biomolecules. New J. Phys. 10, 113019 (2008).
Riazanov, G. V. The Feynman path integral for the Dirac equation. Sov. Phys. JETP 6 1107–1113 (1958).
Feynman, R. P. Quantum mechanical computers. Found. Phys. 16, 507–531 (1986).
Parthasarathy, K. R. The passage from random walk to diffusion in quantum probability. Journal of Applied Probability, 25, 151–166 (1988).
Aharonov, Y., Davidovich, L. & Zagury, N. Quantum random walks. Phys. Rev. A 48, 1687–1690 (1993).
Meyer, D. A. From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551 (1996).
VenegasAndraca, S. E. Quantum walks: a comprehensive review. Quantum Information Processing 11 (5), pp. 1015–1106 (2012).
Kollár, B., Kiss, T., Novotný, J. & Jex, I. Asymptotic Dynamics of Coined Quantum Walks on Percolation Graphs. Phys. Rev. Lett. 108, 230505 (2012).
Oliveria, A. C., Portugal, R. & Donangelo, R. Decoherence in twodimensional quantum walks. Phys. Rev. A 74, 012312 (2006).
Leung, G., Knott, P., Bailey, J. & Kendon, V. Coined quantum walks on percolation graphs. New J. Phys. 12 123018 (2010).
Hoyer, S. & Meyer, D. A. Faster transport with a directed quantum walk. Phys. Rev. A 79, 024307 (2009).
Nayak, A. & Vishwanath, A. Quantum walk on the line. DIMACS Technical Report, No. 200043 (2001).
Chandrashekar, C. M., Srikanth, R. & Laflamme, R. Optimizing the discrete time quantum walk using a SU (2) coin. Phys. Rev. A 77, 032326 (2008).
Bressler, A. & Pementle, R. Quantum random walks in one dimension via generating functions. DMTCS Conference on the Analysis of Algorithms pp. 403–414 (2007).
Chandrashekar, C. M. Disorder induced localization and enhancement of entanglement in one and twodimensional quantum walks. arXiv: 1212.5984.
S, D. Sarma, S. D., Adam, S., Hwang, E. H. & Rossi, E. Electronic Transport In TwoDimensional Graphene. Rev. Mod. Phys. 83, 407–470 (2011).
Sykes, M. F. & Essam, J. W. Exact Critical Percolation Probabilities for Site and Bond Problems in Two Dimensions. J. Math. Phys. 5, 1117 (1964).
Chandrashekar, C. M., Banerjee, S. & Srikanth, R. Relationship between quantum walks and relativistic quantum mechanics. Phys. Rev. A 81, 062340 (2010).
Chandrashekar, C. M. Twocomponent Diraclike Hamiltonian for generating quantum walk on one, two and threedimensional lattices. Scientific Reports 3, 2829 (2013).
Do, B. et al. Experimental realization of a quantum quincunx by use of linear optical elements. J. Opt. Soc. Am. B 22, 499 (2005).
Sansoni, L. et al. TwoParticle BosonicFermionic Quantum Walk via Integrated Photonics. Phys. Rev. Lett. 108, 010502 (2012).
Schmitz, H. et al. Quantum walk of a trapped ion in phase space. Phys. Rev. Lett. 103, 090504 (2009).
Zahringer, F., Kirchmair, G., Gerritsma, R., Solano, E., Blatt, R. & Roos, C. F. Realization of a quantum walk with one and two trapped ions. Phys. Rev. Lett. 104, 100503 (2010).
Perets, H. B., Lahini, Y., Pozzi, F., Sorel, M., Morandotti, R. & Silberberg, Y. Realization of quantum walks with negligible decoherence in waveguide lattices. Phys. Rev. Lett. 100, 170506 (2008).
Peruzzo, A. et al. Quantum walks of correlated photons. Science 329, 1500 (2010).
Schreiber, A. et al. Photons walking the line: a quantum walk with adjustable coin operations. Phys. Rev. Lett. 104, 050502 (2010).
Broome, M. A. et al. Discrete singlephoton quantum walks with tunable decoherence. Phys. Rev. Lett. 104, 153602 (2010).
Karski, K. et al. Quantum walk in position space with single optically trapped atoms. Science 325, 174 (2009).
Obuse, H. & Kawakami, N. Topological phases and delocalization of quantum walks in random environments. Phys. Rev. B 84, 195139 (2011).
Jackson, J. D. [Section 7.5 B: Anamolous dispersion and resonant absorption (equation 7.53)]. Classical Electrodynamics, Edition 3, (Wiley, 1998 August 10).
Acknowledgements
This work is funded through OIST Graduate University.
Author information
Authors and Affiliations
Contributions
C.M.C. designed the study, carried out the numerical analysis, analytical derivation and prepared figures with support from T.B. C.M.C. and T.B. together interpreted the results and wrote the manuscript.
Ethics declarations
Competing interests
The authors declare no competing financial interests.
Rights and permissions
This work is licensed under a Creative Commons AttributionNonCommercialShareAlike 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder in order to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/byncsa/4.0/
About this article
Cite this article
Chandrashekar, C., Busch, T. Quantum percolation and transition point of a directed discretetime quantum walk. Sci Rep 4, 6583 (2014). https://doi.org/10.1038/srep06583
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/srep06583
This article is cited by

Universal quantum computing using singleparticle discretetime quantum walk
Scientific Reports (2021)

Multibit quantum random number generation from a single qubit quantum walk
Scientific Reports (2019)

Interacting TwoParticle DiscreteTime Quantum Walk with Percolation
International Journal of Theoretical Physics (2018)

Twowalker discretetime quantum walks on the line with percolation
Scientific Reports (2016)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.