Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous-time quantum walks (CTQWs) on graphs. In this paper, we analyze the short-time asymptotics of CTQWs. In recent studies, it was shown that for the classical diffusion process the short-time asymptotics of the transition probabilities follows power laws whose exponents are given by the usual combinatorial distances of the nodes. Inspired by this result, we perform a similar analysis for CTQWs in both closed and open systems, including time-dependent couplings. For time-reversal symmetric coherent quantum evolutions, the short-time asymptotics of the transition probabilities is completely determined by the topology of the underlying graph analogously to the classical case, but with a doubled power-law exponent. Moreover, this result is robust against the introduction of on-site potential terms. However, we show that time-reversal symmetry-breaking terms and noncoherent effects can significantly alter the short-time asymptotics. The analytical formulas are checked against numerics, and excellent agreement is found. Furthermore, we discuss in detail the relevance of our results for quantum evolutions on particular network topologies.
Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous-time quantum walks (CTQWs) on graphs. In this paper, we analyze the short-time asymptotics of CTQWs. In recent studies, it was shown that for the classical diffusion process the short-time asymptotics of the transition probabilities follows power laws whose exponents are given by the usual combinatorial distances of the nodes. Inspired by this result, we perform a similar analysis for CTQWs in both closed and open systems, including time-dependent couplings. For time-reversal symmetric coherent quantum evolutions, the short-time asymptotics of the transition probabilities is completely determined by the topology of the underlying graph analogously to the classical case, but with a doubled power-law exponent. Moreover, this result is robust against the introduction of on-site potential terms. However, we show that time-reversal symmetry-breaking terms and noncoherent effects can significantly alter the short-time asymptotics. The analytical formulas are checked against numerics, and excellent agreement is found. Furthermore, we discuss in detail the relevance of our results for quantum evolutions on particular network topologies.
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments, edges of the graph appear or disappear with a given probability, as in percolation. We treat this problem in a strong noise limit. We focus on the case when the time interval between the subsequent changes of the graph tends to zero. We derive explicit formulae for the general evolution in this limit. We find that the percolation in this limit causes an effective time rescaling. Independently of the graph and the initial state of the walk, the time is rescaled by the probability of keeping an edge. Both the individual trajectories for a single system and average properties with a superoperator formalism are discussed. We give an analytical proof for our theorem and we also present results from the numerical simulations of the phenomena for different graphs. We also analyze the effect of finite step-size on the evolution.
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.
We investigate the genuinely quantum features of continuous-time quantum walks by combining a single-time and a multi-time quantifier of nonclassicality. On the one hand, we consider the quantum-classical dynamical distance DQC(t), which measures the departure of the time-evolved quantum state of a continuous-time quantum walk from the classical state of a random walk on the same graph. On the other, we analyse the joint probability distributions associated with sequential measurements of the walker's position, assessing their violation of the classical Kolmogorov consistency conditions via a dedicated quantifier Kˉ(t). We demonstrate a quadratic short-time scaling of Kˉ(t), which differs from the known linear scaling of DQC(t), but, as the latter, is fully determined by the degree of the initially occupied node and is independent of the global graph topology. At longer times, instead, Kˉ(t) exhibits a pronounced topology-driven behavior: it is strongly suppressed on complete graphs while remaining finite and oscillatory on cycles, in contrast with the almost topology-independent asymptotics of DQC(t). We then extend the analysis to Markovian open-system dynamics, focusing on dephasing in the position basis (Haken-Strobl model) and in the energy basis (intrinsic decoherence). Site dephasing drives both quantifiers to zero, with the decay of Kˉ(t) controlled by the spectral gap of the corresponding Lindblad generator. By contrast, energy-basis dephasing preserves a finite asymptotic value of Kˉ(t), depending on the overlap structure of the Laplacian eigenspaces with the site basis.
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.
Quantum walks can be defined in two quite distinct ways: discrete-time and continuous-time quantum walks (DTQWs and CTQWs). For classical random walks, there is a natural sense in which continuous-time walks are a limit of discrete-time walks. Quantum mechanically, in the discrete-time case, an additional ``coin space'' must be appended for the walk to have nontrivial time evolution. Continuous-time quantum walks, however, have no such constraints. This means that there is no completely straightforward way to treat a CTQW as a limit of a DTQW, as can be done in the classical case. Various approaches to this problem have been taken in the past. We give a construction for walks on d-regular, d-colorable graphs when the coin flip operator is Hermitian: from a standard DTQW we construct a family of discrete-time walks with a well-defined continuous-time limit on a related graph. One can think of this limit as a ``coined'' continuous-time walk. We show that these CTQWs share some properties with coined DTQWs. In particular, we look at a spatial search by a DTQW over the two-dimensional (2D) torus (a grid with periodic boundary conditions) of size $\sqrt{N}\ifmmode\times\else\texttimes\fi{}\sqrt{N}$, where it was shown that a coined DTQW can search in time O(NlogN), but a standard CTQW takes $\mathrm{\ensuremath{\Omega}}(N)$ time to search for a marked element. The continuous limit of the DTQW search over the 2D torus exhibits the O(NlogN) scaling, like the coined walk it is derived from. We also look at the effects of graph symmetry on the limiting walk, and show that the properties are similar to those of the DTQW as shown in Krovi and Brun, Phys. Rev. A 75, 062332 (2007).
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation, and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian generator of CTQWs, which are the complex phases along the loops of the underlying graph, was acknowledged for its interest in optimizing or suppressing transport on specific topologies. We argue that the quantum-classical distance, a figure of merit which was introduced to capture the difference in dynamics between a CTQW and its classical, stochastic counterpart, guides the optimization of parameters of the Hamiltonian to achieve better quantum transport on cycle graphs and spatial search for the quantum speed limit without an oracle on complete graphs, the latter also implying fast uniform mixing. We compare the variations of this quantity with the 1-norm of coherence and the inverse participation ratio, showing that the quantum-classical distance is linked to both, but in a topology-dependent relation, which is key to spot the most interesting quantum evolution in each case.