SearcharxivSearch

arXiv subjects

Xiaoyu Guo

Publications and source records attributed to Xiaoyu Guo.

At least 19 recordsLinked to original sources

Symmetry-Resolved Second Harmonic Generation in Quantum and Functional Materials

Second harmonic generation (SHG) has evolved from a probe of noncentrosymmetric crystals into a symmetry-resolved optical method for identifying order parameters in quantum and functional materials. In particular, polarization-resolved rotational anisotropy (RA) measurements of SHG can connect nonlinear susceptibility tensors to the crystallographic and magnetic point groups of the underlying materials. This capability is especially powerful when the ordered state is weak, spatially confined, multipolar, magnetic, or hidden from conventional linear probe techniques. In this review article, we established a systematic symmetry-based framework for understanding RA-SHG and provide a comprehensive overview of RA-SHG studies across a broad range of condensed matter systems. We begin with basic theoretical background for the multipole origins of SHG radiation, the construction of nonlinear susceptibility tensors, and a group-theoretical framework connecting tensor components to order parameters. We then review the applications of RA-SHG to polar materials, magnetic orders, and other hidden electronic orders. Finally, we outline challenges and future research directions for using SHG to reveal, image, and control hidden, intertwined, and nonequilibrium phases in quantum and functional materials.

cond-mat.mtrl-sci

Graph Evidence Is Not Enough: Diagnosing Native Decoder Use in Graph-Augmented LLMs

Graph-augmented large language models often assume that graph evidence produced by external computation and placed in the input can be used by the native decoder. We test this assumption with HopQA, a deliberately bounded diagnostic that asks for the shortest-hop distance between two query nodes. Because the answer is a small integer and the target is purely topological, failure cannot be dismissed as open-ended generation or ambiguous evaluation. Yet existing graph-augmented baselines still fail on this setting, showing that providing graph evidence is not the same as making it usable. We introduce an intervention triangle with three matched conditions: readable graph evidence, shuffled graph evidence, and no-graph input. This separates evidence inclusion, structural readability, and decoder-usable topology. Guided by this diagnosis, we present S$^2$GE as an instance showing that diagnosis-driven interface design can improve native decoder usability. S$^2$GE uses query-aware sampling, endpoint and proximity-based ordering, and structure-preserving alignment. Across DBLP, Biomedical, GoodReads, and PubMed, S$^2$GE achieves strict exact-match scores of $36.5\%$, $57.8\%$, $76.6\%$, and $52.0\%$, improving over the strongest native-generation baseline by $53.5$ points on average. The interventions further reveal harmful-shuffle, shuffle-robust, and no-graph-saturated regimes.

cs.CL

Hysteresis without coexistence: disorder-rounded first-order transitions in a van der Waals magnet

Quenched disorder can profoundly modify phase transitions. In low-dimensional systems, theory predicts that even weak quenched disorder can round the thermodynamic discontinuities associated with a first-order phase transition. Here, we employ time-domain terahertz spectroscopy to investigate the quasi-two-dimensional trimerized kagome van der Waals magnet family Nb$_3$Cl$_{8-x}$Br$_x$ ($x=0$, 1 and 8). We observe the emergence of an additional phonon branch upon Br substitution, whose spectral weight increases and frequency softens with increasing Br concentration. The temperature evolution of the phonon frequencies reveals a clean first-order transition in Nb$_3$Cl$_8$ characterized by macroscopic phase coexistence and thermal hysteresis. In contrast, the transition in the substitutionally disordered compound Nb$_3$Cl$_7$Br retains its hysteresis while exhibiting a substantially broadened transition with no resolvable macroscopic phase coexistence. These observations reveal disorder-induced fragmentation of the transition into locally favored domains instead of well-defined bulk phases separated by stable phase boundaries. The behavior is consistent with the Imry-Wortis and the Aizenman-Wehr scenarios for the effect of quenched disorder in low-dimensional systems, which destabilizes macroscopic phase coexistence and rounds the thermodynamic discontinuities associated with first-order transitions. Thermal hysteresis persists in the disordered compound despite the lack of resolvable coexistence, indicating that the two features often treated as a single hallmark of first-order character arise distinctly and can be separated by disorder. Moreover, our results establish Nb$_3$Cl$_{8-x}$Br$_x$ as a promising platform for investigating the effects of disorder on first-order transitions in low-dimensional systems.

cond-mat.str-el

Prox-DBRO-VR: A Unified Analysis on Byzantine-Resilient Decentralized Stochastic Composite Optimization with Variance Reduction and Non-Asymptotic Convergence Rates

