Graph-Theoretic Frameworks for Quantum State Dynamics in Finite and Bounded Infinite Networks
Graph-Theoretic Frameworks for Quantum State Dynamics in Finite and Bounded Infinite Networks
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
:
ABKH-ACAZEB
Publication :
4th International Conference on Applied Researches in Humanities, Economics, Management & Accounting(icrhema.com)
Abstract :
The evolution of quantum states on weighted graphs provides a mathematical framework for investigating information transfer in discrete network structures. Consider a weighted graph with a countable collection of vertices, where the total absolute edge weight incident to any vertex is uniformly bounded. Such a graph admits a bounded adjacency operator, which serves as the Hamiltonian governing the associated continuous-time quantum walk. This work develops a graph-structural approach to identifying networks that realize prescribed quantum state-transfer behaviors, with particular emphasis on equitable vertex decompositions and the presence of twin subgraphs. A central theoretical result establishes a general structural criterion through which suitable equitable partitions of bounded weighted graphs containing twin substructures can be used to generate networks with nontrivial transfer characteristics. The resulting framework accommodates finite graphs as well as infinite graphs satisfying the required boundedness condition. Among its consequences, we demonstrate that, for every integer (kgeq 3), infinitely many connected, unweighted graphs with maximum vertex degree (k) can be constructed to achieve pair state transfer at specified evolution times. Corresponding constructions are obtained for signed graphs in which precisely one edge has negative weight, while the associated unsigned networks preserve the prescribed maximum degree. These signed configurations realize plus state transfer at the same designated times. Further constructions establish perfect transfer between states represented by a plus state and a pair state. The investigation also characterizes extensive families of graphs supporting sedentary pair states and sedentary plus states, revealing additional forms of constrained quantum evolution. Probabilistic and asymptotic graph-theoretic arguments yield further conclusions for planar networks and trees. In particular, as the order of a connected finite unweighted planar graph increases, the proportion of graphs exhibiting the relevant pair state-transfer property approaches one in the specified asymptotic regime. A corresponding prevalence result holds for plus state transfer when a negative weight is introduced on a single edge. This localized modification can likewise facilitate perfect transfer between a plus state and a pair state. Related asymptotic properties are established for finite unweighted trees. Beyond these structural and asymptotic findings, we introduce several systematic procedures for producing additional examples of quantum networks. The proposed methods encompass graph blow-ups, Cayley-type constructions, and extensions obtained by adjoining path-like tails. Through these operations, further families of finite and bounded infinite unweighted graphs, together with their signed counterparts, are obtained with prescribed pair state-transfer, plus state-transfer, and related perfect-transfer properties. Overall, this study establishes a unified methodology for connecting graph structure with quantum dynamics. By integrating equitable decompositions, twin-subgraph configurations, single-edge sign modifications, asymptotic enumeration, and graph transformation techniques, the results broaden the constructive understanding of quantum state transfer in both finite networks and bounded infinite graph systems.
Keywords : continuous time quantum dynamics quantum walks on graphs equitable vertex partitions uniformly bounded adjacency operators infinite graph networks signed edge weights pair state transfer plus state transfer perfect quantum transfer sedentary quantum states twin subgraph structures planar network asymptotics tree based constructions cayley graphs graph blow ups spectral methods in graph theory