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 …

Quantum walks, the quantum mechanical counterpart of classical random walks, is an
advanced tool for building quantum algorithms that has been recently shown to constitute a …

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-
level benchmark suite and insightful evaluation metrics for characterizing the properties of …

Quantum walks of correlated particles offer the possibility of studying large-scale quantum
interference; simulating biological, chemical, and physical systems; and providing a route to …

Quantum walk represents one of the most promising resources for the simulation of physical
quantum systems, and has also emerged as an alternative to the standard circuit model for …

Random walks have been employed in virtually every science related discipline to model
everyday phenomena such as biochemical reaction pathways and DNA synapsis …

Applications of quantum walks can depend on the number, exchange symmetry and
indistinguishability of the particles involved, and the underlying graph structures where they …

A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined
by analogy to classical random walk. The quantum walker is a particle that moves from a …

The present disclosure provides a fast approximate as well as exact hierarchical network
storage and retrieval system and method for encoding and indexing graphs or networks as …

We study discrete-time quantum walks on the line and on general undirected graphs with
two interacting or noninteracting particles. We introduce two simple interaction schemes and …