Searcharxiv⌕ Search

arXiv subjects

Lu Qin

Publications and source records attributed to Lu Qin.

At least 19 recordsLinked to original sources

Giant and sign-tunable spin Hall effect of light in a nonlocal nonlinear Rydberg medium

We demonstrate that long-range Rydberg atom interactions provide a tunable mechanism for generating the giant spin Hall effect of light (SHEL) in a cold atomic medium. For a coherently driven 87Rb medium with Rydberg S states, we derive the linear, local, and nonlocal Kerr susceptibilities for the two orthogonal probe polarization components and evaluate the resulting spatial and angular SHEL shifts. The nonlocal third-order susceptibility reshapes the complex birefringence of the medium, and drastically enhances the y-polarized SHEL shift by about one to two orders of magnitude. Furthermore, it can reverse the direction of both the spatial and angular shifts relative to the predictions of linear response. The effect is controllably tuned by the laser detuning, the quantization-axis orientation, the atomic density, and the principal quantum number of the Rydberg state. In the 87Rb medium, we find that the spatial and angular shifts reverse sign when the principal quantum number of the Rydberg state are around n=40 and 60, respectively. At high-lying excited Rydberg states, the spatial shift can be enhanced to several tens of micrometres-a magnitude that should be directly observable in experiment. These results demonstrate that Rydberg-mediated nonlocal optical nonlinearity is an efficient mechanism for spin-dependent light transport and for future photonic sensing applications.

physics.atom-ph↗

Nonreciprocal Floquet tunneling dynamics of spin-orbit-coupled bosonic atoms in a non-Hermitian double-well potential

The stable tunneling dynamics in non-Hermitian quantum systems is one of the fundamental issues in the study of quantum transport. Nonreciprocal coupling, as another crucial manifestation of non-Hermiticity, exerts significant regulatory effects on the stability of quantum devices and on spin tunneling dynamics. Here we place spin-orbit-coupled bosonic atoms in a double-well potential with gain and loss, and investigate the effect of nonreciprocal coupling on the system dynamics. Through an analytical analysis of the Floquet states and the quasi-energy spectrum under periodic driving, we obtain the PT-symmetry phase diagram of the system. We further explore the synergistic regulation mechanism of several factors---including the strength of nonreciprocal coupling, the non-Hermitian strength arising from gain-loss, and the periodic driving---on stable spin-flip tunneling. The results show that precise manipulation of nonreciprocity and gain-loss can substantially enlarge the stable parameter region. In nonreciprocal systems with balanced gain and loss, the continuity or discreteness of the stable parameter region is determined by the parity of the driving-frequency ratio $Ω/ω$, and the spin-flip tunneling can be precisely controlled through the parameters $λ$ and $2\varepsilon/ω$. For the unbalanced gain-loss scenario, the equilibrium conditions for achieving stable spin-flip tunneling under different parities of $Ω/ω$ are further provided. These findings offer a new theoretical approach for realizing robust spin-flip tunneling, provide guiding significance for the study of quantum-state transport in non-Hermitian ultracold atomic systems, and also serve as a reference for the experimental design of novel spin-based quantum devices.

cond-mat.quant-gas↗

The Future Is Finer: Multivariate Time Series Super-Resolution Forecasting

Web platforms run on multivariate time series, from service telemetry and Web traffic logs to sensor streams served through Web APIs. Yet, retention policies often archive them at coarse granularity to save storage and bandwidth. Decisions such as autoscaling, alerting, and billing operate at finer granularity than existing forecasters reach, since these models predict at the resolution of their input. We therefore introduce Multivariate Time Series Super-Resolution Forecasting (MTS-SRF), which forecasts fine-grained futures from coarse histories, and propose TimeMagnifier to address its three challenges. Fourier Anchor counters data sparsity by fitting each input window to a trend-Fourier structure with sparse cross-variable gating; De-noise Only constrains fine-grained ambiguity by refining along the resolution axis rather than the noise axis, lengthening the grid level by level; and banded DTW Alignment corrects cross-resolution misalignment against the coarse forecast. On the first MTS-SRF benchmark, with ten datasets from five domains, real archived cross-resolution pairs, strengthened baseline adaptations, and five-seed significance tests, TimeMagnifier is best on every dataset, resolution coefficient, and metric against 15 baselines and cuts MSE by 12.3% on average. Its De-noise Only and DTW stages also transfer as a plug-in that lowers the MSE of existing forecasters by 5.1% to 9.0%. Code will be made publicly available.

