arXiv subjects

Yuxiang Liu

Publications and source records attributed to Yuxiang Liu.

At least 37 records · Page 2Linked to original sources

arXiv2026

Hardware-Aware Quantum Kernel Design Based on Graph Neural Networks

Quantum kernels hold significant promise for achieving computational advantages in quantum machine learning (QML), yet their effectiveness critically depends on the design of expressive and hardware-compatible feature maps, a challenge that is particularly pronounced on Noisy Intermediate-Scale Quantum (NISQ) devices with limited qubits, gate errors, and restricted connectivity. In this work, we propose a hardware-aware framework for automated quantum kernel design that integrates quantum device characteristics with learning-based evaluation. Specifically, candidate quantum circuits explored within the hardware-aware circuit space are represented as directed acyclic graphs (DAGs) encoding hardware-specific information such as gate operations, qubit interactions, and noise properties, while a dual graph neural network (GNN) predictor is employed to estimate key surrogate metrics, including probability of successful trials (PST) and kernel-target alignment (KTA), enabling efficient and accurate assessment of circuit fidelity and kernel performance to facilitate the identification of task-specific quantum kernels. Furthermore, feature selection is incorporated to reduce input dimensionality and ensure compatibility with near-term devices. Extensive experiments on multiple benchmark datasets, including Credit Card (CC), MNIST-5, and FMNIST-4, demonstrate that our method consistently outperforms existing baselines in classification accuracy, effectively balancing hardware constraints and model expressivity under realistic noise conditions. These results highlight the potential of combining hardware-aware design with deep learning techniques to advance practical quantum kernel methods and facilitate their deployment on near-term quantum hardware.

quant-ph↗

arXiv2026

From Perception to Planning: Evolving Ego-Centric Task-Oriented Spatiotemporal Reasoning via Curriculum Learning

Modern vision-language models achieve strong performance in static perception, but remain limited in the complex spatiotemporal reasoning required for embodied, egocentric tasks. A major source of failure is their reliance on temporal priors learned from passive video data, which often leads to spatiotemporal hallucinations and poor generalization in dynamic environments. To address this, we present EgoTSR, a curriculum-based framework for learning task-oriented spatiotemporal reasoning. EgoTSR is built on the premise that embodied reasoning should evolve from explicit spatial understanding to internalized task-state assessment and finally to long-horizon planning. To support this paradigm, we construct EgoTSR-Data, a large-scale dataset comprising 46 million samples organized into three stages: Chain-of-Thought (CoT) supervision, weakly supervised tagging, and long-horizon sequences. Extensive experiments demonstrate that EgoTSR effectively eliminates chronological biases, achieving 92.4% accuracy on long-horizon logical reasoning tasks while maintaining high fine-grained perceptual precision, significantly outperforming existing open-source and closed-source state-of-the-art models.

cs.AI↗

arXiv2026

Characterizing charge-parity detection based on an offset-charge-tunable transmon qubit via randomized benchmarking

Superconducting qubits are compelling platforms for charge-parity detection and, due to their theoretical sensitivity on the meV energy scale, hold promise for rare event searches. In this work, we realize high-fidelity mapping of charge-parity states onto qubit states using an offset-charge-tunable transmon qubit and efficiently characterize the fidelity of the charge-parity detection via randomized benchmarking. Specifically, a gate control line is applied to control offset charge, allowing us to achieve the single-qubit gate fidelity up to 99.96%. We combine a net-zero-based pulse on the gate line with a spin-echo-based sequence to realize charge-parity mapping, achieving a fidelity of 99.37%. Then, we demonstrate continuous monitoring of the charge-parity state with over 93.4% fidelity at a 4-μs sampling interval. Finally, an error analysis of charge-parity detection is performed, and it is found that qubit readout is currently the largest source of error. We believe this work lays the foundation for future exploration of ultra-low energy particles.

quant-ph↗

arXiv2026

Hodge rigidity of Chern classes

In this paper, we study the homogeneous components of the Chern--Schwartz--MacPherson (CSM) classes of Schubert cells. We prove that, under suitable conditions, each such component is represented by an irreducible subvariety. In particular, our result extends Huh's result \cite{Huh} by relaxing the regularity assumption on log resolutions. As a consequence, the conclusion holds for all cominuscule Schubert cells of classical type and for a large family of exceptional cases. We also obtain analogous results for certain Schubert varieties in symplectic Grassmannians and flag varieties.

