Structural Graph Methods for Quantum State Transfer in Finite and Bounded Infinite Networks

Structural Graph Methods for Quantum State Transfer 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 : ACEE-ACAZKC
Publication : 5th International Conference on Researches in Accounting, Economics, Management & Humanities(meaconf.com)
Abstract :
    The mathematical analysis of quantum-state evolution on weighted graphs provides a rigorous foundation for understanding the propagation and transfer of quantum information across discrete network architectures. In this setting, a countable weighted graph whose vertex-wise sums of absolute edge weights are uniformly bounded induces a bounded adjacency operator, which may serve as the Hamiltonian governing the corresponding continuous-time quantum walk. This study develops a structural and spectral framework for constructing quantum networks with prescribed state-transfer properties, emphasizing equitable partitions of vertex sets and graph configurations incorporating twin substructures. A general structural criterion is established to demonstrate how appropriately selected equitable decompositions, together with twin-vertex arrangements, can facilitate nontrivial quantum state transfer in bounded weighted graphs. The framework applies to finite networks and extends naturally to countably infinite graphs satisfying the relevant operator-boundedness assumptions. Several constructive consequences follow from the proposed approach. For every integer (kgeq 3), infinitely many connected, unweighted graphs of maximum degree (k) are shown to admit pair-state transfer at prescribed evolution times. Analogous constructions are developed for signed graphs containing exactly one negatively weighted edge, with the corresponding unsigned graphs retaining the specified maximum-degree constraint. These signed networks exhibit plus-state transfer at the same designated times. Additional graph constructions establish perfect state transfer between a plus state and a pair state, thereby extending the range of attainable transfer configurations. The analysis also identifies broad classes of networks supporting sedentary pair states and sedentary plus states, providing further insight into structurally constrained quantum evolution. Beyond individual constructions, probabilistic and asymptotic methods are employed to investigate the prevalence of the relevant transfer properties in planar graphs and trees. In the specified asymptotic regime, the proportion of connected finite unweighted planar graphs exhibiting the considered pair-state-transfer property tends to one as the number of vertices increases. A corresponding asymptotic prevalence result is obtained for plus-state transfer in networks modified by assigning a negative weight to a single edge. The same localized sign modification can also support perfect transfer between a plus state and a pair state. Related asymptotic conclusions are established for finite unweighted trees. To extend the constructive scope of the theory, several graph-generation procedures are investigated, including graph blow-ups, Cayley-type constructions, and the attachment of path-like tails. These transformations yield further families of finite and bounded infinite unweighted networks, as well as signed variants, that exhibit prescribed pair-state transfer, plus-state transfer, perfect-transfer behavior, and related dynamical properties. Collectively, the results establish a unified structural methodology for investigating quantum state transfer through the interplay of equitable graph partitions, twin configurations, localized edge-sign alterations, spectral techniques, asymptotic graph enumeration, and systematic graph transformations. The resulting framework strengthens the constructive understanding of quantum dynamics on discrete networks and provides a common perspective on state-transfer phenomena in finite and bounded infinite graph systems.

Keywords : continuous time quantum walks quantum state transfer graph hamiltonians equitable partitions bounded adjacency operators countably infinite graphs signed graphs pair state transfer plus state transfer perfect state transfer sedentary quantum states twin vertex structures spectral graph theory planar graph asymptotics tree networks cayley graphs graph blow ups graph transformations quantum information dynamics