Decentralized stochastic gradient algorithms efficiently solve large-scale finite-sum optimization problems when all agents in the network are reliable. However, most of these algorithms are not resilient to adverse conditions, such as malfunctioning agents, software bugs, and cyber attacks. This paper aims to handle a class of general composite optimization problems over multi-agent systems (MASs) in the presence of an unknown number of Byzantine agents. Building on a resilient aggregation mechanism and the proximal-gradient mapping method, a Byzantine-resilient decentralized stochastic proximal-gradient algorithmic framework is proposed, dubbed Prox-DBRO-VR, which achieves an optimization and control goal using only local computations and communications. To asymptotically reduce the noise variance arising from local gradient estimation and accelerate the convergence, we incorporate two localized variance-reduced (VR) techniques (SAGA and LSVRG) into Prox-DBRO-VR to design Prox-DBRO-SAGA and Prox-DBRO-LSVRG. By analyzing the contraction relationships among the gradient-learning error, resilient consensus condition, and convergence error in a unified theoretical framework, it is proved that both Prox-DBRO-SAGA and Prox-DBRO-LSVRG, with a well-designed constant (resp., decaying) step-size, converge linearly (resp., sub-linearly) inside an error ball around the optimal solution to the original problem under standard assumptions. A trade-off between convergence accuracy and Byzantine resilience in both linear and sub-linear cases is also characterized. In numerical experiments, the effectiveness and practicability of the proposed algorithms are manifested via resolving a decentralized sparse machine-learning problem under various Byzantine attacks.

math.OC

A neuromorphic vision system for open-world visual intelligence

Time-efficient and robust visual intelligence remains a critical challenge in unstructured open-world environments, yet current approaches often rely on computationally intensive neural architectures or task-specific sensors with limited versatility. Inspired by biological vision and information bottleneck theory, we report a neuromorphic vision system that performs task-oriented visual intelligence through an information distillation strategy (named as task traction mechanism) implemented on hardware. The system integrates a polarization-sensitive imager with a resistive random-access memory (RRAM) array to progressively distill task-relevant information via light field selection, region of interest extraction, and target anticipation. The neuromorphic vision system conducts visual tasks within an execution time of 193 μs. Evaluation across eight challenging open-world scenarios shows accuracy improvements of 25.54%, 37.73%, and 36.10% for object tracking, object segmentation, and trajectory prediction, respectively, together with an average 30.6-fold reduction in latency relative to state-of-the-art solutions.

eess.IV

Many-body quantum geometric effects and entanglement at the 3D metal-insulator quantum phase transition

Quantum geometry has emerged as a unifying concept across condensed matter physics, underlying phenomena from nonlinear topological response to flat-band superconductivity. While usually formulated within band theory, quantum geometry remains meaningful in disordered interacting systems~\cite{resta1999electron}. Here we show that the first negative moment of the optical conductivity -- proportional to the zero temperature quantum Fisher information as a bound on the multipartite entanglement -- provides an experimental probe of quantum geometry across the three-dimensional metal-insulator quantum phase transition in phosphorus-doped silicon. We extract a quantum geometric length $\ell$ that characterizes the local wavefunctions. Far from the transition, this length is almost coincident with the Bohr radius of the hydrogenic phosphorus donors, reflecting their atomic-scale quantum geometry. Approaching the transition, $\ell$ is enhanced, but does not diverge continuously like a correlation length; it jumps discontinuously to infinity at the critical point. This reflects the UV domination of the sum rule in three dimensions that renders it insensitive to the critical fluctuations driving the diverging dielectric constant and correlation length. Its enhancement demonstrates a ``puffing" of the donor polarizability volume of quantum geometric origin, which yields a quantum geometric corrected Clausius-Mossotti description in closer agreement with the diverging dielectric response and provides a quantum mechanical foundation for the century-old Herzfeld metallization criterion.

cond-mat.str-el

Bio-plausible Neuromorphic Disturbance Observer Based on Emulation Theory: Extended Version

Biological neural systems achieve remarkable robustness and adaptability in uncertain environments through sparse, event-driven spike-based information processing and adaptive regulation. Inspired by this paradigm, this paper develops a neuromorhpic disturbance observer (NDO) and control framework that replaces conventional continuous-time signal representations with spike-timing encoding. Both disturbance estimates and control inputs are constructed via integrate-and-fire (IF) neuron dynamics from discrete spike events, yielding intrinsically event-driven updates. An adaptive-threshold triggering mechanism is inspired by spike-frequency adaptation (SFA), enabling history-dependent regulation of spike generation. Simulation results demonstrate that the proposed framework achieves neurally inspired robustness and adaptability, while the adaptive-threshold spiking scheme reduces spike events to 42.6% of the fixed-threshold case under noisy conditions.