math.AG↗

arXiv2026

Bridging Discrete Marks and Continuous Dynamics: Dual-Path Cross-Interaction for Marked Temporal Point Processes

Predicting irregularly spaced event sequences with discrete marks poses significant challenges due to the complex, asynchronous dependencies embedded within continuous-time data streams.Existing sequential approaches capture dependencies among event tokens but ignore the continuous evolution between events, while Neural Ordinary Differential Equation (Neural ODE) methods model smooth dynamics yet fail to account for how event types influence future timing.To overcome these limitations, we propose NEXTPP, a dual-channel framework that unifies discrete and continuous representations via Event-granular Neural Evolution with Cross-Interaction for Marked Temporal Point Processes. Specifically, NEXTPP encodes discrete event marks via a self-attention mechanism, simultaneously evolving a latent continuous-time state using a Neural ODE. These parallel streams are then fused through a crossattention module to enable explicit bidirectional interaction between continuous and discrete representations. The fused representations drive the conditional intensity function of the neural Hawkes process, while an iterative thinning sampler is employed to generate future events. Extensive evaluations on five real-world datasets demonstrate that NEXTPP consistently outperforms state-of-the-art models. The source code can be found at https://github.com/AONE-NLP/NEXTPP.

cs.LG↗

arXiv2026

Output Prediction of Quantum Circuits based on Graph Neural Networks

The output prediction of quantum circuits is a formidably challenging task imperative in developing quantum devices. Motivated by the natural graph representation of quantum circuits, this paper proposes a Graph Neural Networks (GNNs)-based framework to predict the output expectation values of quantum circuits under noisy and noiseless conditions and compare the performance of different parameterized quantum circuits (PQCs). We construct datasets under noisy and noiseless conditions using a non-parameterized quantum gate set to predict circuit expectation values. The node feature vectors for GNNs are specifically designed to include noise information. In our simulations, we compare the prediction performance of GNNs in both noisy and noiseless conditions against Convolutional Neural Networks (CNNs) on the same dataset and their qubit scalability. GNNs demonstrate superior prediction accuracy across diverse conditions. Subsequently, we utilize the parameterized quantum gate set to construct noisy PQCs and compute the ground state energy of hydrogen molecules using the Variational Quantum Eigensolver (VQE). We propose two schemes: the Indirect Comparison scheme, which involves directly predicting the ground state energy and subsequently comparing circuit performances, and the Direct Comparison scheme, which directly predicts the relative performance of the two circuits. Simulation results indicate that the Direct Comparison scheme significantly outperforms the Indirect Comparison scheme by an average of 36.2% on the same dataset, providing a new and effective perspective for using GNNs to predict the overall properties of PQCs, specifically by focusing on their performance differences.

quant-ph↗

arXiv2025

Bohrium + SciMaster: Building the Infrastructure and Ecosystem for Agentic Science at Scale

AI agents are emerging as a practical way to run multi-step scientific workflows that interleave reasoning with tool use and verification, pointing to a shift from isolated AI-assisted steps toward \emph{agentic science at scale}. This shift is increasingly feasible, as scientific tools and models can be invoked through stable interfaces and verified with recorded execution traces, and increasingly necessary, as AI accelerates scientific output and stresses the peer-review and publication pipeline, raising the bar for traceability and credible evaluation. However, scaling agentic science remains difficult: workflows are hard to observe and reproduce; many tools and laboratory systems are not agent-ready; execution is hard to trace and govern; and prototype AI Scientist systems are often bespoke, limiting reuse and systematic improvement from real workflow signals. We argue that scaling agentic science requires an infrastructure-and-ecosystem approach, instantiated in Bohrium+SciMaster. Bohrium acts as a managed, traceable hub for AI4S assets -- akin to a HuggingFace of AI for Science -- that turns diverse scientific data, software, compute, and laboratory systems into agent-ready capabilities. SciMaster orchestrates these capabilities into long-horizon scientific workflows, on which scientific agents can be composed and executed. Between infrastructure and orchestration, a \emph{scientific intelligence substrate} organizes reusable models, knowledge, and components into executable building blocks for workflow reasoning and action, enabling composition, auditability, and improvement through use. We demonstrate this stack with eleven representative master agents in real workflows, achieving orders-of-magnitude reductions in end-to-end scientific cycle time and generating execution-grounded signals from real workloads at multi-million scale.

