Searcharxiv⌕ Search

arXiv subjects

Xiaoyu Guo

Publications and source records attributed to Xiaoyu Guo.

At least 37 records · Page 2Linked to original sources

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↗

Tuning Coupled Toroidic and Polar Orders in a Bilayer Antiferromagnet

Magnetic toroidal order features a loop-like arrangement of magnetic dipole moments, thus breaking both spatial inversion (P) and time-reversal (T) symmetries while preserving their combined PT sym-metry. This PT symmetry enables a linear magnetoelectric effect, allowing the coupling between magnetic toroidicity and electric polarity. However, the detection and control of two-dimensional (2D) magnetic toroidal order and the investigation of its linear magnetoelectric response remain largely unexplored. Here, using bilayer CrSBr as a platform, which hosts an in-plane layer-antiferromagnetic (AFM) order and simultaneously exhibits a magnetic toroidal order, we show compelling evidence for tuning this 2D magnetic toroidicity and its induced electric polarity through magnetic-field-depend-ent second harmonic generation (SHG). Under an out-of-plane magnetic field, we decompose the SHG signal into a time-reversal-odd component that scales with the magnetic toroidal moment and a time-reversal-even component that is proportional to the electric polarization. When sweeping the magnetic field from positive to negative values, we observe that the magnetic toroidicity retains its sign but diminishes in magnitude at higher fields while the electric polarity flips its sign and increases in strength at increasing fields below a critical threshold. When applying an in-plane electric field along the Néel vector direction, together with an out-of-plane field, we find that the magnetic toroidal and electric polar domains are moved in a locked fashion. These findings underscore the promise of 2D magnetic toroidal order in realizing giant linear magnetoelectric effects, opening exciting possi-bilities for next-generation electronic, magnetic, optical, and photonic devices enabled by 2D mag-netoelectrics.

cond-mat.mtrl-sci↗

Intertwined polar, chiral, and ferro-rotational orders in a rotation-only insulator

Intertwined orders refer to strongly coupled and mutually dependent orders that coexist in correlated electron systems, often underpinning key physical properties of the host materials. Among them, polar, chiral, and ferro-rotational orders have been theoretically known to form a closed set of intertwined orders. However, experimental investigation into their mutual coupling and physical consequences has remained elusive. In this work, we employ the polar-chiral insulator Ni$_3$TeO$_6$ as a platform and utilize a multimodal optical approach to directly probe and reveal the intertwining among polarity, chirality, and ferro-rotational order. We demonstrate how their coupling governs the formation of domains and dictates the nature of domain walls. Within the domains, we identify spatial inversion symmetry as the operation connecting two domain states of opposite polarity and chirality, with a common ferro-rotational state serving as the prerequisite for these interlocked configurations. At the domain walls, we observe a pronounced enhancement of in-plane polarization accompanied by a suppression of chirality. By combining with Ginzburg-Landau theory within the framework of a pre-existing ferro-rotational background, we uncover the emergence of mixed Néel- and Bloch-type domain walls. Our findings highlight the critical role of intertwined orders in defining domain and domain wall characteristics and open pathways for domain switching and domain wall control via intertwined order parameters.

cond-mat.mtrl-sci↗

QuanUML: Towards A Modeling Language for Model-Driven Quantum Software Development

This paper introduces QuanUML, an extension of the Unified Modeling Language (UML) tailored for quantum software systems. QuanUML integrates quantum-specific constructs, such as qubits and quantum gates, into the UML framework, enabling the modeling of both quantum and hybrid quantum-classical systems. We apply QuanUML to Efficient Long-Range Entanglement using Dynamic Circuits and Shor's Algorithm, demonstrating its utility in designing and visualizing quantum algorithms. Our approach supports model-driven development of quantum software and offers a structured framework for quantum software design. We also highlight its advantages over existing methods and discuss future improvements.

cs.SE↗

Quantum Concolic Testing

