We study the transport properties of continuous-time quantum walks (CTQWs) over finite two-dimensional structures with a given number of randomly placed bonds and with different aspect ratios (ARs). Here, we focus on the transport from, say, the left side to the right side of the structure where absorbing sites are placed. We do so by analyzing the long-time average of the survival probability of CTQWs. We compare the results to the classical continuous-time random walk case (CTRW). For small ARs (landscape configurations) we observe only small differences between the quantum and the classical transport properties, i.e., roughly the same number of bonds is needed to facilitate the transport. However, with increasing ARs (portrait configurations) a much larger number of bonds is needed in the CTQW case than in the CTRW case. While for CTRWs the number of bonds needed decreases when going from small ARs to large ARs, for CTQWs this number is large for small ARs, has a minimum for the square configuration, and increases again for increasing ARs. We explain our findings by analyzing the average eigenstates of the corresponding structures: The participation ratios allow us to distinguish between localized and nonlocalized (average) eigenstates. In particular, for large ARs we find for CTQWs that the eigenstates are localized for bond numbers exceeding the bond numbers needed to facilitate transport in the CTRW case. Thus, a rather large number of bonds is needed in order for quantum transport to be efficient for large ARs.
We study the transport properties of continuous-time quantum walks (CTQWs) over finite two-dimensional structures with a given number of randomly placed bonds and with different aspect ratios (ARs). Here, we focus on the transport from, say, the left side to the right side of the structure where absorbing sites are placed. We do so by analyzing the long-time average of the survival probability of CTQWs. We compare the results to the classical continuous-time random walk case (CTRW). For small ARs (landscape configurations) we observe only small differences between the quantum and the classical transport properties, i.e., roughly the same number of bonds is needed to facilitate the transport. However, with increasing ARs (portrait configurations) a much larger number of bonds is needed in the CTQW case than in the CTRW case. While for CTRWs the number of bonds needed decreases when going from small ARs to large ARs, for CTQWs this number is large for small ARs, has a minimum for the square configuration, and increases again for increasing ARs. We explain our findings by analyzing the average eigenstates of the corresponding structures: The participation ratios allow us to distinguish between localized and nonlocalized (average) eigenstates. In particular, for large ARs we find for CTQWs that the eigenstates are localized for bond numbers exceeding the bond numbers needed to facilitate transport in the CTRW case. Thus, a rather large number of bonds is needed in order for quantum transport to be efficient for large ARs.
In this paper, we consider continuous-time quantum walks (CTQWs) on a one-dimensional ring lattice of N nodes in which every node is connected to its 2m nearest neighbors ( m on either side). In the framework of the Bloch function ansatz, we calculate the space-time transition probabilities between two nodes of the lattice. We find that the transport of CTQWs between two different nodes is faster than that of the classical continuous-time random walks (CTRWs). The transport speed, which is defined by the ratio of the shortest path length and propagating time, increases with the connectivity parameter m for both CTQWs and CTRWs. For fixed parameter m , the transport of CTRWs gets slower with the increase of the shortest distance while the transport (speed) of CTQWs turns out to be a constant value. In the long-time limit, depending on the network size N and connectivity parameter m , the limiting probability distributions of CTQWs show various patterns. When the network size N is an even number, the probability of being at the original node differs from that of being at the opposite node, which also depends on the precise value of parameter m .
We model quantum transport, described by continuous-time quantum walks (CTQWs), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport efficiencies are defined in terms of the exact and the average return probabilities, as well as by the mean survival probability when absorbing traps are present. In the case of gaskets, localization can be identified already for small networks (generations). For carpets, our numerical results indicate a trend towards localization, but only for relatively large structures. The comparison of gaskets and carpets further implies that, distinct from the corresponding classical continuous-time random walk, the spectral dimension does not fully determine the evolution of the CTQW.
Continuous time quantum walks (CTQWs) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRWs). For one special graph, where a recent analysis showed that in a particular direction of propagation the penetration of the graph is faster by CTQWs than by CTRWs, we demonstrate that in another direction of propagation the opposite is true. In this case a CTQW initially localized at one site displays a slow transport. We furthermore show that when the CTQW's initial condition is a totally symmetric superposition of states of equivalent sites, the transport gets to be much more rapid.
Recent findings suggest that processes such as the excitonic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy transfer one has to leave the classical, master-equation-type formalism and advance towards an increasingly quantum-mechanical picture, while still retaining a local description of the complex network of molecules involved in the transport, say through a tight-binding approach. Interestingly, the continuous time random walk (CTRW) picture, widely employed in describing transport in random environments, can be mathematically reformulated to yield a quantum-mechanical Hamiltonian of tight-binding type; the procedure uses the mathematical analogies between time-evolution operators in statistical and in quantum mechanics: The result are continuous-time quantum walks (CTQWs). However, beyond these formal analogies, CTRWs and CTQWs display vastly different physical properties. In particular, here we focus on trapping processes on a ring and show, both analytically and numerically, that distinct configurations of traps (ranging from periodical to random) yield strongly different behaviors for the quantal mean survival probability, while classically (under ordered conditions) we always find an exponential decay at long times.
Recent findings suggest that processes such as the electronic energy transfer through the photosynthetic antenna display quantal features, aspects known from the dynamics of charge carriers along polymer backbones. Hence, in modeling energy transfer one has to leave the classical, masterequation-type formalism and advance towards an increasingly quantum-mechanical picture, while still retaining a local description of the complex network of molecules involved in the transport, say through a tight-binding approach. Interestingly, the continuous time random walk (CTRW) picture, widely employed in describing transport in random environments, can be mathematically reformulated to yield a quantummechanical Hamiltonian of tight-binding type; the procedure uses the mathematical analogies between time-evolution operators in statistical and in quantum mechanics: The result are continuoustime quantum walks (CTQWs). However, beyond these formal analogies, CTRWs and CTQWs display vastly different physical properties. In particular, here we focus on trapping processes on a ring and show, both analytically and numerically, that distinct configurations of traps (ranging from periodical to random) yield strongly different behaviours for the quantal mean survival probability, while classically (under ordered conditions) we always find an exponential decay at long times.
We show by general arguments that networks whose density of states contains few highly degenerate eigenvalues result in inefficient performances of continuous-time quantum walks (CTQW) over these networks, while systems whose eigenvalues all have the same degeneracy lead to very efficient transport. We exemplify our results by considering CTQW and, for comparison, its classical counterpart, continuous-time random walks, over simple structures, whose eigenvalues and eigenstates can be calculated analytically. Extensions to more complicated, hyper-branched networks are discussed.