Related papers: High robustness quantum walk search algorithm with…
In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…
Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…
In this paper we investigate one dimensional quantum walks with two-step memory, which can be viewed as an extension of quantum walks with one-step memory. We develop a general formula for the amplitudes of the two-step-memory walk with…
The Metropolis-Hastings algorithm is a cornerstone of Markov Chain Monte Carlo methods, underpinning a wide range of applications in computational physics, Bayesian inference, and machine learning. Quantum variants of Metropolis-Hastings…
The analysis of a physical problem simplifies considerably when one uses a suitable coordinate system. We apply this approach to the discrete-time quantum walks with coins given by $2j+1$-dimensional Wigner rotation matrices (Wigner walks),…
Quantum random walks (QRWs) are random processes in which the resulting probability density of the "walker" state, whose movement is governed by a "coin" state, is described in a non-classical manner. Previously, Q-plates have been used to…
The most elementary quantum walk is characterized by a 2-dimensional unitary coin flip matrix, which can be parameterized by 4 real variables. The influence of the choice of the coin flip matrix on the time evolution operator is analysed in…
In this paper, we develop a generic controlled alternate quantum walk model (called CQWM-P) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and then construct a quantum-inspired hash function (called…
We study the quantum walk in momentum space using a coin arranged in quasi-periodic sequences following a Fibonacci prescription. We build for this system a classical map based on the trace of the evolution operator. The sub-ballistic…
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…
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is…
We perform generalized measurements of a qubit by realizing the qubit as a coin in a photonic quantum walk and subjecting the walker to projective measurements. Our experimental technique can be used to realize photonically any rank-1…
We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead…
We elaborate on a model of quantum random walk proposed by Hillery et. al., and Jeong et. al., which uses the multiports for quantum "coin tossing". The dynamics of this model is analyzed for the case when the multiports are arranged on the…
For the ever-growing field of quantum information processing, large-scale, efficient multi-port interferometers serving as photonic processors are required. In this context, the suitability of quantum walks as the interferometric base for…
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…