## Abstract

We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence and employ the quantum-classical (QC) dynamical distance as a figure of merit to assess whether, and to which extent, decoherence *classicalizes* the CTQW, i.e. turns it into the analogue classical process. We show that the dynamics arising from intrinsic decoherence, i.e. dephasing in the energy basis, do not fully classicalize the walker and partially preserves quantum features. On the other hand, dephasing in the position basis, as described by the Haken–Strobl master equation or by the quantum stochastic walk (QSW) model, asymptotically destroys the quantumness of the walker, making it equivalent to a classical random walk. We also investigate how fast is the classicalization process and observe a larger rate of convergence of the QC-distance to its asymptotic value for intrinsic decoherence and the QSW models, whereas in the Haken–Strobl scenario, larger values of the decoherence rate induce localization of the walker.

### Similar content being viewed by others

## 1 Introduction

Quantum walks (QWs) are the quantum-mechanical counterpart of classical random walks (RWs) [1,2,3,4,5]. If the walker evolves in discrete temporal steps, we talk about discrete-time QWs, while in continuous-time quantum walks (CTQWs) time is a real parameter [6, 7]. In this work, we focus on continuous-time quantum walks. Quantum walks on graphs are used to describe the transport of energy or information across a given structure in several physical, chemical and biological systems [8,9,10,11]. They also proved to be powerful tools for building quantum algorithms [12, 13] and provide a universal model of quantum computation [14,15,16].

Experimental implementations of quantum walks unavoidably involve the interaction with an external environment, and a question arises on whether, and to which extent, the open quantum system dynamics of a quantum walker is detrimental to its quantum features. In turn, the thorough characterization of decoherence effects in CTQWs is a key ingredient for their use in quantum technology and, in particular, to envisage strategies that may mitigate or cancel out noise. Several studies investigated how noise stemming from the interaction between the system and the environment affects the dynamics of quantum walks [17,18,19,20,21,22,23,24]. Different effects may emerge, such as localization, transition towards a classically distributed walker [20, 21, 23], but also an improvement in excitation transport efficiency [18, 19, 22, 24]. However, if a QW loses all of its quantum features and becomes a classical RW, then any potential quantum advantage related to the quantum process is lost as well.

In this paper, we study if decoherence can turn a continuous-time quantum walk over a graph into the corresponding classical random walk. We refer to this phenomenon as *classicalization*. In order to make our analysis quantitative, we use a fidelity-based measure of non-classicality, referred to as quantum-classical distance, that quantifies the differences between the dynamics of a quantum and a classical walker on a given graph [25]. Recently, this quantity has been also used as a tool to design optimal quantum walks [26]. We use this distance to assess if and to which extent decoherence makes the quantum evolution more similar to its classical counterpart, at least asymptotically, with respect to the ideal noiseless case.

In the following, we study three different models of decoherence. First, we investigate intrinsic decoherence [27], i.e. decoherence in the Hamiltonian basis, then we shift our focus to two different mechanisms of decoherence in the position basis. In particular, we consider dephasing induced by the Haken–Strobl master equation [28] and then we analyse the interplay of unitary and irreversible dynamics using the quantum stochastic walk framework [29]. We show that intrinsic decoherence is not able to completely classicalize the walker: residual quantumness is preserved, and the quantum walker dynamics departs from the corresponding classical one. We give the analytic expressions for the asymptotic value of the quantum-classical distance over the complete, cycle and star graphs. On the other hand, the two models of decoherence in the position basis completely suppress the quantum features of the coherent process, nullifying the quantum-classical distance.

As we will see in detail, some general properties of the quantum-classical distance do not depend on the decoherence model: it reaches an asymptotic value which does not depend on the decoherence rate and its qualitative behaviour is not dependent on the size of the graph, nor the considered topology. On the other hand, we show that the rate of convergence of the quantum-classical distance to its asymptotic value is influenced by the noise parameter with a non-universal behaviour. For intrinsic decoherence and for the quantum stochastic walk model, we observe that a larger value of the decoherence parameter leads to a faster convergence, whereas for the Haken–Strobl master equation we see an inversion, such that after a threshold value of the noise rate the quantum-classical distance decays slower.

The paper is organized as follows. In Sect. 2, we establish notation and briefly review classical and quantum walks, the master equation approach for noisy quantum walks, and the quantum-classical distance. In Sect. 3, we investigate the effects of intrinsic decoherence on CTWQs, while Sect. 4 is devoted to the study of decoherence in the position basis. In Sect. 5 we draw conclusions and provide some concluding remarks.

## 2 Preliminary concepts

