相关论文: Investigation of continuous-time quantum walk on r…

In this paper, we consider a spectral analysis of the Correlated Random Walk (CRW) on the path. We apply an analytical method for the Quantum Walk to CRW. For the isospectral coin cases, we obtain all of the eigenvalues and the…

The conventional spectral mapping theorem for quantum walks can only be applied for walks employing a shift operator whose square is the identity. This theorem gives most of the eigenvalues of the time evolution $U$ by lifting 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…

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…

We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…

It is shown that the hopping of a single excitation on certain triangular spin lattices with non-uniform couplings and local magnetic fields can be described as the projections of quantum walks on graphs of the ordered Hamming scheme of…

A variety of transport processes in natural and man-made systems are intrinsically random. To model their stochasticity, lattice random walks have been employed for a long time, mainly by considering Cartesian lattices. However, in many…

Open Quantum Walks (OQWs), originally introduced by S. Attal, are quantum generalizations of classical Markov chains. Recently, natural continuous time models of OQW have been developed by C. Pellegrini. These models, called Continuous Time…

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for $N$-fold star power graph, which are invariant under the quantum…

We present a finite-element approach for computing the aggregate scattering matrix of a network of linear coherent scatterers. These might be optical scatterers or more general scattering coins studied in quantum walk theory. While…

The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum algorithm for solving the element distinctness problem being…

Quantum walk (QW) in presence of lattice disorders leads to a multitude of interesting phenomena, such as Anderson localization. While QW has been realized in various optical and atomic systems, its implementation with superconducting…

We present an approach using quantum walks (QWs) to redistribute ultracold atoms in an optical lattice. Different density profiles of atoms can be obtained by exploiting the controllable properties of QWs, such as the variance and the…

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 computational complexity of spatial search by continuous-time…

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…

We show by general arguments that networks whose density of states contains few highly degenerate eigenvalues result in inefficient performances of continuous-time quantum walks (CTQW) over these networks, while systems whose eigenvalues…

In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…

We consider coherent exciton transport modeled by continuous-time quantum walks (CTQWs) on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance $m$ in the cycle graph. LRIC has a symmetric…