cs.AI↗

arXiv2025

Quantum-Based Self-Attention Mechanism for Hardware-Aware Differentiable Quantum Architecture Search

The automated design of parameterized quantum circuits for variational algorithms in the NISQ era faces a fundamental limitation, as conventional differentiable architecture search relies on classical models that fail to adequately represent quantum gate interactions under hardware noise. We introduce the Quantum-Based Self-Attention for Differentiable Quantum Architecture Search (QBSA-DQAS), a meta-learning framework featuring quantum-based self-attention and hardware-aware multi-objective search. The framework employs a two-stage quantum self-attention module that computes contextual dependencies by mapping architectural parameters through parameterized quantum circuits, replacing classical similarity metrics with quantum-derived attention scores, then applies position-wise quantum transformations for feature enrichment. Architecture search is guided by a task-agnostic multi-objective function jointly optimizing noisy expressibility and Probability of Successful Trials (PST). A post-search optimization stage applies gate commutation, fusion, and elimination to reduce circuit complexity. Experimental validation demonstrates superior performance on VQE tasks and large-scale Wireless Sensor Networks. For VQE on H$_2$, QBSA-DQAS achieves 0.9 accuracy compared to 0.89 for standard DQAS. Post-search optimization reduces discovered circuit complexity by up to 44% in gate count and 47% in depth without accuracy degradation. The framework maintains robust performance across three molecules and five IBM quantum hardware noise models. For WSN routing, discovered circuits achieve 8.6% energy reduction versus QAOA and 40.7% versus classical greedy methods, establishing the effectiveness of quantum-native architecture search for NISQ applications.

quant-ph↗

arXiv2025

Deep Andromeda JCMT-SCUBA2 Observations. The Submillimeter Maps and Giant Molecular Clouds

We have carried out unprecedentedly deep, nearly confusion-limited JCMT-SCUBA2 mapping observations on the nearest spiral galaxy, M31 (Andromeda). The 850 $μ$m image with a $\sim$50 pc resolution yields a comprehensive catalog of 383 giant molecular clouds (GMCs) that are associated with the spiral arms. In addition, it unveiled a population of 189 compact inter-arm GMCs in M31, which are mostly unresolved or marginally resolved. The masses of all these GMCs are in the range of 2$\times$10$^4$ -- 6$\times$10$^6$ $M_{\odot}$; the sizes are in the range of 30--130 pc. They follow a mass-size correlation, $M$ $\propto$ $R_{c}$$^{2.5}$. The inter-arm GMCs are systematically less massive, more diffuse, colder, and have lower star-forming efficiency (SFE) than on-arm GMCs. Moreover, within individual spatially resolved on-arm and off-arm M31 GMCs, the SFE is considerably lower than the SFE in molecular clouds in main sequence and green valley galaxies. Follow-up investigations on M31 GMCs may provide clues for how star formation may be quenched in galactic environments. Finally, we reconstrained the dust opacity spectral index $β$ in the M31 galaxy by combining our new JCMT observations with archival Herschel and Planck data and found that the radial variation of $β$ may not be as large as was proposed by previous studies.

astro-ph.GA↗

arXiv2025

Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection in Massive MIMO

