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 is not entirely classical, because noise also has the effect of desensitizing the operation G to the walk topology. We discuss methods for physical implementation, and talk about the wider implications to condensed matter systems.
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.
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.
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…
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.
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$.
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.
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…
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.
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…
In this paper, we determine periodicity of quantum walks defined by mixed paths and mixed cycles. By the spectral mapping theorem of quantum walks, consideration of periodicity is reduced to eigenvalue analysis of $η$-Hermitian adjacency matrices. First, we investigate coefficients of the characteristic polynomials of $η$-Hermitian adjacency matrices. We show that the characteristic polynomials of mixed trees and their underlying graphs are same. We also define $n+1$ types of mixed cycles and show that every mixed cycle is switching equivalent to one of them. We use these results to discuss pe…
The present paper treats the period T_N of the Hadamard walk on a cycle C_N with N vertices. Dukes (2014) considered the periodicity of more general quantum walks on C_N and showed T_2 =2, T_4=8, T_8=24 for the Hadamard walk case. We prove that the Hadamard walk does not have any period except for his case, i.e., N=2, 4, 8. Our method is based on a path counting and cyclotomic polynomials which is different from his approach based on the property of eigenvalues for unitary matrix that determines the evolution of the walk.
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{…
The relation between the geometry of refrigeration cycles and their performance is explored. The model studied is based on a coupled spin system. Small cycle times termed sudden refrigerators, develop coherence and inner friction. We explore the interplay between coherence and energy of the working medium employing a family of sudden cycles with decreasing cycle times. At the point of minimum ratio between energy and coherence the cycle changes geometry. This region of cycle times is characterised by short circuit cycles where heat is dissipated both to the hot and cold baths. We rationalise t…
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 ability of quantum walks to evolve in a superposition of distinct quantum states has been used as a resource in quantum communication protocols. Under certain settings, the $k$-cycle discrete-time quantum walks\,(DTQW) are known to recur to its initial state after every $t_r$ steps. We first present a scheme to optically realize any $k$-cycle DTQW using $J$-plate, orbital angular momentum\,(OAM) sorters, optical switch, and optical delay line. This entangles the polarization and OAM degrees of freedom\,(DoF) of a single photon. Making use of this recurrence phenomena of $k$-cycle DTQW and …
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a method for network exploration which is robust against trapping.
In this paper we extend the study of three state lively quantum walks on cycles by considering the coin operator as a linear sum of permutation matrices, which is a generalization of the Grover matrix. First we provide a complete characterization of orthogonal matrices of order $3\times 3$ which are linear sum of permutation matrices. Consequently, we determine several groups of complex, real and rational orthogonal matrices. We establish that an orthogonal matrix of order $3\times 3$ is a linear sum of permutation matrices if and only if it is permutative. Finally we determine period of livel…
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…
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…
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…
In this paper, we study the impact of single extra link on the coherent dynamics modeled by continuous-time quantum walks. For this purpose, we consider the continuous-time quantum walk on the cycle with an additional link. We find that the additional link in cycle indeed cause a very different dynamical behavior compared to the dynamical behavior on the cycle. We analytically treat this problem and calculate the Laplacian spectrum for the first time, and approximate the eigenvalues and eigenstates using the Chebyshev polynomial technique and perturbation theory. It is found that the probabili…
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of our expository article is on analyzing these processes using the Laplace transform on the stochastic recurrences. The resulting time evolution equations, classical versus quantum, are strikingly similar in form, although dissimilar in behavior. We also provide comparisons with analyses performed using spectral methods.
We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle and hypercube. We find high sensitivity to decoherence, increasing with the number of steps in the walk, as the particle is becoming more delocalised with each step. However, the effect of a small amount of decoherence is to enhance the properties of the quantum walk that are desirable for the development of quantum algorithms. Specifically, we observe a highly uniform distribution on the line, a very fast mixing time on the cycle, and more reliable hitting times across the hypercube.
We mainly study exceptional configuration for coined quantum walk search. For searching on a two-dimensional grid by AKR algorithm, we find some new classes of exceptional configurations that cannot be found by the AKR algorithm effectively and the known diagonal configuration can be regarded as its special case. Meanwhile, we give two modified quantum walk models that can improve the success probability in the exceptional configurations by numerical simulation. Furthermore, we introduce the concept of generalized exceptional configuration and consider search by quantum walk on a cycle with Gr…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk procee…
By adding an extra Hilbert space to Hadamard Quantum Walk on Cycles (QWC), we presented a new type of QWCs called Möbius Quantum Walk (MQW). The new space configuration enables the particle to rotate around the axis of movement. We defined factor $α$ as the Möbius factor which is number of rotations per cycle. So by $α=0$ we have normal QWC, while $α\neq 0$ defines new type of QWC (namely Möbius Quantum Walk). Specially $α= \frac{1}{2}$ defines a structure similar to Möbius strip. We analytically investigated this new type of QW and found that by tuning the parameter $α$ we can reach uniform d…
We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines and the second one is assembled by a periodic embedding of the cycles in $\mathbb{Z}$. We show that both of them have essentially the same eigenvalues induced by the existence of cycles in the infinite graphs. The eigenspace of the homological structure appears as so called {\it localization} in the Grover walks, in that the walk is partially trapped by the homological structure. On the other hand, the difference of the absolutely continuous par…
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 …
The Grover walk is one of the most well-studied quantum walks on graphs. In this paper, we investigate its periodicity to reveal the relationship between the quantum walk and the underlying graph, focusing particularly on the characterization of graphs exhibiting a periodic Grover walk. Graphs having a periodic Grover walk with periods of $2, 3, 4$, and $5$ have previously been characterized. It is expected that graphs exhibiting a periodic Grover walk with odd period correspond to cycles with odd length. We address that problem and are able to perfectly characterize the class of graphs exhibi…
It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even-numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos contr…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average displacement of the walker as a function of time. Indeed, a fast growth of the average displacement can be advantageously exploited to build up efficient search algorithms. By means of analytical and numerical investigations, we show that the finiteness and the inhomogeneity of the substrate jointly weaken the quantum walk performance. We further highlight the inter…
In this paper, we consider stationary measures of discrete-time three-state quantum walks including the Fourier and Grover walks in the one-dimensional lattice. We give non-uniform stationary measures by solving the corresponding eigenvalue problem. Our new method is based on a reduced matrix, which is different from the generating function approach in our previous work. As a corollary, the Fourier walk on the cycle has a stationary measure with a periodicity.
We address continuous-time quantum walks on graphs, and discuss whether and how quantum-limited measurements on the walker may extract information on the tunnelling amplitude between the nodes of the graphs. For a few remarkable families of graphs, we evaluate the ultimate quantum bound to precision, i.e. we compute the quantum Fisher information (QFI), and assess the performances of incomplete measurements, i.e. measurements performed on a subset of the graph's nodes. We also optimize the QFI over the initial preparation of the walker and find the optimal measurement achieving the ultimate pr…