Let us consider a finite, simple, undirected, connected graph *G*(*V*, *E*), where *V* is the set of vertices, also called nodes, and *E* the set of edges. The cardinality of *V* sets the dimension of the graph, i.e. the number of nodes \(N=\vert V\vert \). A graph is uniquely identified by its Laplacian matrix \(L=D-A\), where *A* is the adjacency matrix and *D* is a diagonal degree matrix [30]. In particular, \(A_{jk}=1\) if vertices *j* and *k* are connected (with \(j\ne k\)), and zero otherwise, and \(D_{jj}=d_j\) is the vertex degree of the node, i.e. the number of edges connecting the *j*-th node to the others. *L* is a positive semi-definite matrix and completely determines the classical evolution of a walker on a graph. The dynamics of a classical walker initially localized on node *j* may be described by the diagonal density matrix

where \(p_{kj}(t)=\langle k\vert e^{-\nu L t} \vert j\rangle \) is the classical transition probability from node *j* to node *k*, \(\nu \) is the transition rate, \(\lbrace \vert k\rangle \rbrace _{k=1}^N\) is the complete orthonormal basis which describes localized states of the walker on the *N* nodes of the graph and \(\rho _j = \vert j\rangle \!\langle j\vert \) is the initial state. The map \({\mathcal {E}}_C\) describes a continuous-time random walk (CTRW) on the graph *G*. On the other hand, the purely coherent quantum evolution of a CTQW is obtained by promoting the Laplacian to the system’s Hamiltonian \(H =\nu L\) [7] (though this is not the only possible choice for a CTQW generator [5, 31]). Without loss of generality we can set the transition rate to \(\nu = 1\) and \(\hbar =1\). The unitary evolution of the quantum walk is thus given by \(\left| \psi (t)\right\rangle =e^{-iHt}\left| j\right\rangle \), where \(\left| j\right\rangle \) denotes the initial localized state.

### 2.1 Noisy quantum walks

If the walker interacts with an external environment, its evolution is no longer unitary and can be described, within the Markovian approximation, by a master equation in the Lindblad form, i.e.

Here \({\mathcal {D}}\) is the Linblad superoperator, defined as \({\mathcal {D}}\left[ A\right] \rho = A\rho A^{\dagger }-\frac{1}{2}\lbrace A^{\dagger }A,\rho \rbrace \) with the brackets \(\{A,B\}=AB+BA\) denoting the usual anticommutator, \( O_k \) are the Lindblad operators and \(\gamma _k \ge 0\). The main goal of this work is to investigate if, and to which extent, the presence of environmental noise makes the quantum evolution of a walker on a graph more similar to its classical counterpart [that is described by Eq. (1)], compared to the ideal noiseless scenario. In particular, we consider three models of noisy quantum walks whose dynamics is induced by three master equations that describe dephasing in some basis of choice.

At first, we focus on decoherence in the energy basis, corresponding to the following master equation

which describes *intrinsic decoherence* of a quantum system. It has been derived [27] by assuming that at short timescales a quantum system evolves as a stochastic sequence of random unitary operators. The parameter \(\gamma \ge 0\) is referred to as the decoherence rate, and *L* is the graph Laplacian. From an operational point of view, intrinsic decoherence corresponds to a randomized quadratic perturbation [32].

We then consider two different models of decoherence in the site (position) basis. The first one corresponds to the Haken–Strobl master equation [28], which reads

where \(\gamma \ge 0\) is the decoherence rate and \(P_k = |{k}\rangle \langle {k}|\) are the site-projector operators. It can be shown [28] that the Haken–Strobl master equation corresponds to a system with a tight-binding Hamiltonian affected by stochastic noise describing thermal Gaussian fluctuations of the on-site energies. The decoherence parameter \(\gamma \) is related to the variance of the thermal fluctuations. The Haken–Strobl master equation finds applications in the description of a single excitation transport, e.g. in an *N*-site chain subject to dephasing induced by the interaction with a fluctuating environment [33].

A second model of decoherence in the site basis is provided by the quantum stochastic walk (QSW) approach [29]. The QSW formalism axiomatically generalizes a classical random process to a quantum stochastic process, where the topology of the underlying graph imposes constraints on the dynamical evolution of the walker. It is described by the following master equation [34]

Here \(p\in [0,1]\) quantifies the interplay between unitary (\(p=0\)) and irreversible (\(p=1\)) dynamics and the \(P_{kj}=L_{kj}|{k}\rangle \langle {j}|\) are the jump operators, with \(L_{kj}=\left\langle k\right| L\left| j\right\rangle \). This model generalizes both the QW and the RW on the graph by continuously interpolating between the two dynamics with a single real mixing parameter *p*. This model has been employed to investigate the role of environmental noise in assisting the transport of energy or information across a network, such as a light-harvesting complex in a photosynthetic process [19, 22, 24, 34].

### 2.2 The quantum-classical distance