cs.AI↗

Krylov complexity of a tilted extended Bose-Hubbard chain with Rydberg-dressed interactions

We investigate Krylov state complexity in a tilted extended Bose-Hubbard chain in which both the on-site interaction $U$ and nearest-neighbor interaction $V$ are present. The tilted extended Bose-Hubbard model can be realized with Rydberg-dressed interactions in optical lattices. Using exact diagonalization and Lanczos recursion from three physically motivated Fock states, we compute the time-dependent complexity, its long-time saturation value, and the fluctuations of the Lanczos coefficients for an open chain at unit filling. Crucially, we identify a pronounced quasi-chaotic diagonal regime near $U\simeq V$ in which the Krylov complexity saturation exhibits a sharp ridge while the spectral level-spacing statistics remain partially chaotic. This dissociation arises from the competition between the on-site and nearest-neighbor interaction, which generates a dense manifold of near-resonant many-body configurations that is efficiently coupled by the state-dependent dynamics but retains residual spectral structure. Our results show that Krylov state complexity provides complementary, state-sensitive information about many-body chaos that is not captured by the spectral diagnostics alone, establishing Krylov complexity as a useful diagnostic for studying thermalization and information scrambling in experimentally accessible quantum simulators.

cond-mat.quant-gas↗

HYDRA: Proactive Android Malware Drift Adaptation via Hierarchical Graph Contrastive Learning

Concept drift, driven by the rapid evolution of Android malware, severely degrades the performance of machine learning detectors. Current adaptation strategies are often reactive, responding only after performance has dropped and imposing a significant manual annotation burden, or they are proactive but rely on unstable adversarial training and incomplete, single-level graph representations. To overcome these limitations, we propose HYDRA (Hybrid Drift Adaptation), a proactive adaptation framework that learns drift-invariant representations from hierarchically structured data. HYDRA first models applications using a hybrid graph structure, combining fine-grained Control Flow Graphs (CFGs) and coarse-grained Function Call Graphs (FCGs) to capture comprehensive behavioral patterns. It then introduces a novel cross-domain contrastive learning objective that aligns historical (source) and new (target) data distributions. By generating pseudo-labels for unlabeled target samples, our method pulls representations of semantically similar applications together, regardless of their domain, within a single, stable optimization process. This approach unifies feature learning and domain alignment, eliminating the need for complex adversarial objectives. Extensive experiments on large-scale, time-ordered malware datasets demonstrate that HYDRA achieves substantially lower False Negative and False Positive Rates than state-of-the-art baselines while requiring up to 87.5% fewer labeled samples. Our work thus offers a robust and efficient solution to combat concept drift in security applications.

cs.CR↗

Optical nonlinearity in a strongly interacting Rydberg atom ensemble

Rydberg atoms, characterized by their giant polarizability and strong long-range interactions, provide an ideal platform for exploring optical nonlinearities. By coupling light to ensembles of Rydberg atoms, one can map the strong and nonlocal interactions between Rydberg atoms and light fields. A particularly important scheme for realizing such nonlinearity is electromagnetically induced transparency (EIT). This article presents a review of the research progress in nonlinear optics based on Rydberg-EIT systems, particularly nonlinear light propagation in Rydberg atomic gases. We first introduce the fundamental properties of Rydberg atoms and the physical mechanism of EIT-enhanced nonlinearity, emphasizing how the Rydberg blockade effect endows the system with a giant nonlocal Kerr nonlinearity. Subsequently, we discuss some typical nonlinear optical phenomena in such a system with focusing and defocusing nonlocal nonlinearities. In the focusing regime, we discuss spatial solitons, vortex solitons, soliton cloning, soliton molecules, optical bullets, and self-induced transparency solitons. Other topics are also discussed. In the defocusing regime, we analyze pattern formation and shock wave dynamics. Finally, we provide an outlook on the future development of this field toward quantum control, hybrid-system integration, and novel functional devices.

physics.optics↗

Ripple Signatures of Majorana Hybridization across a Topological Quantum Quench