q-bio.NC

Carrier Localization in Pnictogen-Based Chalcohalides from Defect-Bound Hot Polarons

Pnictogen-based solar absorbers have gained prominence as promising nontoxic and stable alternatives to lead-halide perovskites (LHPs), but are severely limited by carrier localization, preventing their performance from approaching those of LHPs. Recent efforts have uncovered routes to overcome carrier localization, but these early efforts only considered intrinsic factors. Herein, we push beyond these limited early efforts, examining the role of defects, not only on cold carriers but also hot carriers. Focusing on the structurally one-dimensional pnictogen chalcohalide BiSBr, we find that whilst this material intrinsically does not exhibit carrier localization, vacancies introduced during synthesis or post-treatment lead to pronounced extrinsic self-trapping via the formation of defect-bound hot polarons-excited charge-carriers strongly coupled to local defect-induced vibrational modes. These above-gap defect states divert hot carriers from cooling to the band edge, thus depleting the mobile carrier population. Our findings establish the key role of defect-bound hot polarons in mediating extrinsic localization and offer new mechanistic insights into the interplay between defects, lattice coupling, and excited-state charge-carrier transport, which are critical to designing efficient perovskite-inspired solar absorbers.

cond-mat.mtrl-sci

From Static Risk to Dynamic Trajectories: Toward World-Model-Inspired Clinical Prediction

Clinical decision-making is a feedback system where risk estimates influence treatment, which in turn changes disease trajectories, and both shape clinicians' measurement practices. Static prediction often fails clinically: models trained on observational care logs conflate disease biology with clinician behavior, particularly under treatment confounder feedback and irregular or informative observation. This Review focuses on intervention-aware disease trajectory modeling in clinical AI--methods estimating patient-specific longitudinal disease evolution and assessing trajectory changes under alternative treatments. We organize the field around six linked components: three decision tasks (factual forecasting, counterfactual estimation, policy evaluation) and three data-generating mechanisms (disease evolution, treatment assignment, observation process) that determine identifiability. We present the first unified framework bridging forecasting, counterfactual trajectories, and policy evaluation across discrete/continuous time, explicitly addressing treatment assignment, time-varying confounding, and observation bias. We synthesize key method families (multistate/joint models, temporal point-process, deep sequence architectures, longitudinal causal inference), map them to relevant components, and align evaluation with claim strength via overlap diagnostics, uncertainty quantification, off-policy robustness, and target-trial validation. This synthesis advances benchmark prediction to decision-grade clinical evidence, enabling treatment-sensitive individualized futures, pre-deployment policy stress-testing, and safer closed-loop learning health systems that adapt/abstain when evidence is insufficient.

cs.AI

Rapid Atmospheric Vapor Deposition of H:In2O3 Transparent Conducting Oxide Thin Films

Transparent conducting oxides (TCOs) are essential for the optoelectronics industry, but there is a critical gap in cost-effective methods to rapidly deposit low sheet resistance, high transmittance films without damaging delicate materials, including emerging soft semiconductors like metal-halide perovskites. In this work, atmospheric pressure chemical vapor deposition (AP-CVD) is used to synthesise H:In2O3 films with 7.20+/-0.01 Ohm/sq sheet resistance (0.50+/-0.06 mOhm.cm resistivity) and transmittance up to 89% in the near-infrared (NIR), surpassing commercial sputter-deposited indium tin oxide. The growth rate is 40x higher than atomic layer deposition (ALD), and the AP-CVD films are fully processed under atmospheric conditions at only 140 C. Comparison of secondary ion mass spectrometry and time-of-flight elastic recoil detection analysis with changes in carrier concentration indicate that H dopants are introduced from the water oxidant. There is an increase in mobility form 40+/-10 cm2/Vs to 160+/-30 cm2/Vs when changing from O2 to H2O as the oxidant, which is attributed to H dopants passivating oxygen vacancies that act as carrier scattering centers. This work establishes AP-CVD as a promising method for manufacturing high figure-of-merit TCOs in a rapid, scalable and cost-effective manner, using mild growth conditions compatible with thermally-sensitive materials.

cond-mat.mtrl-sci

