Related papers: Implementation of multi-walker quantum walks with …
Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…
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…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
The effect of decoherence on the continuous-time quantum walk on the hypercube is revisited. Previously, an exact solution was found for a decoherence model that preserved the effective tensor-product form of the dynamics. Here a new model…
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…
Quantum walks are powerful tools not only to construct the quantum speedup algorithms but also to describe specific models in physical processes. Furthermore, the discrete time quantum walk has been experimentally realized in various…
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…
Discrete-time quantum walks (DTQWs) in random artificial electric and gravitational fields are studied analytically and numerically. The analytical computations are carried by a new method which allows a direct exact analytical…
We show a simulation of quantum random walks with multiple photons using a staggered array of 50/50 beam splitters with a bank of detectors at any desired level. We discuss the multiphoton interference effects that are inherent to this…
The origin of non-classicality in physical systems and its connection to distinctly quantum features such as entanglement and coherence is a central question in quantum physics. This work analyses this question theoretically and…
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…
Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular…
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
Quantum walks have been shown to have a wide range of applications, from artificial intelligence, to photosynthesis, and quantum transport. Quantum stochastic walks (QSWs) generalize this concept to additional non-unitary evolution. In this…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
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…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
We propose a variation of the quantum walk on a circle in phase space by conjoining the Hadamard coin flip with simultaneous displacement of the walker's location in phase space and show that this generalization is a proper quantum walk…