Quantum random walk is the quantum counterpart of a classical random walk. The classical
random walk concept has long been used as a computational framework for designing …

This is a textbook about quantum walks and quantum search algorithms. The readers will
take advantage of the pedagogical aspects and learn the topics faster and make less effort …

The development of universal quantum computers has achieved remarkable success in
recent years, culminating with the quantum supremacy reported by Google. Now it is …

In the typical model, a discrete-time coined quantum walk searching the 2D grid for a
marked vertex achieves a success probability of O (1/\log N) O (1/log N) in O (N\log N) O (N …

This article proposes the first discrete-time implementation of Rydberg quantum walk in multi-
dimensional spatial space that could ideally simulate different classes of topological …

Very much as its classical counterpart, quantum cellular automata are expected to be a great
tool for simulating complex quantum systems. Here we introduce a partitioned model of …

Quantum walks are recognizably useful for the development of new quantum algorithms, as
well as for the investigation of several physical phenomena in quantum systems. Actual …

The quantum-walk-based spatial search problem aims to find a marked vertex using a
quantum walk on a graph with marked vertices. We describe a framework for determining …

The defining feature of memoryless quantum walks is that they operate on the vertex space
of a graph and therefore can be used to produce search algorithms with minimal memory …

Quantum computing promises to improve the information processing power to levels
unreachable by classical computation. Quantum walks are heading the development of …