We obtain some rigorous results on limit theorems for quantum walks driven by many coins introduced by Brun et al. in the long time limit. The results imply that whether the behavior of a particle is quantum or classical depends on the three factors: the initial qubit, the number of coins M, d= [t/M], where t is time step. Our main theorem shows that we can see a transition from classical behavior to quantum one for a class of three factors.
We present a mathematical formalism for the description of unrestricted quantum walks with entangled coins and one walker. The numerical behaviour of such walks is examined when using a Bell state as the initial coin state, two different coin operators, two different shift operators, and one walker. We compare and contrast the performance of these quantum walks with that of a classical random walk consisting of one walker and two maximally correlated coins as well as quantum walks with coins sharing different degrees of entanglement. We illustrate that the behaviour of our walk with entangled …
We report on the possibility of controlling quantum random walks with a step-dependent coin. The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for this walk including: complete localization, Gaussian and asymmetric likes. In addition, we explore the entropy of walk in two contexts; for probability density distributions over position space and walker's internal degrees of freedom space (coin space). We show that entropy of position space can decrease for a step-dependent coin with the step-number, quite …
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the long time limit, a ballistic behaviour of this walk is observed. This quantum walk retains the quadratic growth of the variance if the combined operator of the coin rotations is unitary. That confirms no localization exhibits in this walk. This result can be extended to the walk with multiple time-independent rotations on the coin.
We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk characteristics, but we show that quantum walks with partial swapping of coins have complicated yet elegant inter-walker correlations. Specifically we study the joint position distribution of the reduced two-walker state after tracing out the coins and analyze total, classical and quantum correlations in terms of the mutual information, the quantum mutual information, and…
A coinless, discrete-time quantum walk possesses a Hilbert space whose dimension is smaller compared to the widely-studied coined walk. Coined walks require the direct product of the site basis with the coin space, coinless walks operate purely in the site basis, which is clearly minimal. These coinless quantum walks have received considerable attention recently because they have evolution operators that can be obtained by a graphical method based on lattice tessellations and they have been shown to be as efficient as the best known coined walks when used as a quantum search algorithm. We argu…
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and taking appropriate limits. In this work, we produce the evolution of a coined quantum walk on a generic graph using a continuous-time quantum walk on a larger graph. In addition to expanding the underlying structure, we also have to switch on and off edges during the continuous-time evolution to accommodate the alternation between the shift and coin operator…
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…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the information on coin 1 state at target position only by at most two times of flipping operation. Based on quantum walks with two coins either on the line or on the $N$-circle, we can perfectly transfer any qubit state. In addition, using quantum walks with two coins either on complete graphs or regular graphs, we can first implement perfect qudit state transfer by quan…
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing vertices. Recently, Santos proposed two alternative search algorithms that instead utilize the sign-flip oracle in Grover's algorithm rather than absorbing vertices. In this paper, we show that these two algorithms are exactly equivalent to two algorithms involving coined quantum walks, which are walks on the vertices of the original graph with an internal deg…
We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert space is increased. We observed a non-Gaussian distribution of the walker's final position, thus characterizing a faster spread of the photon wave-packet in comparison to the classical random walk. The walk is realized for many different coin settings and initial states, which opens the way for the implementation of a quantum walk-based search algorithm.
We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves from the quantum walks on the line in the basic scenario (i.e., driven by a single coin). In this work, asymptotic position distributions of the quantum walks are examined. We derive a weak limit for the quantum walks and explicit formulas of stationary probability distribution, whose dependencies on the coin parameter and the initial state of quantum walks a…
We investigated discrete-time quantum walks with an arbitary unitary coin. Here we discover that the average position $<x> =\max(<x> \sin(α+γ)$, while the initial state is $1/\sqrt{2}(\mid0L>+i\mid0R>)$. We prove the result and get some symmetry properties of quantum walks with a U(2) coin with $\mid0L>$ and $\mid0R>$ as the initial state.
We generalize the discrete quantum walk on the line using a time dependent unitary coin operator. We find an analytical relation between the long-time behaviors of the standard deviation and the coin operator. Selecting the coin time sequence allows to obtain a variety of predetermined asymptotic wave-function spreadings: ballistic, sub-ballistic, diffusive, sub-diffusive and localized.
Within a special multi-coin quantum walk scheme we analyze the effect of the entanglement of the initial coin state. For states with a special entanglement structure it is shown that this entanglement can be meausured with the mean value of the walk, which depends on the i-concurrence of the initial coin state. Further on the entanglement evolution is investigated and it is shown that the symmetry of the probability distribution is reflected by the symmetry of the entanglement distribution.
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and a translation conditional on the spin state. Coined quantum walks on the d-dimensional lattice can be treated as special cases of coined quantum walks on d-dimensional Euclidean space. We study quantum walks on d-dimensional Euclidean space and prove that the sequence of rescaled probability distributions in position space associated to the unitary evolutio…
We present a generalized version of the discrete time quantum walk, using the SU(2) operation as the quantum coin. By varying the coin parameters, the quantum walk can be optimized for maximum variance subject to the functional form $σ^2 \approx N^2$ and the probability distribution in the position space can be biased. We also discuss the variation in measurement entropy with the variation of the parameters in the SU(2) coin. Exploiting this we show how quantum walk can be optimized for improving mixing time in an $n$-cycle and for quantum walk search.
We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.
The dimensionality of the internal coin space of discrete-time quantum walks has a strong impact on the complexity and richness of the dynamics of quantum walkers. While two-dimensional coin operators are sufficient to define a certain range of dynamics on complex graphs, higher dimensional coins are necessary to unleash the full potential of discrete-time quantum walks. In this work we present an experimental realization of a discrete-time quantum walk on a line graph that, instead of two-dimensional, exhibits a four-dimensional coin space. Making use of the extra degree of freedom we observe…
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with memory by endowing the walker with multiple recycled coins and using a physical memory function via a history dependent coin flip. By numerical simulation we observe several phenomena. First in one dimension, walkers with memory have persistent quantum ballistic speed up over classical walks just as found in previous studies of multi-coined walks with trivial me…
In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.
Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a quantum walk in alternate directions. We present a formal proof of this correspondence and analyze the behavior of the coin-position entanglement as well as the x-y spatial entanglement in our scheme with respect to the Grover one. We show that our experimentally simpler scheme allows to entangle the two orthogonal directions of the walk more efficiently.
Motivated by the recent work of Patel et al., this paper clarifies a connection between coined quantum walks and quantum cellular automata in a general setting. As a consequence, their result is naturally derived from the connection.
The control of quantum walk is made particularly transparent when the initial state is expressed in terms of the eigenstates of the coin operator. We show that the group-velocity density acquires a much simpler form when expressed in this basis. This allows us to obtain a much deeper understanding of the role of the initial coin state on the dynamics of quantum walks and control it. We find that the eigenvectors of the coin result in an extremal regime of a quantum walk. The approach is illustrated on two examples of quantum walks on a line.
We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph $Γ$ that can be directly converted into Szegedy's model on the subdivision graph of $Γ$ and we describe a method to convert one model into the other. This method improves previous results in literature that need to use the staggered model and the concept of line graph, which are avoided here.
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 …
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple quantum ``coins'' in order to diminish the effects of interference between paths. We find solutions to this system in terms of the single coin random walk, and compare the asymptotic limit of these solutions to numerical simulations. We find exact analytical expressions for the time-dependence of the first two moments, and show that in the long time limit th…
This paper examines the stability of the quantum random walk search algorithm, when the walk coin is constructed by generalized Householder reflection and additional phase shift, against inaccuracies in the phases used to construct the coin. The optimization of the algorithm is done by numerical methods - Monte Carlo, neural networks, and supervised machine learning. The results of numerical simulations show that, with such a construction of the Householder reflection, the algorithm is more stable to inaccuracies in the specific values of these phases, as long as it is possible to control the …
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is required to reverse a quantum walker on a line to its initial positon and the number of interventions increases with the dimensionality of the walk. We present an analytical treatment to prove these results. This reversion scheme can be used to generate periodic bounded quantum walks and to control the locations where particle can be found with highest prob…
We report the position-inhomogeneous quantum walk (IQW) can be utilized to produce the maximal high dimensional entanglement while maintaining the quadratic speedup spread of the wave-function. Our calculations show that the maximal coin-walker entanglement can be generated in any odd steps or asymptotically in even steps, and the nearly maximal entanglement can be obtained in even steps after $2$. We implement the IQW by a stable resource-saving time-bin optical network, in which a polarization Sagnac loop is employed to realize the precisely tunable phase shift. Our approach opens up an effi…
A simple coined quantum walk in one dimension can be characterized by a $SU(2)$ operator with three parameters which represents the coin toss. However, different such coin toss operators lead to equivalent dynamics of the quantum walker. In this manuscript we present the unitary equivalence classes of quantum walks and show that all the nonequivalent quantum walks can be distinguished by a single parameter. Moreover, we argue that the electric quantum walks are equivalent to quantum walks with time dependent coin toss operator.
We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii) topological noise caused by randomly broken links in the linear chain. Similarities and differences in the respective decoherent dynamics of the walker as a function of the probability per unit time of a decoherent event taking place are discussed.
We show that the standard quantum-walk quantum-to-classical transition, characterized by ballistic-to-diffusive spreading of the walker's position, can be controlled by externally modulating the coin state. We illustrate by showing an oscillation between classical diffusive and quantum ballistic spreading using numerical and asymptotically exact closed-form solutions, and we prove that the walker is in a controllable incoherent mixture of classical and quantum walks with a reversible quantum-to-classical transition.
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).
Classical random walks on finite graphs have an underrated property: a walk from any vertex can reach every other vertex in finite time, provided they are connected. Discrete-time quantum walks on finite connected graphs however, can have infinite hitting times. This phenomenon is related to graph symmetry, as previously characterized by the group of direction-preserving graph automorphisms that trivially affect the coin Hilbert space. If a graph is symmetric enough (in a particular sense) then the associated quantum walk unitary will contain eigenvectors that do not overlap a set of target ve…
The Pólya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. Štefaňák, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a specific measurement scheme. The Pólya number of a quantum walk depends in general on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by in…
We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an optimization problem with quantum process fidelity as the cost function. Then we determine the maximal entanglement that can be rigorously generated for any step beyond the second regardless of initial condition with appropriate coin sequences. The simplest coin sequence comprising Hadamard and identity operations is equivalent to the generalized elephant quantum …
We address the performance of a coin-biased quantum walk as a generator for non-classical position states of the walker. We exploit a phenomenon of coherent localisation in the position space --- resulting from the choice of small values of the coin parameter and assisted by post-selection --- to engineer large-size coherent superpositions of distinguishable position states of the walker. The protocol that we design appears to be remarkably robust against both the actual value taken by the coin parameter and strong dephasing-like noise acting on the spatial degree of freedom. We finally illust…
We examine the physical implementation of a discrete time quantum walk with a four-dimensional coin. Our quantum walker is a photon moving repeatedly through a time delay loop, with time being our position space. The quantum coin is implemented using the internal states of the photon: the polarization and two of the orbital angular momentum states. We demonstrate how to implement this physically and what components would be needed. We then illustrate some of the results that could be obtained by performing the experiment.
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete quantum random walks, studied in the literature, have nonetheless used both superposition and a quantum coin toss instruction. This is not necessary, and a discrete quantum random walk without a quantum coin toss instruction is defined and analyzed here. Our construction eliminates quantum entanglement from the algorithm, and the results match those obtaine…
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.
Evolution operators of certain quantum walks possess, apart from the continuous part, also point spectrum. The existence of eigenvalues and the corresponding stationary states lead to partial trapping of the walker in the vicinity of the origin. We analyze the stability of this feature for three-state quantum walks on a line subject to homogenous coin deformations. We find two classes of coin operators that preserve the point spectrum. These new classes of coins are generalizations of coins found previously by different methods and shed light on the rich spectrum of coins that can drive discre…
In this paper we unveil some features of a discrete-time quantum walk on the line whose coin depends on the temporal variable. After considering the most general form of the unitary coin operator, we focus on the role played by the two phase factors that one can incorporate there, and show how both terms influence the evolution of the system. A closer analysis reveals that the probabilistic properties of the motion of the walker remain unaltered when the update rule of these phases is chosen adequately. This invariance is based on a symmetry with consequences not yet fully explored.
We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a two-period quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by one of two matrices. Moreover, limit theorems for two special cases are presented.
Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outco…
We analyze two families of three-state quantum walks which show the localization effect. We focus on the role of the initial coin state and its coherence in controlling the properties of the quantum walk. In particular, we show that the description of the walk simplifies considerably when the initial coin state is decomposed in the basis formed by the eigenvectors of the coin operator. This allows us to express the limit distributions in a much more convenient form. Consequently, striking features which are hidden in the standard basis description are easily identified. Moreover, the dependenc…
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $θ$ by performing measurements on the sole position space of the walker. In this paper, we evaluate the ultimate quantum limits to precision for this class of estimation protocols, and use this result to assess measurement schemes having limited access to the position space of the walker in one dimension. We find that the quantum Fisher information (QFI) of the walker's position spac…
One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, albeit the system is translationally invariant. The effect is dependent on the dimension and the explicit form of the local coin. A four state discrete-time quantum walk on a square lattice is defined by its unitary coin operator, acting on the four dimensional coin Hilbert space. The well known example of the Grover coin leads to a partial trapping, i.e., there exists some escaping initial state for which the probability of s…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and Th. Busch, Phys. Rev. Lett. {\bf 106}, 080502 (2011)]. For a particular initial state of the coin, this walk is able to perfectly reproduce the spatial probability distribution of the non-localized case of the Grover walk. Here, we present a more detailed proof of this equivalence. We also extend the analysis to other initial states, in order to provide a m…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of th…
We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of real-valued weight $l$. We apply this real-valued lackadaisical quantum walk to two problems. First, we analyze it on the line or one-dimensional lattice, showing that it is exactly equivalent to a continuous deformation of the three-state Grover walk with faster ballistic dispersion. Second, we genera…
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.
We propose an alternative definition of an N-dimensional coined quantum walk by generalizing a recent proposal [Di Franco et al., Phys. Rev. Lett. 106, 080502 (2011)]. This N-dimensional alternate quantum walk, AQW_N, in contrast with the standard definition of the N-dimensional quantum walk, QW_N, requires only a coin-qubit. We discuss the quantum diffusion properties of AQW_2 and AQW_3 by analyzing their dispersion relations that reveal, in particular, the existence of diabolical points. This allows us to highlight interesting similarities with other well known physical phenomena. We also de…
We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of classical randomised algorithms. We use this algorithm to search for a marked vertex on a hypercubic lattice in arbitrary dimensions. Our numerical and analytical results match the scaling behaviour of earlier algorithms that use a coin toss instruction.
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis. Besides, the evolution operator can be obtained using a process of lattice tessellation, which is very appealing. The moments of the probability distribution play an important role in the context of quantum walks. The ballistic behavior of the mean square displacement indicates that quantum-walk-based algorithms are faster than random-walk-based ones. In thi…
We study one-dimensional quantum walk with four internal degrees of freedom resulted from two entangled qubits. We will demonstrate that the entanglement between the qubits and its corresponding coin operator enable one to steer the walker's state from a classical to standard quantum-walk behavior, and a novel one. Additionally, we report on self-trapped behavior and perfect transfer with highest velocity for the walker. We also show that symmetry of probability density distribution, the most probable place to find the walker and evolution of the entropy are subject to initial entanglement bet…
Higher-order topological insulators not only exhibit exotic bulk-boundary correspondence principle, but also have an important application in quantum computing. However, they have never been achieved in quantum walk. In this paper, we construct a two-dimensional coinless discrete-time quantum walk to simulate second-order topological insulator with zero-dimensional corner states. We show that both of the corner and edge states can be observed through the probability distribution of the walker after multi-step discrete-time quantum walks. Furthermore, we demonstrate the robustness of the topolo…
