Recurrence in the classical random walk is well known and described by the Pólya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under certain circumstances the quantum walker may also return to an arbitrary initial quantum state in a finite number of steps. Quantum state revivals in quantum walks on circles using coin operators which are constant in time and uniform across the path have been described before but only incompletely. In this paper we find the general conditions for which full-quantum state revival will occur.
Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a coin operator can be constructed to generate a quantum walk having full revivals with any desired period. From the point of view of quantum computation and simulations, these coin operators can be useful in implementing quantum walks which oscillate between any two states with a finite periodicity.
Recurrence of a random walk is described by the Polya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full-revival of its quantum state. Localization for two dimensional quantum walks is known to exist in the sense of non-vanishing probability distribution in the asymptotic limit. We show on the example of the 2-D Grover walk that one can exploit the effect of localization to construct stationary solutions. Moreover, we find full-revivals of a quantum state with a period of two steps. We prove that there cannot be longer cycles for…
We investigate the role of a time and spin-dependent phase shift on the evolution of one-dimensional discrete-time quantum walks. By employing Floquet engineering, a time and spin-dependent phase shift ($ϕ$) is imprinted onto the walker's wave function while it shifts from one lattice site to another. For a quantum walk driven by the standard protocol we show with our numerical simulations that complete revivals with equal periods occur in the probability distribution of the walk for rational values of the phase factor, i.e., $ϕ/2π= p/q$. For an irrational value of $ϕ/2π$ our results show part…
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two periodic revivals of the walker distribution. In our beam-displacer interferometer, the walk corresponds to movement between discretely separated transverse modes of the field serving as lattice sites, and the time-dependent coin flip is effected by implementing a different angle between the optical axis of half-wave plate and the light propagation at each step…
The phenomenon of quantum revivals resulting from the self-interference of wave packets has been observed in several quantum systems and utilized widely in spectroscopic applications. Here, we present a combined analytical and numerical study on the generation of orientational quantum revivals (OQRs) exclusively using a single-cycle THz pulse. As a proof of principle, we examine the scheme in the linear polar molecule HCN with experimentally accessible pulse parameters and obtain strong field-free OQR without requiring the condition of the sudden-impact limit. To visualize the involved quantum…
We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycl…
We provide an explanation of recent experimental results of Xue et al., where full revivals in a time-dependent quantum walk model with a periodically changing coin are found. Using methods originally developed for "electric" walks with a space-dependent, rather than a time-dependent coin, we provide a full explanation of the observations of Xue et al. We extend the analysis from periodic time-dependence to quasi-periodic behaviour with periods incommensurate to the step size. Spectral analysis, one of the principal tools for the study of electric walks, fails for time-dependent systems, but w…
Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption probability computations. In this paper, we shift our sights from the local phenomena of absorption probabilities to the global behavior of finite absorbing quantum walks in one dimension. We conduct our analysis by approximating the eigenbasis of the associated absorbing quantum walk operator matrix Q_n where n is the lattice size. The conditional probability d…
We probe the dynamic evolution of a Stark wave packet in cesium using weak half-cycle pulses (HCP's). The state-selective field ionization(SSFI) spectra taken as a function of HCP delay reveal wave packet dynamics such as Kepler beats, Stark revivals and fractional revivals. A quantum-mechanical simulation explains the results as multi-mode interference induced by the HCP.
We study the coherent exciton transport on Apollonian networks generated by simple iterative rules. The coherent exciton dynamics is modeled by continuous-time quantum walks and we calculate the transition probabilities between two nodes of the networks. We find that the transport depends on the initial nodes of the excitation. For networks less than the second generation the coherent transport shows perfect revivals when the initial excitation starts at the central node. For networks of higher generation, the transport only shows partial revivals. Moreover, we find that the excitation is most…
In this work we reconsider the problem discussed by Caldeira and Leggett (CL), and generalize their results for a quantum oscillator coupled bilinearly to a reservoir with dense discrete spectrum of harmonic oscillators. We show that for such systems dynamic evolution of any state of the CL Hamiltonian consists of recurrence cycles with partial revivals of the initial state amplitude. This revival or Loschmidt echo appears in each cycle due to reverse (from the reservoir) transitions (not existing in the limit of a macroscopic bath). Width and number of the Loschmidt echo components increase w…
Fractional revival occurs between two vertices in a graph if a continuous-time quantum walk unitarily maps the characteristic vector of one vertex to a superposition of the characteristic vectors of the two vertices. This phenomenon is relevant in quantum information in particular for entanglement generation in spin networks. We study fractional revival in graphs whose adjacency matrices belong to the Bose-Mesner algebra of association schemes. A specific focus is a characterization of balanced fractional revival (which corresponds to maximal entanglement) in graphs that belong to the Hamming …
Quantum recurrence theorem holds for quantum systems with discrete energy eigenvalues and fails to hold in general for systems with continuous energy. We show that during quantum walk process dominated by interference of amplitude corresponding to different paths fail to satisfy the complete quantum recurrence theorem. Due to the revival of the fractional wave packet, a fractional recurrence characterized using quantum Pólya number can be seen.
In this paper, we study coherent exciton transport of continuous-time quantum walks on star graph. Exact analytical results of the transition probabilities are obtained by means of the Gram-Schmidt orthonormalization of the eigenstates. Our results show that the coherent exciton transport displays perfect revivals and strong localization on the initial node. When the initial excitation starts at the central node, the transport on star graph is equivalent to the transport on a complete graph of the same size.
A classical lazy random walk on cycles is known to mix to the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibit strong non-uniform mixing properties. Our results include the following: - The instantaneous distribution of a quantum walk on most even-length cycles is never uniform. - The average distribution of a quantum walk on any Abelian circulant graph is never uniform. As a corollary, the average distribution of a quantum walk on any standard circulant graph, such as the cycles, complete graphs, and even hypercubes, is never uniform.
In the note we show how the choice of the initial states can influence the evolution of time-averaged probability distribution of the quantum walk on even cycles.
We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its asymptotic behaviour when the length of the cycle tends to infinity. We also demonstrate that for a carefully chosen initial state, the limiting distribution of a quantum walk on cycle can lie further away from the uniform distribution than its initial state.
When confined to a topological environment consisting of a cycle coupled with a half-line, quantum walks exhibit long-term statistical tendencies which differ dramatically from the tendencies of classical random walks in the same environment. In particular, as suggested by numerical simulations, the probability distribution of the walker's position resolves, in part, into a non-vanishing distribution on the cycle and, in part, into a ballistic distribution on the half-line. By contrast, for a classical random walk, the probability distribution of the walker's position tends always to vanish on…
We present analytical treatment of quantum walks on multidimensional hyper-cycle graphs. We derive the analytical expression of the probability distribution for strong and weak decoherence regimes. Upper bound to mixing time is obtained.
Classical and quantum walks on some finite paths are introduced. It is shown that these walks have explicit solutions given in terms of exceptional Krawtchouk polynomials and their properties are explored. In particular, fractional revival is shown to take place in the corresponding quantum walks.
We calculated reduced density characteristic matrix (RDCM) for quantum walk on cycles (QWC) to study asymptotic properties of the most general form of quantum walk on cycles with general $U(2)$ coin operator. As an example, entanglement temperature for general initial state has been calculated and compared to previous results. Also, we have modified RDCM to derive analytical expression for general form of limiting distribution (LD).
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the memoryless model.
Fractional revival is a quantum transport phenomenon important for entanglement generation in spin networks. This takes place whenever a continuous-time quantum walk maps the characteristic vector of a vertex to a superposition of the characteristic vectors of a subset of vertices containing the initial vertex. A main focus will be on the case when the subset has two vertices. We explore necessary and sufficient spectral conditions for graphs to exhibit fractional revival. This provides a characterization of fractional revival in paths and cycles. Our work builds upon the algebraic machinery d…
Recently, a new model of quantum walk, utilizing recycled coins, was introduced; however little is yet known about its properties. In this paper, we study its behavior on the cycle graph. In particular, we will consider its time averaged distribution and how it is affected by the walk's "memory parameter" - a real parameter, between zero and eight, which affects the walk's coin flip operator. Despite an infinite number of different parameters, our analysis provides evidence that only a few produce non-uniform behavior. Our analysis also shows that the initial state, and cycle size modulo four …
Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on cyclotomic field. This method shows a necessary condition for the coin operator of quantum walks to have the finite period. Moreover, we reveal the period T_N of two kinds of typical quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, i…
We study the dynamics of microscopic quantum correlations, viz., bipartite entanglement and quantum discord between nearest neighbor sites, in Ising spin chain with a periodically varying external magnetic field along the transverse direction. Quantum correlations exhibit periodic revivals with the driving cycles in the finite-size chain. The time of first revival is proportional to the system size and is inversely proportional to the maximum group velocity of Floquet quasi-particles. On the other hand, the local quantum correlations in the infinite chain may get saturated to non-zero values a…
The definition of entanglement temperature for the quantum walk on the line is extended to $N$-cycles, which are more amenable to a physical implementation. We show that, for these systems, there is a linear connection between the thermalization time and the mixing time, and also that these characteristic times become insensitive to the system size when $N$ is larger than a few units
We consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the stationary case, it is possible to asymnptotically reach a uniform distribution among the nodes of the associated graph.
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.
In this paper, we consider periodicity for space-inhomogeneous quantum walks on the cycle. For isospectral coin cases, we propose a spectral analysis. Based on the analysis, we extend the result for periodicity for Hadamard walk to some isospectral coin cases. For non-isospectral coin cases, we consider the the system that uses only one general coin at the origin and the identity coin at the other sites. In this case, we show that the periodicity of the general coin at the origin determines the periodicity for the whole system.
We study the effect of small decoherence in continuous-time quantum walks on long-range interacting cycles, which are constructed by connecting all the two nodes of distance m on the cycle graph. In our investigation, each node is continuously monitored by an individual point contact, which induces the decoherence process. We obtain the analytical probability distribution and the mixing time upper bound. Our results show that, for small rates of decoherence, themixing time upper bound is independent of distance parameter m and is proportional to inverse of decoherence rate.
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk's random sampling yields an arbitrary speedup in query complexity over the classical random …
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C_4, C_6 and C_8 for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of C_4 could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for ap…
Open quantum walks often lead to a classical asymptotic behavior. Here, we look for a simple open quantum walk whose asymptotic behavior can be non-classical. We consider a discrete-time quantum walk on n-cycle subject to a random coin-dependent phase shift at a single position. This finite system, whose evolution is described by only two Kraus operators, can exhibit all kinds of asymptotic behavior observable in quantum Markov chains: it either evolves towards a maximally mixed state, or partially mixed state, or tends to an oscillatory motion on an asymptotic orbit. We find that the asymptot…
Quantum walk acts obviously different from its classical counterpart, but decoherence will lessen and close the gap between them. To understand this process, it is necessary to investigate the evolution of quantum walk under different situation of decoherence. In this article, we study a non-Markovian decoherent quantum walk on a line. In the short time regime, the behavior of the walk deviates from both idea quantum walks and classical random walks. The position variance as a measure of quantum walk starts oscillating from the first several steps and tends to be linear on time and showing a d…
In this paper, we consider decoherence in continuous-time quantum walks on long-range interacting cycles (LRICs), which are the extensions of the cycle graphs. For this purpose, we use Gurvitz's model and assume that every node is monitored by the corresponding point contact induced the decoherence process. Then, we focus on large rates of decoherence and calculate the probability distribution analytically and obtain the lower and upper bounds of the mixing time. Our results prove that the mixing time is proportional to the rate of decoherence and the inverse of the distance parameter ($\emph{…
We formulate continuous time quantum walks (CTQW) in a discrete quantum mechanical phase space. We define and calculate the Wigner function (WF) and its marginal distributions for CTQWs on circles of arbitrary length $N$. The WF of the CTQW shows characteristic features in phase space. Revivals of the probability distributions found for continuous and for discrete quantum carpets do manifest themselves as characteristic patterns in phase space.
For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that the mixing behavior tends, in the long-run, to a uniform distribution, regardless of the initial state of the system and irrespective of the parity of the number of nodes $N$. These results confirm the findings of previous authors who arrived at similar conclusions through extensive numerical simulations. In particular, we infer that the mixing time $\bar{M(ε)…
We prove analytical results showing that decoherence can be useful for mixing time in a continuous-time quantum walk on finite cycles. This complements the numerical observations by Kendon and Tregenna (Physical Review A 67 (2003), 042315) of a similar phenomenon for discrete-time quantum walks. Our analytical treatment of continuous-time quantum walks includes a continuous monitoring of all vertices that induces the decoherence process. We identify the dynamics of the probability distribution and observe how mixing times undergo the transition from quantum to classical behavior as our decoher…
The propagation by continuous time quantum walks (CTQWs) on one-dimensional lattices shows structures in the transition probabilities between different sites reminiscent of quantum carpets. For a system with periodic boundary conditions, we calculate the transition probabilities for a CTQW by diagonalizing the transfer matrix and by a Bloch function ansatz. Remarkably, the results obtained for the Bloch function ansatz can be related to results from (discrete) generalized coined quantum walks. Furthermore, we show that here the first revival time turns out to be larger than for quantum carpets…
We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + λL^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $λL^2$ motivated by its potential use to introduce next-nearest-neighbor hopping. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry. First, we investigate the dynamics of an initially localized walker. Then, we devote attention to estimating the perturbation parameter $λ$ using only a snapshot of the walker dynamics. Our analysis shows …
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the asymptotic behavior of the system. When $N$ is odd, the density matrix of the system tends, in the long run, to the maximally mixed state, independent of the initial state. When $N$ is even, although the behavior of the system is not necessarily asymptotically stationary, in this case too an explicit formulation is obtained of the asymptotic dynamics of the sys…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point contact. We derive the analytical expression of the probability distribution along the cycle. Upper bound estimate to mixing time is shown.
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreading rate and mixing times respectively. The addition of decoherence to the quantum walk produces a more uniform distribution on the line, and even faster mixing on the cycle by removing the need for time-averaging to obtain a uniform distribution. We calculate numerically the entanglement between the coin and the position of the quantum walker and show that the optimal decoherence rates are such that all the entanglement is just removed by the time the final measurement is made.
Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks than for classical random walks. It is however not known how fast would interacting quantum particles propagate on different graphs. Here we present our results on hitting times for quantum walks of identical particles on cycle graphs, and relate the results to our previous findings on the usefulness of identical interacting particles in quantum information t…
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs…
In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a general coin or swapping shift operator. In this paper, we derive exact solutions for the limiting probability distribution of quantum walks using a general coin and swapping shift operator on cycles for the first time. Based on the exact solutions, we show how to generate symmetric quantum walks and determine the condition under which a symmetric quantum walk…
This study investigate the unitary equivalence classes of quantum walks on cycles. We show that unitary equivalence classes of quantum walks on a cycle with $N$ vertices are parameterized by $2N$ real parameters. Moreover, the ranges of two of the parameters are restricted, and the ranges depend on the parity of $N$.
The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks are good candidates to be implemented on the available quantum computers. In this work, we implement discrete-time quantum walks with one and two interacting walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum computers. We are able to obtain meaningful results using the cy…
Augmenting the unitary transformation which generates a quantum walk by a generalized phase gate G is a symmetry for both noisy and noiseless quantum walk on a line, in the sense that it leaves the position probability distribution invariant. However, this symmetry breaks down in the case of a quantum walk on an n-cycle, and hence can be regarded as a probe of the walk topology. Noise, modelled here as phase flip and generalized amplitude damping channels, tends to restore the symmetry because it classicalizes the walk. However, symmetry restoration happens even in the regime where the walker …
Following the recent observation of wave function revivals in large Rydberg atom quantum simulators, much effort has focused on understanding the emergence of many-body scars in non-integrable quantum systems. Here we explore the origin of scarred wavefunction revivals in a family of models obtained by deforming the graph adjacency matrix of the PXP model - the effective model of Rydberg atoms in the strong Rydberg blockade regime. We consider deformations that either enhance the Rydberg constraint, ultimately resulting in an effective tight-binding model of two hypercubes joined at a single v…
