Vaishali Yadav | Searcharxiv

arXiv2026

Controlling Spin-Mixing Conductance in KTaO$_{3}$ 2DEGs by Varying Argon-Ion Irradiation Time

The Rashba-split two-dimensional electron gas (2DEG) at the surface and interface of insulating oxides like KTaO$_{3}$ (KTO) shows great promise for all-oxide spintronics. However, efficient spin current injection into the adjacent 2DEG remains a key challenge. In this study, we report the spin-pumping experiments on a 2DEG formed on the (001)KTO surface via Ar$^+$ irradiation. We observed a significant increase in magnetic damping in the Ar$^+$-KTO/Py bilayer compared to a non-irradiated KTO/Py control sample, confirming spin pumping into the 2DEG. We demonstrate that the spin-mixing conductance ($g_{\uparrow\downarrow}^r$) can be substantially enhanced by controlling the Ar$^+$ irradiation time. The enhancement is attributed to increased 2DEG conductance, which results from a higher concentration of oxygen vacancies with longer irradiation times. This work provides crucial guidance for optimizing spin-to-charge conversion in KTO-based systems, highlighting the potential of Ar$^+$-irradiated KTO 2DEGs for future oxide spintronics.

cond-mat.mes-hall↗

arXiv2022

Flipping the switch on local exploration: Genetic Algorithms with Reversals

One important feature of complex systems are problem domains that have many local minima and substructure. Biological systems manage these local minima by switching between different subsystems depending on their environmental or developmental context. Genetic Algorithms (GA) can mimic this switching property as well as provide a means to overcome problem domain complexity. However, standard GA requires additional operators that will allow for large-scale exploration in a stochastic manner. Gradient-free heuristic search techniques are suitable for providing an optimal solution in the discrete domain to such single objective optimization tasks, particularly compared to gradient-based methods which are noticeably slower. To do this, the authors turn to an optimization problem from the flight scheduling domain. The authors compare the performance of such common gradient-free heuristic search algorithms and propose variants of GAs. The Iterated Chaining (IC) method is also introduced, building upon traditional chaining techniques by triggering multiple local searches instead of the singular action of a mutation operator. The authors will show that the use of multiple local searches can improve performance on local stochastic searches, providing ample opportunity for application to a host of other problem domains. It is observed that the proposed GA variants have the least average cost across all benchmarks including the problem proposed and IC algorithm performs better than its constituents.

cs.NE↗