This paper presents the first concolic testing framework explicitly designed for quantum programs. The framework introduces quantum constraint generation methods for quantum control statements that quantify quantum states and offers a symbolization method for quantum variables. Based on this framework, we generate path constraints for each concrete execution path of a quantum program. These constraints guide the exploration of new paths, with a quantum constraint solver determining outcomes to create novel input samples, thereby enhancing branch coverage. Our framework has been implemented in Python and integrated with Qiskit for practical evaluation. Experimental results show that our concolic testing framework improves branch coverage, generates high-quality quantum input samples, and detects bugs, demonstrating its effectiveness and efficiency in quantum programming and bug detection. Regarding branch coverage, our framework achieves more than 74.27% on quantum programs with under 5 qubits.

cs.SE↗

Camouflaged Object Tracking: A Benchmark

Visual tracking has seen remarkable advancements, largely driven by the availability of large-scale training datasets that have enabled the development of highly accurate and robust algorithms. While significant progress has been made in tracking general objects, research on more challenging scenarios, such as tracking camouflaged objects, remains limited. Camouflaged objects, which blend seamlessly with their surroundings or other objects, present unique challenges for detection and tracking in complex environments. This challenge is particularly critical in applications such as military, security, agriculture, and marine monitoring, where precise tracking of camouflaged objects is essential. To address this gap, we introduce the Camouflaged Object Tracking Dataset (COTD), a specialized benchmark designed specifically for evaluating camouflaged object tracking methods. The COTD dataset comprises 200 sequences and approximately 80,000 frames, each annotated with detailed bounding boxes. Our evaluation of 20 existing tracking algorithms reveals significant deficiencies in their performance with camouflaged objects. To address these issues, we propose a novel tracking framework, HiPTrack-MLS, which demonstrates promising results in improving tracking performance for camouflaged objects. COTD and code are avialable at https://github.com/openat25/HIPTrack-MLS.

cs.CV↗

Decentralized Nonconvex Robust Optimization over Unsafe Multiagent Systems: System Modeling, Utility, Resilience, and Privacy Analysis

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multi-agent systems (MASs). Considering the presence of these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Łojasiewicz (P-Ł) condition. To address this problem, we first identify and construct the adversary system model. To enhance the robustness of stochastic gradient descent methods, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-Ł condition under various Byzantine attacks.

math.OC↗

LCGC: Learning from Consistency Gradient Conflicting for Class-Imbalanced Semi-Supervised Debiasing

Classifiers often learn to be biased corresponding to the class-imbalanced dataset, especially under the semi-supervised learning (SSL) set. While previous work tries to appropriately re-balance the classifiers by subtracting a class-irrelevant image's logit, but lacks a firm theoretical basis. We theoretically analyze why exploiting a baseline image can refine pseudo-labels and prove that the black image is the best choice. We also indicated that as the training process deepens, the pseudo-labels before and after refinement become closer. Based on this observation, we propose a debiasing scheme dubbed LCGC, which Learning from Consistency Gradient Conflicting, by encouraging biased class predictions during training. We intentionally update the pseudo-labels whose gradient conflicts with the debiased logits, representing the optimization direction offered by the over-imbalanced classifier predictions. Then, we debiased the predictions by subtracting the baseline image logits during testing. Extensive experiments demonstrate that LCGC can significantly improve the prediction accuracy of existing CISSL models on public benchmarks.

cs.CV↗

LOCAL: Learning with Orientation Matrix to Infer Causal Structure from Time Series Data

