Related papers: Accelerated first detection in discrete-time quant…
The ability of quantum walks to evolve in a superposition of distinct quantum states has been used as a resource in quantum communication protocols. Under certain settings, the $k$-cycle discrete-time quantum walks\,(DTQW) are known to…
The role of classical noise in quantum walks (QW) on integers is investigated in the form of discrete dichotomic random variable affecting its reshuffling matrix parametrized as a SU2)/U(1) coset element. Analysis in terms of quantum…
Discrete-time quantum walk (DTQW) represents a convenient mathematical framework for describing the motion of a particle on a discrete set of positions when this motion is conditioned by the values of certain internal degrees of freedom,…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…
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…
We present a quantum-dynamical framework for identifying structurally important residues in proteins based on continuous time quantum walks (CTQWs) on weighted residue interaction networks constructed from experimentally resolved…
Implementation of discrete-time quantum walk (DTQW) with superconducting qubits is difficult since on-chip superconducting qubits cannot hop between lattice sites. We propose an efficient protocol for the implementation of DTQW in circuit…
We study a discrete-time quantum walk in presence of a detector at $x_D$ initially. The detector here is repeatedly removed after a span of $t_R$, the removal time, and reinserted at random locations. Two relocation rules are considered…
In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, we…
First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to…
Continuous-time quantum walks have proven to be an extremely useful framework for the design of several quantum algorithms. Often, the running time of quantum algorithms in this framework is characterized by the quantum hitting time: the…
The discrete time quantum walk (DTQW) is a universal quantum computational model. Significant relationships between discrete and corresponding continuous quantum systems have been studied since the work of Pauli and Feynman. This work…
The dynamics of a discrete-time quantum walk (DTQW) can be realized within a purely classical interacting particle system composed of some boxes and a large but finite number of balls, and can, in principle, be implemented in a tabletop…
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 universal model of quantum computation. Quantum walks is now a…
Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…
Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical…
In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $\theta$ by performing…
Four new centrality measures for directed networks based on unitary, continuous-time quantum walks (CTQW) in $n$ dimensions -- where $n$ is the number of nodes -- are presented, tested and discussed. The main idea behind these methods…
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 insulators. Using distance-selective exchange-interaction…
We propose a new multi-dimensional discrete-time quantum walk (DTQW), whose continuum limit is an extended multi-dimensional Dirac equation, which can be further mapped to the Schr\"{o}dinger equation. We show in two ways that our DTQW is…