RePO-VLA: Recovery-Driven Policy Optimization for Vision-Language-Action Models

Vision-Language-Action (VLA) models remain brittle in long-horizon, contact-rich manipulation because success-only imitation provides little supervision for execution drift, while failed rollouts are often discarded. We introduce RePO-VLA, a recovery-driven policy optimization framework that assigns distinct roles to success, recovery, and failure trajectories. RePO-VLA first applies Recovery-Aware Initialization (RAI), slicing recovery segments and resetting history so corrective actions depend on the current adverse state rather than the preceding failure. It then learns a Progress-Aware Semantic Value Function (PAS-VF), aligning spatiotemporal trajectory features with instructions and successful references. The resulting labels salvage useful failure prefixes via reliability decay, while low-value labels mark drift and terminal breakdowns, teaching differences among nominal, failed, and corrective actions. The data engine turns adverse states into planner-generated or human-collected corrective rollouts, teaching recovery to the success manifold. Value-Conditioned Refinement (VCR) trains the policy to prefer high-progress actions. At deployment, a fixed high value ($v=1.0$) biases actions toward the learned success manifold without online failure detectors or heuristic retries. We introduce FRBench, with standardized error injection and recovery-focused evaluation. Across simulated and real-world bimanual tasks, RePO-VLA improves robustness, raising adversarial success from 20% to 75% on average and up to 80% in scaled real-world trials.

cs.RO

A1: A Fully Transparent Open-Source, Adaptive and Efficient Truncated Vision-Language-Action Model

Vision-Language-Action (VLA) models have emerged as a powerful paradigm for open-world robot manipulation, but their practical deployment is often constrained by cost: billion-scale VLM backbones and iterative diffusion/flow-based action heads incur high latency and compute, making real-time control expensive on commodity hardware. We present A1, a fully open-source and transparent VLA framework designed for low-cost, high-throughput inference without sacrificing manipulation success; Our approach leverages pretrained VLMs that provide implicit affordance priors for action generation. We release the full training stack (training code, data/data-processing pipeline, intermediate checkpoints, and evaluation scripts) to enable end-to-end reproducibility. Beyond optimizing the VLM alone, A1 targets the full inference pipeline by introducing a budget-aware adaptive inference scheme that jointly accelerates the backbone and the action head. Specifically, we monitor action consistency across intermediate VLM layers to trigger early termination, and propose Inter-Layer Truncated Flow Matching that warm-starts denoising across layers, enabling accurate actions with substantially fewer effective denoising iterations. Across simulation benchmarks (LIBERO, VLABench) and real robots (Franka, AgiBot), A1 achieves state-of-the-art success rates while significantly reducing inference cost (e.g., up to 72% lower per-episode latency for flow-matching inference and up to 76.6% backbone computation reduction with minor performance degradation). On RoboChallenge, A1 achieves an average success rate of 29.00%, outperforming baselines including pi0(28.33%), X-VLA (21.33%), and RDT-1B (15.00%).

cs.RO

NAU-QMUL: Utilizing BERT and CLIP for Multi-modal AI-Generated Image Detection