Discovering the underlying Directed Acyclic Graph (DAG) from time series observational data is highly challenging due to the dynamic nature and complex nonlinear interactions between variables. Existing methods typically search for the optimal DAG by optimizing an objective function but face scalability challenges, as their computational demands grow exponentially with the dimensional expansion of variables. To this end, we propose LOCAL, a highly efficient, easy-to-implement, and constraint-free method for recovering dynamic causal structures. LOCAL is the first attempt to formulate a quasi-maximum likelihood-based score function for learning the dynamic DAG equivalent to the ground truth. Building on this, we introduce two adaptive modules that enhance the algebraic characterization of acyclicity: Asymptotic Causal Mask Learning (ACML) and Dynamic Graph Parameter Learning (DGPL). ACML constructs causal masks using learnable priority vectors and the Gumbel-Sigmoid function, ensuring DAG formation while optimizing computational efficiency. DGPL transforms causal learning into decomposed matrix products, capturing dynamic causal structure in high-dimensional data and improving interpretability. Extensive experiments on synthetic and real-world datasets demonstrate that LOCAL significantly outperforms existing methods and highlight LOCAL's potential as a robust and efficient method for dynamic causal discovery.

cs.LG↗

Emerging orthorhombic two-dimensional van der Waals magnets

Two-dimensional (2D) magnetism realized in van der Waals (vdW) materials has expanded to include a great variety of magnetic phases, over a short decade since its first discovery in 2016-2017. However, most of the investigated vdW magnets so far have highly symmetric crystal fields and isotropic in-plane lattice structures, making their 2D magnetism robust but often classical and expected. In this Perspective, we highlight a family of vdW magnets that have distorted crystal fields with low symmetries and orthorhombic crystal lattices with strong anisotropy, and furthermore, show their prospects for realizing a much richer landscape of magnetic phases and phase transitions. First, we introduce the classification of 2D vdW magnets based on their crystal fields and make a contrast between the orthorhombic vdW magnets of focus here and other popular honeycomb/hexagonal/kagome vdW magnets. We then discuss the material candidates, the emergent properties, and the designed controls for these orthorhombic 2D vdW magnets, using the representative CrSBr as an example and extending beyond it. Finally, we discuss a few existing challenges in orthorhombic 2D vdW magnets, overcome which would pave the way towards magneto-optical, opto-magnetic, and spintronic devices based on orthorhombic 2D vdW magnetism.

cond-mat.mtrl-sci↗

ReFocus: Reinforcing Mid-Frequency and Key-Frequency Modeling for Multivariate Time Series Forecasting

Recent advancements have progressively incorporated frequency-based techniques into deep learning models, leading to notable improvements in accuracy and efficiency for time series analysis tasks. However, the Mid-Frequency Spectrum Gap in the real-world time series, where the energy is concentrated at the low-frequency region while the middle-frequency band is negligible, hinders the ability of existing deep learning models to extract the crucial frequency information. Additionally, the shared Key-Frequency in multivariate time series, where different time series share indistinguishable frequency patterns, is rarely exploited by existing literature. This work introduces a novel module, Adaptive Mid-Frequency Energy Optimizer, based on convolution and residual learning, to emphasize the significance of mid-frequency bands. We also propose an Energy-based Key-Frequency Picking Block to capture shared Key-Frequency, which achieves superior inter-series modeling performance with fewer parameters. A novel Key-Frequency Enhanced Training strategy is employed to further enhance Key-Frequency modeling, where spectral information from other channels is randomly introduced into each channel. Our approach advanced multivariate time series forecasting on the challenging Traffic, ECL, and Solar benchmarks, reducing MSE by 4%, 6%, and 5% compared to the previous SOTA iTransformer. Code is available at this GitHub Repository: https://github.com/Levi-Ackman/ReFocus.

cs.LG↗

LiNo: Advancing Recursive Residual Decomposition of Linear and Nonlinear Patterns for Robust Time Series Forecasting