In order to compare the dynamics of different quantum walks models, and to quantify the differences between quantum and classical evolutions, we use a recently introduced dynamical distance based on fidelity [25]. Given two dynamical maps, describing a classical \({\mathcal {E}}_C[\rho _{cl}]\) and a quantum \({\mathcal {E}}_Q[\rho _{cl}]\) evolution, the QC-distance \(D_{\text {QC}}(t)\) between them is defined as [25]:

where \(\rho _{cl}\) is an initial classical state of the walker, i.e. a statistical operator diagonal in the node basis, and \({\mathcal {F}}({\mathcal {E}}_C[\rho _{cl}],{\mathcal {E}}_Q[\rho _{cl}])\) is the quantum fidelity between the classically and quantum-evolved states, i.e. \({\mathcal {F}}(\rho ,\sigma )=\left[ \hbox {Tr}\sqrt{\sqrt{\rho }\sigma \sqrt{\rho }}\right] ^2\). The minimization in Eq. (6) is achieved, for every graph, by a localized state \(\rho _j\) [25]; hence, we shall focus on such initial states only. An interesting feature of this measure of non-classicality is that, for noiseless unitary quantum dynamics, it has a horizontal asymptote which depends only on the total number of nodes *N*, i.e. \(\lim _{t\rightarrow \infty }D_{\text {QC}}(t)=1-\frac{1}{N}\). In the next section, we use the QC-distance as a figure of merit to assess the robustness of CTQW against decoherence. In particular, we compute the QC-distance between the classically evolved state \({\mathcal {E}}_C[\rho _j](t)\) defined in Eq. (1) and the quantum state described by a CPTP-map modelling decoherence in some basis of choice.

## 3 Decoherence in the energy basis

Let us consider a quantum walker subject to the intrinsic decoherence process described by the master equation (3). The solution for an initial localized state \(\rho _j=|{j}\rangle \langle {j}|\), is given by

where \(\lbrace \lambda _n \rbrace _{n=1}^N\) and \(\lbrace \vert \lambda _n \rangle \rbrace _{n=1}^N\) are, respectively, the eigenvalues and eigenvectors of *L*, i.e. \(L\vert \lambda _n \rangle = \lambda _n \vert \lambda _n \rangle \). Equation (7) represents decoherence in the energy basis and may also be expressed in the following form:

where \(g(y\vert \,0,\sigma )\) is a Gaussian probability distribution function with standard deviation \(\sigma \) and zero mean value. The connection between the two representations is achieved by the correspondence \(\sigma ^2=\gamma t\). This map can thus be reinterpreted as a coarse graining in time of the ideal quantum evolution.

We now use Eq. (7) to compute the QC-distance \(D_{\text {QC}}(t)\) and analyse its behaviour for relevant graph topologies. In the long-time limit, the classical transition probability distribution \(p_{kj}(t)\) tends to the flat distribution, i.e. for \(t\gg 1\) we obtain

Furthermore, in the same limit, we see from Eq. (7) that, because of the exponential damping, the only terms of the sum that survive asymptotically are those that satisfy the condition \(\lambda _n=\lambda _p\). We can write the expression for the asymptotic quantum map \({\mathcal {E}}_L[\rho _j](t_{\infty })\equiv {\mathcal {E}}_\infty [\rho _j]\) as follows

The asymptotic quantum-classical distance reads

\(D_{\text {QC}}(t_{\infty })\) thus depends on the graph topology but not on the decoherence parameter \(\gamma \), which only affects the rate of convergence to its asymptotic value.

From the asymptotic expression in Eq. (9), we see that decoherence in the energy basis cannot turn the quantum evolution of CTQW into a classical random walk for any graph with a degenerate Laplacian spectrum. Indeed, the QC-distance is zero if and only if the stationary quantum state is the maximally mixed state. From the expression of \({\mathcal {E}}_\infty [\rho _j]\) it follows that, if the spectrum of *L* has eigenvectors corresponding to degenerate eigenvalues \(\lambda _n=\lambda _p\) with \(\left\langle \lambda _n\right| \rho _j\left| \lambda _p\right\rangle \ne 0\), then the density matrix has nonzero off-diagonal elements and the QC-distance does not vanish. Indeed, the absence of off-diagonal terms in the quantum density matrix is a necessary, but not sufficient, condition to classicalize the walker. The existence of degenerate Laplacian eigenvalues is thus a key element in the classicalization of the QW, and it is related to the symmetries of the underlying graph, as we show in Appendix A.

Let us conclude this section with few comments about the rate of convergence of the QC-distance to its asymptotic value. From the expression of the classical transition probability from node *j* to node *k*

