English
Related papers

Related papers: Control of vertex probability via edge-weight modu…

200 papers

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…

Quantum Physics · Physics 2026-05-26 F. S. Luiz , A. K. F. Iwakami , D. H. Moraes , M. C. de Oliveira

Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…

Quantum Physics · Physics 2016-08-10 Thomas G. Wong , Pascal Philipp

We present a detailed analysis of continuous time quantum walks (CTQW) with both position and transition defects defined at a single point in the line. Analytical solutions of both traveling waves or bound states are obtained, which provide…

Quantum Physics · Physics 2015-09-08 Zhi-Jian Li , J. B. Wang

Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains…

Quantum Physics · Physics 2026-03-09 Shyam Dhamapurkar , K. Venkata Subrahmanyam

In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and…

Quantum Physics · Physics 2019-03-01 A. Sett , H. Pan , P. E. Falloon , J. B. Wang

In this paper, we consider continuous-time quantum walks (CTQWs) on finite graphs determined by the Laplacian matrices. By introducing fully interconnected graph decomposition of given graphs, we show a decomposition method for the…

Quantum Physics · Physics 2015-04-20 Yusuke Ide

We study the dynamics of continuous-time quantum walks (CTQW) on networks with highly degenerate eigenvalue spectra of the corresponding connectivity matrices. In particular, we consider the two cases of a star graph and of a complete…

Quantum Physics · Physics 2012-09-19 Anastasiia Anishchenko , Alexander Blumen , Oliver Muelken

We study topological phenomena of quantum walks by implementing a novel protocol that extends the range of accessible properties to the eigenvalues of the walk operator. To this end, we experimentally realise for the first time a split-step…

We investigate the quantum transport of delocalized states in continuous-time quantum walks (CTQWs) on a one-dimensional lattice containing a single defect. The defect is modeled by assigning complex-valued hopping amplitudes to the edges…

Quantum Physics · Physics 2025-11-13 João V. Cordeiro , Eduardo I. Duzzioni , Edgard P. M. Amorim

A quantum particle evolving by Schr\"odinger's equation in discrete space constitutes a continuous-time quantum walk on a graph of vertices and edges. When a vertex is marked by an oracle, the quantum walk effects a quantum search…

Quantum Physics · Physics 2024-10-17 Jonas Duda , Thomas G. Wong

Continuous-time quantum walk (CTQW) on a given graph is investigated by using the techniques of the spectral analysis and inverse Laplace transform of the Stieltjes function (Stieltjes transform of the spectral distribution) associated with…

Quantum Physics · Physics 2007-05-23 M. A. Jafarizadeh , R. Sufiani

Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…

Quantum Physics · Physics 2021-01-04 Tong Wu , J. A. Izaac , Zi-Xi Li , Kai Wang , Zhao-Zhong Chen , Shining Zhu , J. B. Wang , Xiao-Song Ma

We investigate novel transport properties of chiral continuous-time quantum walks (CTQWs) on graphs. By employing a gauge transformation, we demonstrate that CTQWs on chiral chains are equivalent to those on non-chiral chains, but with…

Quantum Physics · Physics 2023-08-25 Yi-Cong Yu , Xiaoming Cai

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…

Quantum Physics · Physics 2009-11-13 Xinping Xu , Feng Liu

Various quantum-walk based algorithms have been proposed to analyse and rank the centrality of graph vertices. However, issues arise when working with directed graphs --- the resulting non-Hermitian Hamiltonian leads to non-unitary…

Quantum Physics · Physics 2017-09-13 J. A. Izaac , J. B. Wang , P. C. Abbott , X. S. Ma

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…

Data Structures and Algorithms · Computer Science 2018-02-01 Tewabe Chekole

Continuous time quantum walks (CTQW) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRW). For one special graph, where a recent analysis showed that in a particular direction of…

Quantum Physics · Physics 2009-11-10 Oliver Muelken , Alexander Blumen

The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…

Quantum Physics · Physics 2023-05-23 Caue F. T. Silva , Daniel Posner , Renato Portugal

This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historical background of CTQW. After a short outline of the…

Quantum Physics · Physics 2015-05-27 Oliver Muelken , Alexander Blumen

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…

Quantum Physics · Physics 2016-12-07 Beat Tödtli , Monika Laner , Jouri Semenov , Beatrice Paoli , Marcel Blattner , Jérôme Kunegis
‹ Prev 1 2 3 10 Next ›