Forecasting models are pivotal in a data-driven world with vast volumes of time series data that appear as a compound of vast Linear and Nonlinear patterns. Recent deep time series forecasting models struggle to utilize seasonal and trend decomposition to separate the entangled components. Such a strategy only explicitly extracts simple linear patterns like trends, leaving the other linear modes and vast unexplored nonlinear patterns to the residual. Their flawed linear and nonlinear feature extraction models and shallow-level decomposition limit their adaptation to the diverse patterns present in real-world scenarios. Given this, we innovate Recursive Residual Decomposition by introducing explicit extraction of both linear and nonlinear patterns. This deeper-level decomposition framework, which is named LiNo, captures linear patterns using a Li block which can be a moving average kernel, and models nonlinear patterns using a No block which can be a Transformer encoder. The extraction of these two patterns is performed alternatively and recursively. To achieve the full potential of LiNo, we develop the current simple linear pattern extractor to a general learnable autoregressive model, and design a novel No block that can handle all essential nonlinear patterns. Remarkably, the proposed LiNo achieves state-of-the-art on thirteen real-world benchmarks under univariate and multivariate forecasting scenarios. Experiments show that current forecasting models can deliver more robust and precise results through this advanced Recursive Residual Decomposition. We hope this work could offer insight into designing more effective forecasting models. Code is available at this Repository: https://github.com/Levi-Ackman/LiNo.

cs.LG↗

Neuromorphic spatiotemporal optical flow: Enabling ultrafast visual perception beyond human capabilities

Optical flow, inspired by the mechanisms of biological visual systems, calculates spatial motion vectors within visual scenes that are necessary for enabling robotics to excel in complex and dynamic working environments. However, current optical flow algorithms, despite human-competitive task performance on benchmark datasets, remain constrained by unacceptable time delays (~0.6 seconds per inference, 4X human processing speed) in practical deployment. Here, we introduce a neuromorphic optical flow approach that addresses delay bottlenecks by encoding temporal information directly in a synaptic transistor array to assist spatial motion analysis. Compared to conventional spatial-only optical flow methods, our spatiotemporal neuromorphic optical flow offers the spatial-temporal consistency of motion information, rapidly identifying regions of interest in as little as 1-2 ms using the temporal motion cues derived from the embedded temporal information in the two-dimensional floating gate synaptic transistors. Thus, the visual input can be selectively filtered to achieve faster velocity calculations and various task execution. At the hardware level, due to the atomically sharp interfaces between distinct functional layers in two-dimensional van der Waals heterostructures, the synaptic transistor offers high-frequency response (~100 μs), robust non-volatility (>10000 s), and excellent endurance (>8000 cycles), enabling robust visual processing. In software benchmarks, our system outperforms state-of-the-art algorithms with a 400% speedup, frequently surpassing human-level performance while maintaining or enhancing accuracy by utilizing the temporal priors provided by the embedded temporal information.

cs.CV↗

Image-to-Force Estimation for Soft Tissue Interaction in Robotic-Assisted Surgery Using Structured Light

For Minimally Invasive Surgical (MIS) robots, accurate haptic interaction force feedback is essential for ensuring the safety of interacting with soft tissue. However, most existing MIS robotic systems cannot facilitate direct measurement of the interaction force with hardware sensors due to space limitations. This letter introduces an effective vision-based scheme that utilizes a One-Shot structured light projection with a designed pattern on soft tissue coupled with haptic information processing through a trained image-to-force neural network. The images captured from the endoscopic stereo camera are analyzed to reconstruct high-resolution 3D point clouds for soft tissue deformation. Based on this, a modified PointNet-based force estimation method is proposed, which excels in representing the complex mechanical properties of soft tissue. Numerical force interaction experiments are conducted on three silicon materials with different stiffness. The results validate the effectiveness of the proposed scheme.

cs.RO↗

JailBreakV: A Benchmark for Assessing the Robustness of MultiModal Large Language Models against Jailbreak Attacks