it follows that the convergence of the classically evolved state \({\mathcal {E}}_C[\rho _j](t)\) to the maximally mixed state is governed by the smallest nonzero eigenvalue which is known as the Fiedler value \(\lambda _F\). The leading term in Eq. (11) is \(e^{- \lambda _F t}\), and consequently, the bigger the Fiedler value, the faster the convergence of the classical distribution to the uniform one. In the quantum case instead, the rate of convergence to the stationary state is determined by the smallest nonzero value of the energy gap \((\lambda _n - \lambda _p)^2\), as can be seen from Eq. (7). The parameter \(\gamma \) determines the rate of convergence, once \((\lambda _n - \lambda _p)^2\) is fixed. For the three classes of graphs, we are going to consider in this paper, i.e. complete, cycle and star graphs, the minimum of this gap is achieved by the difference of the two smallest eigenvalues squared, namely when one is zero and the other is the Fiedler value. However, this is no longer true for a general topology.

### 3.1 Complete graph

The complete graph is the graph corresponding to maximal connectivity. The Laplacian matrix of a an *N*-node complete graph has the expression \(L=N\mathbb {I}-\mathbb {J}\), where \(\mathbb {J}\) is the unit matrix, i.e. its elements are all ones, and \(\mathbb {I}\) is the identity matrix. In Fig. 1a, we show the QC-distance of noisy (dephased) CTQWs on a complete graph with \(N=5\) nodes, for different values of the decoherence rate \(\gamma \). All the nodes of a complete graph are equivalent, and hence without loss of generality and for future convenience we set the initial state to \(\rho _N=\vert N\rangle \!\langle N\vert \).

At the initial time \(D_{\text {QC}}(0)=0\), the distance grows with time, and eventually reaches an horizontal asymptote, not necessarily monotonically depending on the value of \(\gamma \). This asymptote does not depend on the decoherence parameter which, in turn, only affects the rate of convergence of \(D_{\text {QC}}\) to its asymptotic value. In particular, as \(\gamma \) gets bigger the distance converges more rapidly. For vanishing \(\gamma \), the QC-distance for the noiseless case is recovered. We observe that intrinsic decoherence indeed brings the quantum walk closer to the classical random walk as the decoherence rate increases. However, due to the degeneracy of the spectrum, the QW does not become fully classical and the QC-distance remains positive at all times \(t>0\). Notice that the qualitative behaviour of the QC-distance does not depend on the number of nodes *N*, i.e. a behaviour similar to that of Fig. 1 is observed for every *N*.

Let us now prove that the asymptotic value of the QC-distance does not depend on the rate \(\gamma \), but rather it is a function of *N* only. The Laplacian spectrum of an *N*-node complete graph reads \(\lambda _1=\cdots =\lambda _{N-1} = N\) and \(\lambda _N=0\). The corresponding eigenvectors are

In order to obtain the stationary quantum-evolved state in Eq.(9), we first need to find the values of *n* and *p* for which \(\lambda _n=\lambda _p\) holds. For the complete graph, this condition is satisfied when \(n\ne N \wedge p\ne N\) or \(n = p = N\). Hence, it follows that the stationary quantum state reads

where we used \(\langle N\vert \lambda _k \rangle =\frac{1}{\sqrt{N}}\,\, \forall k\). We can now compute the asymptotic value of the QC-distance:

Indeed the asymptotic value does not depend on the decoherence rate \(\gamma \), but only on the number of nodes *N*. Notice that for \(N\rightarrow \infty \) we retrieve the asymptote of the noiseless case, i.e. \(1-\frac{1}{N}\). This suggests that, as the size of the complete graph grows, the effect of intrinsic decoherence becomes negligible.

### 3.2 Cycle graph

The cycle graph is a one-dimensional lattice with periodic boundary conditions, i.e. it is a regular graph with vertex degrees \(d_j=2\quad \forall j\). The Laplacian for a *N*-node cycle graph is a tridiagonal matrix with off-diagonal elements \(L_{j,j+1}=L_{j+1,j}=-1\) \( \forall j=1,\dots ,N-1\) and diagonal elements \(L_{jj}=2\) \(\forall j\). As for the previous case, and without loss of generality, we choose \(\rho _j=|{N}\rangle \langle {N}|\) as initial localized state of the walker.

The behaviour of \(D_{\text {QC}}(t)\) is qualitatively similar to the complete graph, see Fig. 1b, i.e. intrinsic decoherence brings the quantum evolution closer to the classical one compared to the noiseless case. However, although some quantumness is lost, the degeneracy of the Laplacian’s spectrum prevents a full classicalization of the QW. Depending on the value of \(\gamma \), the QC-distance may reach its asymptotic value non-monotonically, i.e. displaying a maximum at shorter times, or monotonically. We observed that, for a fixed number of nodes, the asymptotic value of \(D_{\text {QC}}(t)\) is smaller with respect to the case of the complete graph.