The crossover between topology and nonequilibrium dynamics has emerged as a rich frontier, in which quantum systems can exhibit unique dynamical phenomena that lie beyond the reach of equilibrium. Of particular interest are quench dynamics across topological phase, as it may reveal the information about the underlying Majorana zero-energy states. Here, we investigate the fate of Majorana boundary modes in a quenched fermionic superfluid using self-consistent time-dependent Bogoliubov-de Gennes theory. For quantum quenches within the topological regime, Majorana boundary modes survive but undergo coherent boundary oscillations arising from the nonadiabatic deformation of their wave functions. Furthermore, a pronounced ripple pattern appears in the post-quench density distribution following a sudden topology-changing quench. Here we identify that these ripple structures originates from the coherent hybridization and interference of the initially separated Majorana boundary states. Our findings establish nonequilibrium boundary dynamics as a new approach for probing Majorana physics, which is complementary to conventional equilibrium measurements.

cond-mat.quant-gas↗

Simultaneous estimation of relative phase and coherence in astronomical interferometry

Astronomical interferometry is a cornerstone technique for high-resolution stellar imaging and observational astrophysics, extracting spatial information from the coherence of light collected by separated telescopes. Since the degree of coherence is complex, a genuine imaging task requires the joint recovery of the modulus and the relative phase, instead of independent singleparameter estimations. We investigate the simultaneous estimation of both parameters based on direct interferometry scheme and continuou-svariable quantum teleportation scheme. We find that in simultaneous estimation the direct interferometry scheme consistently yields a lower quantum Cramér-Rao bound, demonstrating its superiority over the continuous-variable quantum teleportation scheme. Furthermore, we establish the conditions under which the classical Cramér-Rao bound for Gaussian measurements saturates the quantum Cramér-Rao bound, identifying heterodyne detection as a near-optimal measurement scheme in the large mean photon number regime. An analysis of transmission loss reveals that the direct interferometry scheme yields superior precision in the short-baseline regime, whereas the continuous-variable quantum teleportation scheme outperforms it at longer baselines.

quant-ph↗

Stable (2+1)-dimensional soliton and breather molecules in a cold Rydberg atomic gas

We investigate the formation of stable (2+1)-dimensional spatial-domain optical soliton molecules and breather molecules in a gas of Rydberg atoms, highlighting the role of the nonlocal nonlinearity, which is generated by the electromagnetically induced transparency in the Rydberg medium. The setting supports diverse species of large-size polygonal soliton molecules, including rectangular and oblique rhombuses, checkerboard cells, and hexagons. The analysis identifies two distinct formation regimes. In the case of moderately nonlocality, the long-range interactions alone stabilize the soliton molecules in the static form. In contrast, in the strongly nonlocal regime, initially imposed rotation is required to generate a centrifugal force that counteracts the strong attraction, resulting in stably rotating soliton molecules. The rotation period can be controlled by adjusting the system parameters. Furthermore, appropriate initial velocities can induce inherent breathing dynamics in the solitons, leading to the formation of breather molecules. Tuning the initial velocity, one can control the evolution of soliton molecules and breather molecules and even realize their mutual conversion. Our study offers a new scheme for engineering soliton molecules and breather molecules, and suggests new possibilities for the design of data processing and transmission in optical systems.

physics.optics↗

RAIDS: Rethinking Data Systems as Responsible Intelligent Infrastructure

Data systems are evolving from information infrastructure into decision infrastructure. Yet responsibility mechanisms have not kept pace: an output can be accurate or efficient while still lacking sufficient support, satisfied constraints, and actionability for responsible use. We propose RAIDS (Responsible and Intelligent Data System), a vision for data systems as responsible intelligent infrastructure. RAIDS treats responsibility not as post-hoc metadata, but as execution semantics for holistic data-to-decision and data mining pipelines. Its core abstraction is an operator-level responsibility contract: each operator exposes an output together with support, constraint, and actionability state under an explicit responsibility context, and these contracts compose across pipelines. These states capture whether an output is grounded, whether execution satisfies relevant limits, and which action modes are permissible. We introduce responsibility preservation as the organizing systems objective: responsibility state should remain sufficient as execution proceeds, or the system should repair, replan, escalate, refuse, or otherwise change course. We outline a BlueSky research agenda for RAIDS, spanning responsibility-preserving execution, responsibility-aware optimization, provenance, oversight, and evaluation.

cs.DB↗

HiGraph: A Large-Scale Hierarchical Graph Dataset for Malware Analysis

