TY - JOUR

T1 - Equivalent Laplacian and adjacency quantum walks on irregular graphs

AU - Wong, Thomas G.

AU - Lockhart, Joshua

N1 - Publisher Copyright:
© 2021 American Physical Society

PY - 2021/10

Y1 - 2021/10

N2 - The continuous-time quantum walk is a particle evolving by Schrödinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead. It is well known that these quantum walks are equivalent when the graph is regular, i.e., when each vertex has the same number of neighbors. If the graph is irregular, however, the quantum walks evolve differently. In this paper, we show that for some irregular graphs, if the particle is initially localized at a certain vertex, the probability distributions of the two quantum walks are identical, even though the amplitudes differ. We analytically prove this for a graph with five vertices and a graph with six vertices. By simulating the walks on all 1 018 689 568 simple, connected, irregular graphs with 11 vertices or less, we found 64 graphs with this notion of equivalence. We also give eight infinite families of graphs supporting these equivalent walks.

AB - The continuous-time quantum walk is a particle evolving by Schrödinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead. It is well known that these quantum walks are equivalent when the graph is regular, i.e., when each vertex has the same number of neighbors. If the graph is irregular, however, the quantum walks evolve differently. In this paper, we show that for some irregular graphs, if the particle is initially localized at a certain vertex, the probability distributions of the two quantum walks are identical, even though the amplitudes differ. We analytically prove this for a graph with five vertices and a graph with six vertices. By simulating the walks on all 1 018 689 568 simple, connected, irregular graphs with 11 vertices or less, we found 64 graphs with this notion of equivalence. We also give eight infinite families of graphs supporting these equivalent walks.

UR - http://www.scopus.com/inward/record.url?scp=85118375928&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85118375928&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.104.042221

DO - 10.1103/PhysRevA.104.042221

M3 - Article

AN - SCOPUS:85118375928

VL - 104

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1050-2947

IS - 4

M1 - 042221

ER -