Structural Methods for Quantum State Transfer on Finite and Bounded Infinite Graphs

Structural Methods for Quantum State Transfer on Finite and Bounded Infinite Graphs

Mohammadesmail Nikfar1

1) Ph.D. Graduate in Mathematics, Doctor of Philosophy (Ph.D.) in Pure Mathematics, Mathematics Teacher, District 4 Department of Education, Tehran, Iran

IOI Code : ACCD-ACZKBG
Publication : 10th International Conference on Applied Researches in Science & Engineering (carseconf.com)
Abstract :
    Let (G) be a weighted graph with a countable vertex set. We say that (G) is bounded if there exists a finite constant (C) such that, at every vertex, the sum of the absolute values of the weights of all incident edges does not exceed (C). Within this setting, we investigate state-transfer phenomena for continuous-time quantum walks whose Hamiltonian is represented by the adjacency operator of the underlying graph. The principal contribution of this paper is a structural result for equitable partitions of bounded weighted graphs possessing twin subgraphs. This theorem provides a general mechanism for deriving both finite and bounded infinite graph families that support nontrivial quantum state transfer, including pair state transfer and plus state transfer. Building on this framework, we prove that, for every integer (kgeq 3), there are infinitely many connected unweighted graphs of maximum degree (k) that exhibit pair state transfer at prescribed transfer times. We further construct infinite families of signed graphs in which exactly one edge carries negative weight, while the corresponding underlying unweighted graphs retain maximum degree (k); these signed systems exhibit plus state transfer at the same designated times. The framework also yields constructions supporting perfect state transfer between a plus state and a pair state. In addition, we identify broad classes of graphs possessing sedentary pair states and sedentary plus states, thereby extending the range of stationary and dynamically constrained states arising in continuous-time quantum-walk models. Several asymptotic results are established for planar graphs. In particular, we show that, in the appropriate asymptotic sense, almost every connected finite unweighted planar graph admits pair state transfer at the relevant transfer times. Moreover, for almost every such graph, assigning a negative weight to a single edge is sufficient to obtain a signed graph admitting plus state transfer. The same one-edge perturbation can also induce perfect state transfer between a plus state and a pair state. Analogous asymptotic conclusions are obtained for finite unweighted trees. Beyond these existence results, we develop a collection of graph-theoretic construction procedures for systematically generating further examples. These include graph blow-ups, Cayley graph constructions, and graph extensions formed by attaching tails. The resulting methods produce new infinite families of finite and infinite unweighted graphs, together with signed variants, that exhibit pair state transfer, plus state transfer, or related perfect-transfer phenomena. Collectively, the results establish a unified structural approach to the construction and analysis of continuous-time quantum-walk systems with prescribed state-transfer properties. By combining equitable partitions, twin-subgraph techniques, signed-edge perturbations, asymptotic graph theory, and standard graph transformations, the paper connects algebraic graph structure with quantum state-transfer behavior across both finite and bounded infinite settings.

Keywords : continuous time quantum walks equitable partitions bounded infinite graphs signed graphs perfect state transfer pair state transfer plus state transfer twin subgraphs graph transformations spectral graph theory