The advancement of graph-based malware analysis is critically limited by the absence of large-scale datasets that capture the inherent hierarchical structure of software. Existing methods often oversimplify programs into single level graphs, failing to model the crucial semantic relationship between high-level functional interactions and low-level instruction logic. To bridge this gap, we introduce \dataset, the largest public hierarchical graph dataset for malware analysis, comprising over \textbf{200M} Control Flow Graphs (CFGs) nested within \textbf{595K} Function Call Graphs (FCGs). This two-level representation preserves structural semantics essential for building robust detectors resilient to code obfuscation and malware evolution. We demonstrate HiGraph's utility through a large-scale analysis that reveals distinct structural properties of benign and malicious software, establishing it as a foundational benchmark for the community. The dataset and tools are publicly available at https://higraph.org.

cs.LG↗

EXG: Self-Evolving Agents with Experience Graphs

Large language model (LLM)-based agents have demonstrated strong capabilities in complex reasoning and problem solving through multi-step interactions, yet most deployed agents remain behaviorally static, with knowledge acquired during execution rarely translating into systematic improvement over time. In response, a growing line of work on self-evolving agents explores how agents can improve through experience during deployment, but most existing approaches either rely on ad hoc reflection limited to single-task correction or adopt unstructured memory that accumulates fragmented experience with delayed usability. To address this limitation, we introduce EXG, an experience graph framework for self-evolving agents that explicitly organizes accumulated successes and failures into a structured, relational representation. EXG is the first experience graph designed for self-evolving agents, supporting both online, real-time graph growth during execution for immediate cross-task experience reuse, and offline reuse of a consolidated experience graph as an external memory module. This design also enables EXG to serve as a plug-and-play component for existing self-evolving agents, organizing prior experience into a unified experience graph and improving both solution quality and resource efficiency as deployment progresses. Extensive experiments across code generation and reasoning benchmarks show that EXG attains more favorable performance-efficiency trade-offs than reflection- and memory-based baselines in both online and offline evaluations. Our results suggest that structuring experience as a graph provides a principled foundation for scalable and transferable self-evolving agent behavior.

cs.AI↗

Efficient Approximate Nearest Neighbor Search under Multi-Attribute Range Filter

Nearest neighbor search on high-dimensional vectors is fundamental in modern AI and database systems. In many real-world applications, queries involve constraints on multiple numeric attributes, giving rise to range-filtering approximate nearest neighbor search (RFANNS). While there exist RFANNS indexes for single-attribute range predicates, extending them to the multi-attribute setting is nontrivial and often ineffective. In this paper, we propose KHI, an index for multi-attribute RFANNS that combines an attribute-space partitioning tree with HNSW graphs attached to tree nodes. A skew-aware splitting rule bounds the tree height by $O(\log n)$, and queries are answered by routing through the tree and running greedy search on the HNSW graphs. Experiments on four real-world datasets show that KHI consistently achieves high query throughput while maintaining high recall. Compared with the state-of-the-art RFANNS baseline, KHI improves QPS by $2.46\times$ on average and up to $16.22\times$ on the hard dataset, with larger gains for smaller selectivity, larger $k$, and higher predicate cardinality.

cs.DB↗

Constant-time Connectivity and 2-Edge Connectivity Querying in Dynamic Graphs

Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph applications, in this paper, we study connectivity query processing in fully dynamic graphs, where edges are frequently inserted or deleted. A recent solution, called D-tree, maintains a spanning tree for each connected component and applies several heuristics to reduce the depth of the tree. To improve efficiency, we propose a new spanning-tree-based solution by maintaining a disjoint-set tree simultaneously. By combining the advantages of two trees, we achieve the constant query time complexity and also significantly improve the theoretical running time in both edge insertion and edge deletion. In addition, we extend our connectivity maintenance algorithms to maintain 2-edge connectivity. Our performance studies on real large datasets show considerable improvement of our algorithms.

cs.DB↗

HyperJoin: LLM-augmented Hypergraph Link Prediction for Joinable Table Discovery