With the rapid advancements in Multimodal Large Language Models (MLLMs), securing these models against malicious inputs while aligning them with human values has emerged as a critical challenge. In this paper, we investigate an important and unexplored question of whether techniques that successfully jailbreak Large Language Models (LLMs) can be equally effective in jailbreaking MLLMs. To explore this issue, we introduce JailBreakV-28K, a pioneering benchmark designed to assess the transferability of LLM jailbreak techniques to MLLMs, thereby evaluating the robustness of MLLMs against diverse jailbreak attacks. Utilizing a dataset of 2, 000 malicious queries that is also proposed in this paper, we generate 20, 000 text-based jailbreak prompts using advanced jailbreak attacks on LLMs, alongside 8, 000 image-based jailbreak inputs from recent MLLMs jailbreak attacks, our comprehensive dataset includes 28, 000 test cases across a spectrum of adversarial scenarios. Our evaluation of 10 open-source MLLMs reveals a notably high Attack Success Rate (ASR) for attacks transferred from LLMs, highlighting a critical vulnerability in MLLMs that stems from their text-processing capabilities. Our findings underscore the urgent need for future research to address alignment vulnerabilities in MLLMs from both textual and visual inputs.

cs.CR↗

Incommensurate Transverse Peierls Transition

In one-dimensional quantum materials, conducting electrons and the underlying lattices can undergo a spontaneous translational symmetry breaking, known as Peierls transition. For nearly a century, the Peierls transition has been understood within the paradigm of electron-electron interactions mediated by longitudinal acoustic phonons. This classical picture has recently been revised in topological semimetals, where transverse acoustic phonons can couple with conducting p-orbital electrons and give rise to an unconventional Fermi surface instability, dubbed the transverse Peierls transition (TPT). Most interestingly, the TPT induced lattice distortions can further break rotation or mirror/inversion symmetries, leading to nematic or chiral charge density waves (CDWs). Quantum materials that host the TPT, however, have not been experimentally established. Here, we report the experimental discovery of an incommensurate TPT in the tetragonal Dirac semimetal EuAl$_4$. Using inelastic x-ray scattering with meV resolution, we observe the complete softening of a transverse acoustic phonon at the CDW wavevector upon cooling, whereas the longitudinal acoustic phonon is nearly unchanged. Combining with first principles calculations, we show that the incommensurate CDW wavevector matches the calculated charge susceptibility peak and connects the nested Dirac bands with Al 3$p_{x}$ and 3$p_{y}$ orbitals. Supplemented by second harmonic generation measurements, we show that the CDW induced lattice distortions break all vertical and diagonal mirrors whereas the four-fold rotational symmetry is retained below the CDW transition. Our observations strongly suggest a chiral CDW in EuAl$_4$ and highlight the TPT as a new avenue for chiral quantum states.

cond-mat.str-el↗

Low-Light Object Tracking: A Benchmark

In recent years, the field of visual tracking has made significant progress with the application of large-scale training datasets. These datasets have supported the development of sophisticated algorithms, enhancing the accuracy and stability of visual object tracking. However, most research has primarily focused on favorable illumination circumstances, neglecting the challenges of tracking in low-ligh environments. In low-light scenes, lighting may change dramatically, targets may lack distinct texture features, and in some scenarios, targets may not be directly observable. These factors can lead to a severe decline in tracking performance. To address this issue, we introduce LLOT, a benchmark specifically designed for Low-Light Object Tracking. LLOT comprises 269 challenging sequences with a total of over 132K frames, each carefully annotated with bounding boxes. This specially designed dataset aims to promote innovation and advancement in object tracking techniques for low-light conditions, addressing challenges not adequately covered by existing benchmarks. To assess the performance of existing methods on LLOT, we conducted extensive tests on 39 state-of-the-art tracking algorithms. The results highlight a considerable gap in low-light tracking performance. In response, we propose H-DCPT, a novel tracker that incorporates historical and darkness clue prompts to set a stronger baseline. H-DCPT outperformed all 39 evaluated methods in our experiments, demonstrating significant improvements. We hope that our benchmark and H-DCPT will stimulate the development of novel and accurate methods for tracking objects in low-light conditions. The LLOT and code are available at https://github.com/OpenCodeGithub/H-DCPT.

cs.CV↗