Related papers: Continuous-time quantum walks on dynamical percola…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph.…
We demonstrate that continuous time quantum walks on several types of branching graphs, including graphs with loops, are identical to quantum walks on simpler linear chain graphs. We also show graph types for which such equivalence does not…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
We derive simple expressions that relate the noise and correlation properties of a general time-dependent quantum conductor to the wave functions of the system. The formalism provides a practical route for numerical calculations of quantum…
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. {[}Phys. Rev. Lett. \textbf{93}, 180601(2004){]} which exhibits…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is…
We introduce a fidelity-based measure $\text{D}_{\text{CQ}}(t)$ to quantify the differences between the dynamics of classical (CW) and quantum (QW) walks over a graph. We provide universal, graph-independent, analytic expressions of this…
Random walks are fundamental models of stochastic processes with applications in various fields including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…