With the aim of detecting AI-generated images and identifying the specific models responsible for their generation, we propose a multi-modal multi-task model. The model leverages pre-trained BERT and CLIP Vision encoders for text and image feature extraction, respectively, and employs cross-modal feature fusion with a tailored multi-task loss function. Additionally, a pseudo-labeling-based data augmentation strategy was utilized to expand the training dataset with high-confidence samples. The model achieved fifth place in both Tasks A and B of the `CT2: AI-Generated Image Detection' competition, with F1 scores of 83.16\% and 48.88\%, respectively. These findings highlight the effectiveness of the proposed architecture and its potential for advancing AI-generated content detection in real-world scenarios. The source code for our method is published on https://github.com/xxxxxxxxy/AIGeneratedImageDetection.

cs.CV

QSPE: Enumerating Skeletal Quantum Programs for Quantum Library Testing

The rapid advancement of quantum computing has led to the development of various quantum libraries, empowering compilation, simulation, and hardware backend interfaces. However, ensuring the correctness of these libraries remains a fundamental challenge due to the lack of mature testing methodologies. The state-of-the-art tools often rely on domain-specific configurations and expert knowledge, which limits their accessibility and scalability in practice. Furthermore, although these tools demonstrate strong performance, they adopt measurement-based for output validation in testing, which makes them produce false positive reports. To alleviate these limitations, we propose QSPE, a practical approach that follows the differential testing principle and extends the existing approach, SPE, for quantum libraries. QSPE is fully automated, requiring no pre-set configurations or domain expertise, and can effectively generate a large set of diverse program variants that comprehensively explore the quantum compilation space. To mitigate the possible false positive reports, we propose statevector-based validation as an alternative to measurement-based validation. In our experiments, the QSPE approach demonstrates remarkable effectiveness in generating 22,770 program variants across multiple quantum computing platforms. By avoiding $α$-equivalence at the quantum and classical program wise, QSPE can reduce redundant generation and save more than 90\% of execution cost. Finally, the statevector-based validation method assists QSPE to reduce false alarms and effectively detects 708 miscompilations across multiple quantum libraries. Notably, 81 of the discovered bugs have been officially approved and acknowledged by the Qiskit development team, demonstrating the practical impact of our approach.

quant-ph

UAV-enabled Computing Power Networks: Design and Performance Analysis under Energy Constraints

This paper presents an innovative framework that boosts computing power by utilizing ubiquitous computing power distribution and enabling higher computing node accessibility via adaptive UAV positioning, establishing a UAV-enabled Computing Power Network (UAV-CPN). In a UAV-CPN, a UAV functions as a dynamic relay, outsourcing computing tasks from the request zone to an expanded service zone with diverse computing nodes, including vehicle onboard units, edge servers, and dedicated powerful nodes. This approach has the potential to alleviate communication bottlenecks and overcome the "island effect" observed in multi-access edge computing. A significant challenge is to quantify computing power performance under complex dynamics of communication and computing. To address this challenge, we introduce task completion probability to capture the capability of UAV-CPNs for task computing. We further enhance UAV-CPN performance under a hybrid energy architecture by jointly optimizing UAV altitude and transmit power, where fuel cells and batteries collectively power both UAV propulsion and communication systems. Extensive evaluations show significant performance gains, highlighting the importance of balancing communication and computing capabilities, especially under dual-energy constraints. These findings underscore the potential of UAV-CPNs to significantly boost computing power.

cs.NI

Active Visual Perception: Opportunities and Challenges

Active visual perception refers to the ability of a system to dynamically engage with its environment through sensing and action, allowing it to modify its behavior in response to specific goals or uncertainties. Unlike passive systems that rely solely on visual data, active visual perception systems can direct attention, move sensors, or interact with objects to acquire more informative data. This approach is particularly powerful in complex environments where static sensing methods may not provide sufficient information. Active visual perception plays a critical role in numerous applications, including robotics, autonomous vehicles, human-computer interaction, and surveillance systems. However, despite its significant promise, there are several challenges that need to be addressed, including real-time processing of complex visual data, decision-making in dynamic environments, and integrating multimodal sensory inputs. This paper explores both the opportunities and challenges inherent in active visual perception, providing a comprehensive overview of its potential, current research, and the obstacles that must be overcome for broader adoption.

cs.CV

M2QCode: A Model-Driven Framework for Generating Multi-Platform Quantum Programs

With the growing interest in quantum computing, the emergence of quantum supremacy has marked a pivotal milestone in the field. As a result, numerous quantum programming languages (QPLs) have been introduced to support the development of quantum algorithms. However, the application of Model-Driven Development (MDD) in quantum system engineering remains largely underexplored. This paper presents an MDD-based approach to support the structured design and implementation of quantum systems. Our framework enables the automatic generation of quantum code for multiple QPLs, thereby enhancing development efficiency and consistency across heterogeneous quantum platforms. The effectiveness and practicality of our approach have been demonstrated through multiple case studies.

cs.SE

QuanBench: Benchmarking Quantum Code Generation with Large Language Models

Large language models (LLMs) have demonstrated good performance in general code generation; however, their capabilities in quantum code generation remain insufficiently studied. This paper presents QuanBench, a benchmark for evaluating LLMs on quantum code generation. QuanBench includes 44 programming tasks that cover quantum algorithms, state preparation, gate decomposition, and quantum machine learning. Each task has an executable canonical solution and is evaluated by functional correctness (Pass@K) and quantum semantic equivalence (Process Fidelity). We evaluate several recent LLMs, including general-purpose and code-specialized models. The results show that current LLMs have limited capability in generating the correct quantum code, with overall accuracy below 40% and frequent semantic errors. We also analyze common failure cases, such as outdated API usage, circuit construction errors, and incorrect algorithm logic. QuanBench provides a basis for future work on improving quantum code generation with LLMs.

cs.SE