To calculate the asymptotic value \(D_{\text {QC}}(t_{\infty })\), we need \({\mathcal {E}}_\infty [\rho _j]\) and, in turn, the values of *n* and *p* that fulfil the condition \(\lambda _n=\lambda _p\). The eigenvalues of the *N*-cycle graph Laplacian are \(\lambda _n=2\left[ 1-\cos \left( \frac{2\pi n}{N}\right) \right] \), with \(n=1,\cdots ,N\), and the corresponding eigenstates coincide with those in Eq. (12). In particular, \(\lambda _n=\lambda _p\) is satisfied when \(n=p\) or when \(n=N-p\) with \(p\ne N\). In order to explicitly evaluate \(D_{\text {QC}}(t_{\infty })\), we study the odd and the even *N* cases separately, since when *N* is even there are \(\frac{N}{2}-1\) couples of equal eigenvalues, while when *N* is odd there are \(\frac{N-1}{2}\) of them. With this in mind, we obtain the stationary quantum state

where \(p\ne \frac{N}{2}\) if *N* is even. After diagonalizing \({\mathcal {E}}_\infty [\rho _j]\), the asymptote of the QC-distance can be easily computed. When *N* is even, we obtain

while for odd *N* we get

In both cases, we see that as \(N \rightarrow \infty \) the asymptotic value of the QC-distance approaches \(\frac{1}{2}\), as opposed to the complete graph case, where the asymptote reaches unity in the same limit, see Fig. 2 for a comparison.

### 3.3 Star graph

As opposed to the complete graph and the cycle graph, the nodes of a star graph are not all equivalent, but are rather grouped into two categories: the central node, which we will refer to as \(\vert 1\rangle \), and the remaining \(N-1\) external nodes. Consequently, the computation of the \(D_{\text {QC}}(t)\) involves an optimization over these two distinct classes of initial states, consistently with the definition in Eq. (6). Figure 1(c) shows the QC-distance of a quantum walker moving on a star graph. Note that the points of the plot where the function is not differentiable correspond to intersections between the QC-distance of a walker initially localized in the centre node and that of a walker whose initial state is an external node. We first study the system with initial state \(\rho _1=|{1}\rangle \langle {1}|\) and denote this distance with \(D_{\text {QC}}(t,c)\), where *c* stands for the central node. Numerical computation of the distance between the classical and the quantum noisy evolution shows that \(D_{\text {QC}}(t,c)\) is the same as the one obtained for the complete graph. The same happens in the noiseless case, where analytic calculations of the quantum and classical transition probabilities for the two graphs have the same expressions [35], as long as the walker is initialized in the central vertex of the star graph. Moreover, it is possible to show numerically that the QC-distance for the complete graph is equivalent to that of a larger class of *N*-nodes graphs, namely those obtained from an *N*-dimensional complete graph by removing edges that are not connected to the central node \(\vert 1\rangle \). This holds true for the noiseless scenario [36] as well as for the dynamics induced by intrinsic decoherence. If, instead, the initial state is localized on any of the external nodes, we obtain a different distance, that we call \(D_{\text {QC}}(t, e)\) (see the inset of Fig 1(c)). In particular, while at short times the maximum of the \(D_{\text {QC}}(t)\) is obtained by starting from the central node, at intermediate times it can be obtained by starting from one of the external nodes, depending on the value of the parameter \(\gamma \). At longer times, the central node always proves to be the optimal initialization for the walker. We can indeed compute the asymptotic value of \(D_{\text {QC}}(t, e)\) through Eq. (10). Given the Laplacian eigenvalues \(\lambda _1=\cdots =\lambda _{N-2} = 1\), \(\lambda _{N-1}=0\) \(\lambda _N=N\), and its respective eigenvectors [35]:

for \(k=1,\cdots ,N-2\) and

one obtains the following stationary state

The asymptote of the QC-distance, having fixed the initial state to an external node, then reads

which is always lower than the one obtained via the central node as initial state. Hence, the asymptotic distance

of the star graph has the same expression of the asymptotic distance obtained for the complete graph, Eq. (14), as shown in Fig. 2. We can thus conclude that the quantumness of the QW is better preserved asymptotically if the walker is initially localized in the central node of the graph.

## 4 Decoherence in the position basis

Besides energy, the other natural basis to consider for decoherence phenomena is that of the states localized on the graph’s nodes \(\{\left| k\right\rangle \}_{k=1}^N\). In the following, we analyse two different phenomenological models of decoherence in this basis.

We first consider the Haken–Strobl master equation introduced in Eq. (4) which, expressed in the node basis, can be recast into the following form:

Here \(\mathbb {J}\) is the unit matrix, i.e. a matrix whose entries are all 1, \(\mathbb {I}\) is the identity matrix, \(\rho \) is the density matrix expressed in the node basis and \(\circ \) denotes the Hadamard product of matrices (entry-wise product). Notice how the off-diagonal damping terms on the rhs of the equation do not depend on the distance between the sites. These dissipative terms cause off-diagonal elements of the density matrix to vanish asymptotically and, at the same time, they also induce a non-trivial dynamics of the diagonal elements since the commutator in the master equation, i.e. the unitary evolution, couples coherences with populations.

