Related papers: Quantum walk search based edge detection of images
We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by Garc\'ia-P\'erez et al., Nat.…
Network centrality has important implications well beyond its role in physical and information transport analysis; as such, various quantum walk-based algorithms have been proposed for measuring network vertex centrality. In this work, we…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
Continuous-time quantum walks provide an alternative method for quantum search problems. Most of the earlier studies confirmed that quadratic speedup exists in some synthetic Hamiltonians, but whether there is quadratic speedup in real…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…
Spatial search on graphs is one of the most important algorithmic applications of quantum walks. To show that a quantum-walk-based search is more efficient than a random-walk-based search is a difficult problem, which has been addressed in…
The spatial search problem aims to find a marked vertex of a finite graph using a dynamic with two constraints: (1) The walker has no compass and (2) the walker can check whether a vertex is marked only after reaching it. This problem is a…
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of…
In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…
Detecting edges is a fundamental problem in computer vision with many applications, some involving very noisy images. While most edge detection methods are fast, they perform well only on relatively clean images. Indeed, edges in such…
Quantum walk is a key operation in quantum computing, simulation, communication and information. Here, we report for the first time the demonstration of quantum walks and localized quantum walks in a new type of optical fibers having a ring…
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose…
We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query complexity that is asymptotically the same, up to log…
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…
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…
Ray tracing algorithm simulates the physical movements of a huge amount of rays to render a high quality image, in which the tracing procedure for each ray can be implemented in parallel. By leveraging the inherent parallelism of quantum…
This paper presents a deterministic search algorithm on complete bipartite graphs. Our algorithm adopts the simple form of alternating iterations of an oracle and a continuous-time quantum walk operator, which is a generalization of…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…