Related papers: Multi-target quantum walk search on Johnson graph
In this paper, we propose an extension of quantum searches on graphs driven by quantum walks to simplicial complexes. To this end, we newly define a quantum walk on simplicial complex which is an alternative of preceding studies by authors.…
This paper studies the search for a single arc in a graph using the Szegedy walk. Arc search can be interpreted as finding a quantum particle not only in its position but also with a specific internal state. The quantum walk employed in…
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk…
We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such…
Random walks on graphs are an essential primitive for many randomised algorithms and stochastic processes. It is natural to ask how much can be gained by running $k$ multiple random walks independently and in parallel. Although the cover…
This paper proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic…
The discrete-time quantum walk (QW) has been extensively and intensively investigated for the last decade, whose coin operator is defined by a unitary matrix. We extend the QW to a walk determined by a unitary matrix whose component is…
Topological data analysis is a rapidly developing area of data science where one tries to discover topological patterns in data sets to generate insight and knowledge discovery. In this project we use quantum walk algorithms to discover…
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this context, the notion of quantum hitting time is very important,…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
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…
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…
We propose a quantum-electrodynamics scheme for implementing the discrete-time, coined quantum walk with the walker corresponding to the phase degree of freedom for a quasi-magnon field realized in an ensemble of nitrogen-vacancy centres in…
We examine the time dependent amplitude $ \phi_{j}\left( t\right)$ at each vertex $j$ of a continuous-time quantum walk on the cycle $C_{n}$. In many cases the Lissajous curve of the real vs. imaginary parts of each $ \phi_{j}\left(…
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…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix; namely the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk;…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Quantum state engineering, namely the generation and control of arbitrary quantum states, is drawing more and more attention due to its wide applications in quantum information and computation. However, there is no general method in theory,…