For the decoherence model of Eq. (24), we have computed the QC-distance as a function of time for the complete, cycle and star graphs, and for different values of the decoherence parameter \(\gamma \). Results are shown in Fig. 3.

Some features of \(D_{\text {QC}}(t)\) are general and do not depend on the kind of graph at study. In particular, we find that the quantum-classical distance, after one or two local maxima, goes to zero asymptotically. In turn, this means that any decoherent quantum walk achieves the uniform distribution as a stationary state. It also means that at variance with the model of intrinsic decoherence in the energy basis, the map in Eq. (24) eventually suppresses all quantum features of the QW and turns it into a classical random walk asymptotically. The cuspids in Fig. 3c (the star graph case), arise because of the maximization over classical initial states involved in the definition of \(D_{\text {QC}}(t)\). In particular, for large values of \(\gamma \) and at short times, the central node is the one achieving maximal QC-distance, while after the point where the function is not differentiable, the maximum is obtained by preparing the walker in any of the external nodes. On the other hand, for smaller values of \(\gamma \) the maximization is achieved at all times by initializing the QW in the central node of the star graph.

Also in this case, the decoherence parameter \(\gamma \) affects the rate of convergence of the QC-distance to its horizontal asymptote. However, as opposed to the intrinsic decoherence model, it is no longer true that the rate of convergence of \(D_{\text {QC}}\) to its asymptotic value is monotonic with \(\gamma \). In fact, there is a value of \(\gamma \), dependent on the dimension and on the topology of the graph, after which there is an ’inversion’ and the convergence rate starts decreasing. This fact can be intuitively understood by noticing that for large values of \(\gamma \) the unitary evolution may be neglected and the off-diagonal elements of the density matrix evolve accordingly to an approximately pure exponential decay. In this regime, the system tends to stay in the initial localized state. We thus conclude that, as \(\gamma \) grows beyond a certain threshold, decoherence effects dominate over the unitary evolution and the system is somehow frozen in the initial state. As a result, it takes increasingly more time for the quantum walk to reach the uniform distribution.

The second model of decoherence in the nodes basis that we consider is the quantum stochastic walk, where the classical and the quantum dynamics are mixed at the master equation level via interpolation through a single real parameter *p*, see Eq. (5). We can solve this master equation numerically and compute the QC-distance for different values of the mixing parameter *p*, and for the classes of graphs we have considered in this work. Our numerical results show that this kind of noise is able to classicalize the quantum walk asymptotically, regardless of the topology of the underlying graph and for every value of \(p>0\). The parameter *p* only affects the rate of convergence of \(D_{\text {QC}}(t)\) to zero, as can be seen in Fig. 4.

The larger the value of *p* the faster the QW transitions into a classical random walk, since the classical component in the dynamics has a larger weight in this case, according to Eq. (5). We point out that, contrary to the two previous models of decoherence, in this case we find that the QC-distance of a quantum walker initially localized in the central node of a star graph does not coincide with that of a quantum walk on a complete graph. The discontinuity in the QC-distance derivative in Fig. 4c signals a change of the initial state that satisfies the maximization condition in the definition (6). In particular, while at short times this condition is achieved by having the initial state localized in the central node, at larger times this is attained by initializing the walker to any of the external nodes. As a final remark, we want to highlight the shorter time-scale in Fig. 4 with respect to Fig. 3, indicating a faster classicalization dynamics. The QSW model appears to be the less robust to decoherence for the topologies and choice of parameters considered.

## 5 Conclusions

Noise is a challenge to practical realization of quantum walks. Indeed, the presence of noise induces decoherence, and loss of quantum features, which are critical to achieve quantum advantages, i.e. to outperform protocols and algorithms based on classical random walks.

In this work, upon employing a fidelity-based measure of dynamical distance, we have addressed the effects of decoherence on CTQWs. In particular, we have investigated quantitatively the differences between the dynamics of a quantum walker in the presence of noise, and that of the corresponding classical walker on a given graph. In this way, we have been able to assess if, and to which extent, decoherence makes the quantum walker to turn into a classical incoherent random walker.

We have considered three different models of decoherence for a CTQW. We have first focused on intrinsic decoherence, i.e. decoherence in the energy eigenbasis, and linked the degeneracy of the Laplacian spectrum to the impossibility for this kind of noise to completely classicalize the quantum walker. In this case, we have analytically characterized the asymptotic behaviour of the quantum-classical distance and discussed how the connectivity of the graph influences the rate of convergence to its asymptotic value. We have then shifted our attention towards two models of decoherence in the node basis, namely the quantum dynamics arising from the Haken–Strobl master equation, and the quantum stochastic walk model, which interpolates between the classical and quantum RW by means of a single real mixing parameter. In both cases, we have shown that all quantum features of the dynamics are suppressed asymptotically, i.e. the quantum walker behaves like a classical random walker in the long-time limit.