As a pivotal task in data lake management, joinable table discovery has attracted widespread interest. While existing language model-based methods achieve remarkable performance by combining offline column representation learning with online ranking, their design insufficiently accounts for the underlying structural interactions: (1) offline, they directly model tables into isolated or pairwise columns, thereby struggling to capture the rich inter-table and intra-table structural information; and (2) online, they rank candidate columns based solely on query-candidate similarity, ignoring the mutual interactions among the candidates, leading to incoherent result sets. To address these limitations, we propose HyperJoin, a large language model (LLM)-augmented Hypergraph framework for Joinable table discovery. Specifically, we first construct a hypergraph to model tables using both the intra-table hyperedges and the LLM-augmented inter-table hyperedges. Consequently, the task of joinable table discovery is formulated as link prediction on this constructed hypergraph. We then design HIN, a Hierarchical Interaction Network that learns expressive column representations through bidirectional message passing over columns and hyperedges. To strengthen coherence and internal consistency in the result columns, we cast online ranking as a coherence-aware top-k column selection problem. We then introduce a reranking module that leverages a maximum spanning tree algorithm to prune noisy connections and maximize coherence. Experiments demonstrate the superiority of HyperJoin, achieving average improvements of 21.4% (Precision@15) and 17.2% (Recall@15) over the best baseline.

cs.CL↗

HL-index: Fast Reachability Query in Hypergraphs

Reachability in hypergraphs is essential for modeling complex groupwise interactions in real-world applications such as co-authorship, social network, and biological analysis, where relationships go beyond pairwise interactions. In this paper, we introduce the notion of s-reachability, where two vertices are s-reachable if there exists a sequence of hyperedges (i.e., a walk) connecting them, such that each pair of consecutive hyperedges shares at least s vertices. Moreover, we define the max-reachability query as a generalized form of the s-reachability problem, which aims to find the largest value of s that allows one vertex to reach another. To answer max-reachability queries in hypergraphs, we first analyze limitations of the existing vertex-to-vertex and hyperedge-to-hyperedge indexing techniques. We then introduce the HL-index, a compact vertex-to-hyperedge index tailored for the max-reachability problem. To both efficiently and effectively construct a minimal HL-index, we develop a fast covering relationship detection method to eliminate fruitless hypergraph traversals during index construction. A lightweight neighbor-index is further proposed to avoid repeatedly exploring neighbor relationships in hypergraphs and hence accelerate the construction. Extensive experiments on 20 datasets demonstrate the efficiency and scalability of our approach.

cs.DB↗

RIDA: A Robust Attack Framework on Incomplete Graphs

Graph Neural Networks (GNNs) are vital in data science but are increasingly susceptible to adversarial attacks. To help researchers develop more robust GNN models, it's essential to focus on designing strong attack models as foundational benchmarks and guiding references. Among adversarial attacks, gray-box poisoning attacks are noteworthy due to their effectiveness and fewer constraints. These attacks exploit GNNs' need for retraining on updated data, thereby impacting their performance by perturbing these datasets. However, current research overlooks the real-world scenario of incomplete graphs. To address this gap, we introduce the Robust Incomplete Deep Attack Framework (RIDA). It is the first algorithm for robust gray-box poisoning attacks on incomplete graphs. The approach innovatively aggregates distant vertex information and ensures powerful data utilization. Extensive tests against 9 SOTA baselines on 3 real-world datasets demonstrate that RIDA's superiority in handling incompleteness and high attack performance on the incomplete graph.

cs.LG↗

Towards Fair and Rigorous Evaluations: Hyperparameter Optimization for Top-N Recommendation Task with Implicit Feedback

The widespread use of the internet has led to an overwhelming amount of data, which has resulted in the problem of information overload. Recommender systems have emerged as a solution to this problem by providing personalized recommendations to users based on their preferences and historical data. However, as recommendation models become increasingly complex, finding the best hyperparameter combination for different models has become a challenge. The high-dimensional hyperparameter search space poses numerous challenges for researchers, and failure to disclose hyperparameter settings may impede the reproducibility of research results. In this paper, we investigate the Top-N implicit recommendation problem and focus on optimizing the benchmark recommendation algorithm commonly used in comparative experiments using hyperparameter optimization algorithms. We propose a research methodology that follows the principles of a fair comparison, employing seven types of hyperparameter search algorithms to fine-tune six common recommendation algorithms on three datasets. We have identified the most suitable hyperparameter search algorithms for various recommendation algorithms on different types of datasets as a reference for later study. This study contributes to algorithmic research in recommender systems based on hyperparameter optimization, providing a fair basis for comparison.

cs.IR↗