X Qiang, Y Wang, S Xue, R Ge, L Chen, Y Liu… - Science …, 2021 - science.org
Applications of quantum walks can depend on the number, exchange symmetry and indistinguishability of the particles involved, and the underlying graph structures where they …
Strongly Regular Graphs Page 1 Chapter 9 Strongly Regular Graphs 9.1 Strongly regular graphs A graph (simple, undirected, and loopless) of order v is called strongly regular with …
We show that the quantum dynamics of interacting and noninteracting quantum particles are fundamentally different in the context of solving a particular computational problem …
AE Brouwer, H Van Maldeghem - 2022 - books.google.com
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph …
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the problems …
BL Douglas, JB Wang - Journal of Physics A: Mathematical and …, 2008 - iopscience.iop.org
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of …
X Qiang, S Ma, H Song - arXiv preprint arXiv:2404.04178, 2024 - arxiv.org
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important …
N Konno, I Sato - Quantum Information Processing, 2012 - Springer
We present an explicit formula for the characteristic polynomial of the transition matrix of the discrete-time quantum walk on a graph via the second weighted zeta function. As …
In this paper we explore an interesting relationship between discrete-time quantum walks and the Ihara zeta function of a graph. The paper commences by reviewing the related …