Our analysis has shown that, at least for the considered classes of graphs, the qualitative features of the quantum-classical distance are not influenced by the topology of the graph, and by the number of its nodes. In addition, the asymptotic value of the quantum-classical distance does not depend on the relevant noise parameter. Finally, we have found that there is no universal behaviour of the classicalization rate as a function of the decoherence rates. A larger decoherence corresponds to a faster convergence of the QC-distance to its asymptotic value for intrinsic decoherence and the QSW models, whereas in the Haken–Strobl scenario, larger values of the decoherence rate induce localization of the walker.

Our results contribute to deepen the knowledge on the effects of noise and decoherence on quantum walks, and pave the way to engineering of decoherence, as well as to identifying regimes where its effects may be mitigated.

## Data Availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

## References

Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys.

**44**(4), 307 (2003)Venegas-Andraca, S.E.: Quantum walks: a comprehensive review. Quant. Inf. Process.

**11**(5), 1015 (2012)Xia, F., Liu, J., Nie, H., Fu, Y., Wan, L., Kong, X.: Random walks: a review of algorithms and applications. IEEE Trans. Emerg. Top. Comput. Intell.

**4**(2), 95 (2020)Kadian, K., Garhwal, S., Kumar, A.: Quantum walk and its application domains: a systematic review. Comput. Sci. Rev.

**41**, 100419 (2021)Frigerio, M., Benedetti, C., Olivares, S., Paris, M.G.A.: Generalized quantum-classical correspondence for random walks on graphs. Phys. Rev. A

**104**, L030201 (2021)Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A

**48**, 1687 (1993)Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A

**58**, 915 (1998)Mülken, O., Blumen, A.: Continuous-time quantum walks: models for coherent transport on complex networks. Phys. Rep.

**502**(2–3), 37 (2011)Mülken, O., Pernice, V., Blumen, A.: Quantum transport on small-world networks: a continuous-time quantum walk approach. Phys. Rev. E

**76**, 051125 (2007)Razzoli, L., Paris, M.G.A., Bordone, P.: Transport efficiency of continuous-time quantum walks on graphs. Entropy

**23**(1), 85 (2021)Maciel Cássio, M., Mendes, C.F.O., Strunz, W.T., Galiceanu, M.: Quantum transport on generalized scale-free networks. Phys. Rev. A

**102**, 032219 (2020)Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf.

**1**(04), 507 (2003)Portugal, R.: Quantum Walks and Search Algorithms. Springer International Publishing, Berlin (2018)

Childs, A.M.: Universal computation by quantum walk. Phys. Rev. Lett.

**102**, 180501 (2009)Wang, K., Shi, Y., Xiao, L., Wang, J., Joglekar, Y.N., Xue, P.: Experimental realization of continuous-time quantum walks on directed graphs and their application in PageRank. Optica

**7**(11), 1524 (2020)Herrman, R., Wong, T.G.: Simplifying continuous-time quantum walks on dynamic graphs. Quantum Inf. Process.

**21**(2), 54 (2022)Inui, N., Kasahara, K., Konishi, Y., Konno, N.: evolution of continuous-time quantum random walks on circles. Fluct. Noise Lett.

**05**(01), L73 (2005)Plenio, M.B., Huelga, S.F.: Dephasing-assisted transport: quantum networks and biomolecules. New J. Phys.

**10**(11), 113019 (2008)Caruso, F., Chin, A.W., Datta, A., Huelga, S.F., Plenio, M.B.: Highly efficient energy excitation transfer in light-harvesting complexes: the fundamental role of noise-assisted transport. J. Chem. Phys.

**131**(10), 105106 (2009)Schreiber, A., Cassemiro, K.N., Potoček, V., Gábris, A., Jex, I., Silberhorn, C.: Decoherence and disorder in quantum walks: from ballistic spread to localization. Phys. Rev. Lett.

**106**, 180403 (2011)Benedetti, C., Buscemi, F., Bordone, P., Paris, M.G.A.: Non-Markovian continuous-time quantum walks on lattices with dynamical noise. Phys. Rev. A

**93**, 042313 (2016)Tamascelli, D., Segati, A., Olivares, S.: Dephasing assisted transport on a biomimetic ring structure. Int. J. Quant. Inf.

**15**(08), 1740006 (2017)Benedetti, C., Rossi, M.A.C., Paris, M.G.A.: Continuous-time quantum walks on dynamical percolation graphs. Europhys. Lett.

**124**(6), 60001 (2019)Kurt, A., Rossi, M.A.C., Piilo, J.: Efficient quantum transport in a multi-site system combining classical noise and quantum baths. New J. Phys.

