Related papers: QSWalk: a Mathematica package for quantum stochast…
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challenging issue. In this paper, we study implementation of CTQWs…
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…
Open quantum walks (OQW) are formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and for dissipative quantum state preparation. In…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
The "quantum walk" has emerged recently as a paradigmatic process for the dynamic simulation of complex quantum systems, entanglement production and quantum computation. Hitherto, photonic implementations of quantum walks have mainly been…
A quantum master equation of the Lindblad form is obtained in this paper by considering the spontaneous wave-packet reduction. Different classical equations can be derived after exactly mapping such a quantum master equation to a continuous…
We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence, and employ the quantum-classical (QC) dynamical distance as a figure of…
The quantum walk (QW) was introduced as a quantum counterpart of the classical random walk. A number of non-classical properties of the QW have been shown, e.g., ballistic spreading, anti-bellshaped limit density, localization. Since around…
Quantum walks (QWs) represent pillars of quantum dynamics and information processing. They provide a powerful framework for simulating quantum transport, designing search algorithms, and enabling universal quantum computation. Several…
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph…
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In…
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…
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural…
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical…
A discrete-time quantum walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs have familiar physics PDEs as their continuum limit. Some slight generalization of them (allowing for…
We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine quantum and classical reasoning, keeping a classical structure…