Related papers: Framework for discrete-time quantum walks and a sy…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
We show how to search N items arranged on a $\sqrt{N}\times\sqrt{N}$ grid in time $O(\sqrt N \log N)$, using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous…
In this paper we present closed-form expressions for the wave function that governs the evolution of the discrete-time quantum walk on a line when the coin operator is arbitrary. The formulas were derived assuming that the walker can either…
We present a new scheme for a discrete-time quantum walk on two- and three-dimensional lattices using a two-state particle. We use different Pauli basis as translational eigestates for different axis and show that the coin operation, which…
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…
We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the presence of decoherence. While continuum limits of two state…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
Accurate modeling of the temporal evolution of asset prices is crucial for understanding financial markets. We explore the potential of discrete-time quantum walks to model the evolution of asset prices. Return distributions obtained from a…
We implement the discrete-time quantum walk model using the continuous-time evolution of the Hamiltonian that includes both the shift and the coin generators. Based on the Trotter-Suzuki first-order approximation, we consider an…
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyse the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of…
We analyze final-time dependent discrete-time quantum walks in one dimension. We compute asymptotics of the return probability of the quantum walk by a path counting approach. Moreover, we discuss a relation between the quantum walk and the…
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…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
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…
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…
Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker…
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…
We define the discrete-time quantum walk on complex networks and utilize it for community detection. We numerically show that the quantum walk with the Fourier coin is localized in a community to which the initial node belongs. Meanwhile,…
We study the dynamics of discrete-time quantum walk using quantum coin operations, $\hat{C}(\theta_1)$ and $\hat{C}(\theta_2)$ in time-dependent periodic sequence. For the two-period quantum walk with the parameters $\theta_1$ and…