**22**(1), 013028 (2020)Gualtieri, V., Benedetti, C., Paris, M.G.A.: Quantum-classical dynamical distance and quantumness of quantum walks. Phys. Rev. A

**102**, 012201 (2020)Frigerio, M., Benedetti, C., Olivares, S., Paris, M.G.A.: Quantum-classical distance as a tool to design optimal chiral quantum walks. Phys. Rev. A

**105**, 032425 (2022)Milburn, G.J.: Intrinsic decoherence in quantum mechanics. Phys. Rev. A

**44**, 5401 (1991)Haken, H., Strobl, G.: An exact solvable model for coherent and incoherent Excitation Motion. Z. Phys.

**262**, 135 (1973)Whitfield, J.D., Rodríguez-Rosario, C.A., Aspuru-Guzik, A.: Quantum stochastic walks: a generalization of classical random walks and quantum walks. Phys. Rev. A

**81**, 022323 (2010)B. Nica,

*A Brief Introduction to Spectral Graph Theory*(EMS Textbooks in Mathematics, 2018)Wong, T.G., Tarrataca, L., Nahimov, N.: Laplacian versus adjacency matrix in quantum walk search. Quantum Inf. Proc.

**15**(10), 4029 (2016)Candeloro, A., Razzoli, L., Cavazzoni, S., Bordone, P., Paris, M.G.A.: Continuous-time quantum walks in the presence of a quadratic perturbation. Phys. Rev. A

**102**, 042214 (2020)Rebentrost, P., Mohseni, M., Kassal, I., Lloyd, S., Aspuru-Guzik, A.: Environment-assisted quantum transport. New J. Phys.

**11**, 033003 (2009)Caruso, F.: Universally optimal noisy quantum walks on complex networks. New J. Phys.

**16**, 055015 (2014)Xu, X.P.: Exact analytical results for quantum walks on star graphs. J. Phys. A Math. Theor.

**42**(11), 115205 (2009)Razzoli, L., Bordone, P., Paris, M.G.A.: Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems. J. Phys. A Math. Theor.

**55**(26), 265303 (2022)Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl.

**197–198**, 143 (1994)

## Acknowledgements

Work done under the auspices of INdAM-GNFM. G.B. is part of the AppQInfo MSCA ITN which received funding from the EU Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 956071.

## Funding

Open access funding provided by Universitá degli Studi di Milano within the CRUI-CARE Agreement.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Appendices

### Appendix

### A Graph symmetries and degenerate eigenvalues

In the following, we show that the survival of quantum coherences in the asymptotic quantum state Eq. (9), due to the presence of degenerate Laplacian eigenstates, can be traced back to the symmetries of the underlying graph. The symmetries of a graph *G*(*V*, *E*) are, in turn, related to the group \(\Gamma (G)\) of its automorphisms, i.e. the group of permutations \(\sigma : V\rightarrow V\) of the set of vertices *V* such that \( \left( \sigma (n),\sigma (p)\right) \in E \Leftrightarrow (n,p) \in E \), \(\forall n,p \in V\), i.e. adjacency is preserved. It follows, for example, that for the complete graph every permutation of the nodes identifies a symmetry, while, for the star graph, only permutations of the external nodes are automorphisms. The connection between the symmetries of a graph and the degeneracy of its spectrum is provided by the following theorem [37]:

**Theorem**: Let *G*(*V*, *E*) be a connected graph and \(\Gamma (G)\) the group of its automorphisms. If a permutation in \(\Gamma (G)\) contains *s* odd cycles and *t* even cycles, then the Laplacian matrix will have at most \(s+2t\) simple eigenvalues.

It follows that if a permutation in \(\Gamma (G)\) contains a cycle with at least 3 elements, the spectrum of *L* is degenerate and the QC-distance will not reach zero asymptotically. We stress that this is only a sufficient condition for degeneracy. This explains why the QC-distance in Eq. (10) does not reach zero for the classes of graphs studied in this paper, where it is particularly easy to find symmetries involving three or more nodes. On the other hand, we expect to witness a different behaviour with other classes of graphs, such as random graphs. In this case, especially for large values of *N*, it is likely that the only symmetries of the graph will be permutations decomposable in cycles of 1 and 2 nodes only. Consequently, in this situation the theorem only tells us that *L* will have at most *N* simple eigenvalues, hence it is of no help.

## Rights and permissions

**Open Access** This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

## About this article

### Cite this article

Bressanini, G., Benedetti, C. & Paris, M.G.A. Decoherence and classicalization of continuous-time quantum walks on graphs.
*Quantum Inf Process* **21**, 317 (2022). https://doi.org/10.1007/s11128-022-03647-x

Received:

Accepted:

Published:

DOI: https://doi.org/10.1007/s11128-022-03647-x