Structural Techniques for Quantum State Transfer in Finite and Bounded Infinite Graphs

Mohammadesmail Nikfar1

Abstract :
Continuous-time quantum walks on graphs provide a spectral framework for investigating coherent quantum dynamics and information transfer across discrete structures. This paper develops a unified structural methodology for constructing and analyzing finite and countably infinite weighted graphs that support prescribed quantum state-transfer phenomena. The underlying graph operators are assumed to be bounded, with the absolute sum of incident edge weights uniformly bounded over the vertex set, thereby ensuring that the adjacency operator defines a bounded Hamiltonian on the associated Hilbert space. Within this operator-theoretic setting, we establish a structural theorem for equitable partitions of bounded weighted graphs containing twin subgraphs. This result identifies a general mechanism through which local symmetries and quotient structures can be exploited to generate graph families exhibiting pair state transfer, plus state transfer, and perfect state transfer between distinct classes of quantum states. As a principal application, we prove that, for every integer (k\geq 3), infinitely many connected finite unweighted graphs of maximum degree (k) exhibit pair state transfer at prescribed transfer times. We further establish the existence of infinite families of signed graphs obtained by assigning negative weight to exactly one edge, while preserving maximum degree (k) in their underlying unweighted graphs. These signed constructions support plus state transfer at the same designated times and also yield examples of perfect state transfer between plus states and pair states. In parallel, we characterize broad classes of graphs supporting sedentary pair states and sedentary plus states, thereby extending the structural analysis of quantum states whose evolution satisfies additional dynamical constraints. The investigation also incorporates asymptotic graph-theoretic arguments to establish prevalence results for connected finite unweighted planar graphs and trees. In the appropriate asymptotic regimes, almost every connected finite unweighted planar graph exhibits pair state transfer at the relevant transfer times. Moreover, for almost every graph in the corresponding planar class, introducing a negative weight on a single edge suffices to produce plus state transfer; the same perturbation mechanism can also facilitate perfect state transfer between a plus state and a pair state. Analogous asymptotic conclusions are obtained for finite unweighted trees. These results demonstrate that state-transfer properties can arise not only through explicitly engineered algebraic configurations but also within broad graph classes under suitable asymptotic measures. To systematize the construction of further examples, we develop graph-theoretic procedures based on graph blow-ups, Cayley graph methods, and extensions obtained by attaching tails. These transformations provide systematic routes to new families of finite and bounded infinite unweighted graphs, together with signed counterparts, that realize pair state transfer, plus state transfer, and related perfect-transfer phenomena. Taken together, the results establish a structural framework linking equitable partitions, twin-subgraph symmetries, spectral properties, localized signed-edge perturbations, and asymptotic graph theory. This framework advances the systematic construction of quantum-walk systems with prescribed transfer behavior and clarifies how graph structure governs coherent state evolution in both finite-dimensional and infinite-dimensional settings.

Keywords : continuous time quantum walks quantum state transfer perfect state transfer pair state transfer plus state transfer bounded infinite graphs equitable partitions twin subgraph symmetry signed weighted graphs adjacency operators spectral graph theory asymptotic graph theory planar graphs graph transformations cayley graphs


زبان مقاله : انگلیسی
محل انتشار : دومین کنفرانس بین المللی فناوری اطلاعات، مدیریت و کامپیوتر
آدرس وب سایت کنفرانس : confit.ir/2nd
کد IOI مقاله : ADAH-ACAFBD
لینک مستقیم مقاله : https://isnac.ir/ADAH-ACAFBD

سایر مقالات ارائه دهنده
  1. روانشناسی و توسعه هوش مصنوعی در بستر پژوهش‌های شیمی
  2. مطالعات و پژوهشهای ریاضی در مقطع دکترا از امکان تا تداوم
  3. پیشرفت در تحقیقهای ریاضی: درباره تعاریف مولد ریاضیدان
  4. درآمدی بر تعاریف مولد ریاضیدان با تاثیر روی تحقیقات در مقطع دکترا
  5. اخلاق و ریاضیات: برخی مشاهدات با تعاریف مولد ریاضیدان در تحقیقات دکترا
  6. مقدمه ای بر پژوهش در سال های اولیه دانشگاه و تحقیقات در مقطع دکترا
  7. چگونگی نگارش شفاف یک مقاله ریاضی در مقطع دکترا
  8. هنر و استدلال در تحقیق با ریاضیات در مقطع دکتری
  9. هنر و خلاقیت در استدلال ریاضی: کاوشی در اثبات و تفکر غیررسمی در پژوهشهای دکتری
  10. ریاضیات و اخلاق مبتنی بر تاریخ و نقش گفتگو در پژوهشهای دکتری
  11. طلوع هوش مصنوعی مولد در شیمی برای آموزش و پژوهش
  12. رویکرد پویا و شفاف در پژوهشهای دکتری ریاضی: مسیر بهبود مستمر
  13. زیبایی شناسی و خلاقیت در استدلال ریاضی: تحلیلی بر اثبات و اندیشه غیررسمی در تحقیقات دکتری
  14. جابه جایی حالت در گراف های کیلی و کاربردهای آن در مدیریت
  15. جابه جایی حالت بر روی گراف ها و تجزیه و تحلیل در علوم شناختی و انسانی