In the massive multiple-input and multiple-output (Massive MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becoming classically intricate with the number of the transmitting antennas and the symbols increasing. The quantum approximate optimization algorithm (QAOA), a leading candidate algorithm running in the noisy intermediate-scale quantum (NISQ) devices, can show quantum advantage for approximately solving combinatorial optimization problems. In this paper, we propose the QAOA based the maximum likelihood detection solver of binary symbols. In proposed scheme, we first conduct a universal and compact analytical expression for the expectation value of the 1-level QAOA. Second, a bayesian optimization based parameters initialization is presented, which can speedup the convergence of the QAOA to a lower local minimum and improve the probability of measuring the exact solution. Compared to the state-of-the-art QAOA based ML detection algorithm, our scheme have the more universal and compact expectation value expression of the 1-level QAOA, and requires few quantum resources and has the higher probability to obtain the exact solution.

quant-ph↗

arXiv2025

Exploring Reasoning-Infused Text Embedding with Large Language Models for Zero-Shot Dense Retrieval

Transformer-based models such as BERT and E5 have significantly advanced text embedding by capturing rich contextual representations. However, many complex real-world queries require sophisticated reasoning to retrieve relevant documents beyond surface-level lexical matching, where encoder-only retrievers often fall short. Decoder-only large language models (LLMs), known for their strong reasoning capabilities, offer a promising alternative. Despite this potential, existing LLM-based embedding methods primarily focus on contextual representation and do not fully exploit the reasoning strength of LLMs. To bridge this gap, we propose Reasoning-Infused Text Embedding (RITE), a simple but effective approach that integrates logical reasoning into the text embedding process using generative LLMs. RITE builds upon existing language model embedding techniques by generating intermediate reasoning texts in the token space before computing embeddings, thereby enriching representations with inferential depth. Experimental results on BRIGHT, a reasoning-intensive retrieval benchmark, demonstrate that RITE significantly enhances zero-shot retrieval performance across diverse domains, underscoring the effectiveness of incorporating reasoning into the embedding process.

cs.CL↗

arXiv2025

The Rigidity Problem in Orthogonal Grassmannians

We classify rigid Schubert classes in orthogonal Grassmannians. More generally, given a representative $X$ of a Schubert class in an orthogonal Grassmannian, we give combinatorial conditions which guarantee that every linear space parametrized by $X$ meets a fixed linear space in the required dimension.

math.AG↗

arXiv2025

Identifying the Quadrupolar Nature of Gravitational Wave Background through Space-based Missions

The stochastic gravitational wave background (SGWB) consists of an incoherent collection of waves from both astrophysical and cosmological sources. To distinguish the SGWB from noise, it is essential to verify its quadrupolar nature, exemplified by the cross-correlations among pairs of pulsars within a pulsar timing array, commonly referred to as the Hellings-Downs curve. We study how this quadrupolar signature manifests in correlations between general GW detector pairs, characterized by their antenna responses. Focusing on space-based missions including laser interferometers (LISA, Taiji, TianQin) and atom interferometers (AEDGE/MAGIS), we demonstrate how orbital motion dynamically modulates detector correlations through time-dependent separations and relative orientation shifts. These modulations encode unique statistical features that serve as definitive markers of the SGWB's quadrupolar nature. Our findings identify optimal configurations for these missions, offer forecasts for the time needed to identify the quadrupolar nature of the SGWB, and are applicable to both space-space and space-terrestrial correlations.

gr-qc↗

arXiv2025

Enhancing semi-resolved CFD-DEM for dilute to dense particle-fluid systems: A point cloud based, two-step mapping strategy via coarse graining

Computational fluid dynamics and discrete element method (CFD-DEM) coupling is an efficient and powerful tool to simulate particle-fluid systems. However, current volume-averaged CFD-DEM relying on direct grid-based mapping between the fluid and particle phases can exhibit a strong dependence on the fluid grid resolution, becoming unstable as particles move across fluid grids, and can fail to capture pore fluid pressure effects in very dense granular systems. Here we propose a two-step mapping CFD-DEM which uses a point-based coarse graining technique for intermediate smoothing to overcome these limitations. The discrete particles are first converted into smooth, coarse-grained continuum fields via a multi-layer Fibonacci point cloud, independent of the fluid grids. Then, accurate coupling is achieved between the coarse-grained, point cloud fields and the fluid grid-based variables. The algorithm is validated in various configurations, including weight allocation of a static particle on one-dimensional grids and a falling particle on two-dimensional grids, sedimentation of a sphere in a viscous fluid, size-bidisperse fluidized beds, Ergun's pressure drop test, and immersed granular column collapse. The proposed CFD-DEM represents a novel strategy to accurately simulate fluid-particle interactions for a wide range of grid-to-particle size ratios and solid concentrations, which is of potential use in many industrial and geophysical applications.

physics.flu-dyn↗

arXiv2025

Writing Like the Best: Exemplar-Based Expository Text Generation

We introduce the Exemplar-Based Expository Text Generation task, aiming to generate an expository text on a new topic using an exemplar on a similar topic. Current methods fall short due to their reliance on extensive exemplar data, difficulty in adapting topic-specific content, and issues with long-text coherence. To address these challenges, we propose the concept of Adaptive Imitation and present a novel Recurrent Plan-then-Adapt (RePA) framework. RePA leverages large language models (LLMs) for effective adaptive imitation through a fine-grained plan-then-adapt process. RePA also enables recurrent segment-by-segment imitation, supported by two memory structures that enhance input clarity and output coherence. We also develop task-specific evaluation metrics--imitativeness, adaptiveness, and adaptive-imitativeness--using LLMs as evaluators. Experimental results across our collected three diverse datasets demonstrate that RePA surpasses existing baselines in producing factual, consistent, and relevant texts for this task.

cs.CL↗

arXiv2025

NTR-Gaussian: Nighttime Dynamic Thermal Reconstruction with 4D Gaussian Splatting Based on Thermodynamics

Thermal infrared imaging offers the advantage of all-weather capability, enabling non-intrusive measurement of an object's surface temperature. Consequently, thermal infrared images are employed to reconstruct 3D models that accurately reflect the temperature distribution of a scene, aiding in applications such as building monitoring and energy management. However, existing approaches predominantly focus on static 3D reconstruction for a single time period, overlooking the impact of environmental factors on thermal radiation and failing to predict or analyze temperature variations over time. To address these challenges, we propose the NTR-Gaussian method, which treats temperature as a form of thermal radiation, incorporating elements like convective heat transfer and radiative heat dissipation. Our approach utilizes neural networks to predict thermodynamic parameters such as emissivity, convective heat transfer coefficient, and heat capacity. By integrating these predictions, we can accurately forecast thermal temperatures at various times throughout a nighttime scene. Furthermore, we introduce a dynamic dataset specifically for nighttime thermal imagery. Extensive experiments and evaluations demonstrate that NTR-Gaussian significantly outperforms comparison methods in thermal reconstruction, achieving a predicted temperature error within 1 degree Celsius.

cs.CV↗

arXiv2025

Molecular Odor Prediction with Harmonic Modulated Feature Mapping and Chemically-Informed Loss

Molecular odor prediction has great potential across diverse fields such as chemistry, pharmaceuticals, and environmental science, enabling the rapid design of new materials and enhancing environmental monitoring. However, current methods face two main challenges: First, existing models struggle with non-smooth objective functions and the complexity of mixed feature dimensions; Second, datasets suffer from severe label imbalance, which hampers model training, particularly in learning minority class labels. To address these issues, we introduce a novel feature mapping method and a molecular ensemble optimization loss function. By incorporating feature importance learning and frequency modulation, our model adaptively adjusts the contribution of each feature, efficiently capturing the intricate relationship between molecular structures and odor descriptors. Our feature mapping preserves feature independence while enhancing the model's efficiency in utilizing molecular features through frequency modulation. Furthermore, the proposed loss function dynamically adjusts label weights, improves structural consistency, and strengthens label correlations, effectively addressing data imbalance and label co-occurrence challenges. Experimental results show that our method significantly can improves the accuracy of molecular odor prediction across various deep learning models, demonstrating its promising potential in molecular structure representation and chemoinformatics.

cs.LG↗

arXiv2025

Cavity as Radio Telescope for Galactic Dark Photon

Dark photons, as a minimal extension of the Standard Model through an additional Abelian gauge group, may propagate relativistically across the galaxy, originating from dark matter decay or annihilation, thereby contributing to a galactic dark photon background. The generation of dark photons typically favors certain polarization modes, which are dependent on the interactions between dark matter and dark photons. We introduce a framework in which a resonant cavity is utilized to detect and differentiate these polarizations, leveraging the daily variation in expected signals due to the anisotropic distribution of dark photons and the rotation of the Earth. We conduct an experimental search using superconducting radio-frequency cavities, noted for their exceptionally high quality factors, proving them to be effective telescopes for observing galactic dark photons. This approach establishes the most stringent limits yet on the kinetic mixing coefficient between dark photons and electromagnetic photons, thereby unveiling a novel avenue for the indirect search for dark matter via multi-messenger astronomy.

hep-ph↗