arXiv subjects

Ang Li

Publications and source records attributed to Ang Li.

At least 181 records · Page 10Linked to original sources

arXiv2025

G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning

Although Large Language Models (LLMs) have demonstrated remarkable progress, their proficiency in graph-related tasks remains notably limited, hindering the development of truly general-purpose models. Previous attempts, including pretraining graph foundation models or employing supervised fine-tuning, often face challenges such as the scarcity of large-scale, universally represented graph data. We introduce G1, a simple yet effective approach demonstrating that Reinforcement Learning (RL) on synthetic graph-theoretic tasks can significantly scale LLMs' graph reasoning abilities. To enable RL training, we curate Erdõs, the largest graph reasoning dataset to date comprising 50 diverse graph-theoretic tasks of varying difficulty levels, 100k training data and 5k test data, all drived from real-world graphs. With RL on Erdõs, G1 obtains substantial improvements in graph reasoning, where our finetuned 3B model even outperforms Qwen2.5-72B-Instruct (24x size). RL-trained models also show strong zero-shot generalization to unseen tasks, domains, and graph encoding schemes, including other graph-theoretic benchmarks as well as real-world node classification and link prediction tasks, without compromising general reasoning abilities. Our findings offer an efficient, scalable path for building strong graph reasoners by finetuning LLMs with RL on graph-theoretic tasks, which combines the strengths of pretrained LLM capabilities with abundant, automatically generated synthetic data, suggesting that LLMs possess graph understanding abilities that RL can elicit successfully. Our implementation is open-sourced at https://github.com/PKU-ML/G1, with models and datasets hosted on Hugging Face collections https://huggingface.co/collections/PKU-ML/g1-683d659e992794fc99618cf2 for broader accessibility.

cs.LG↗

arXiv2025

Compromise-Free Scaling of Qubit Speed and Coherence

Across leading qubit platforms, a common trade-off persists: increasing coherence comes at the cost of operational speed, reflecting the notion that protecting a qubit from its noisy surroundings also limits control over it. This speed-coherence dilemma limits qubit performance across various technologies. Here, we demonstrate a hole spin qubit in a Ge/Si core/shell nanowire that triples its Rabi frequency while simultaneously quadrupling its Hahn-echo coherence time, boosting the Q-factor by over an order of magnitude. This is enabled by the direct Rashba spin-orbit interaction, emerging from heavy-hole-light-hole mixing through strong confinement in two dimensions. Tuning a gate voltage causes this interaction to peak, providing maximum drive speed and a point where the qubit is optimally protected from charge noise, allowing speed and coherence to scale together. Our proof-of-concept shows that careful dot design can overcome a long-standing limitation, offering a new approach towards building high-performance, fault-tolerant qubits.

cond-mat.mes-hall↗

arXiv2025

Embracing Imperfection: Simulating Students with Diverse Cognitive Levels Using LLM-based Agents

Large language models (LLMs) are revolutionizing education, with LLM-based agents playing a key role in simulating student behavior. A major challenge in student simulation is modeling the diverse learning patterns of students at various cognitive levels. However, current LLMs, typically trained as ``helpful assistants'', target at generating perfect responses. As a result, they struggle to simulate students with diverse cognitive abilities, as they often produce overly advanced answers, missing the natural imperfections that characterize student learning and resulting in unrealistic simulations. To address this issue, we propose a training-free framework for student simulation. We begin by constructing a cognitive prototype for each student using a knowledge graph, which captures their understanding of concepts from past learning records. This prototype is then mapped to new tasks to predict student performance. Next, we simulate student solutions based on these predictions and iteratively refine them using a beam search method to better replicate realistic mistakes. To validate our approach, we construct the \texttt{Student\_100} dataset, consisting of $100$ students working on Python programming and $5,000$ learning records. Experimental results show that our method consistently outperforms baseline models, achieving $100\%$ improvement in simulation accuracy.

cs.LG↗

arXiv2025

Optimal Interference Exploitation Waveform Design with Relaxed Block-Level Power Constraints

This paper investigates constructive interference (CI)-based waveform design for phase shift keying and quadrature amplitude modulation symbols under relaxed block-level power constraints in multi-user multiple-input single-output (MU-MIMO) communication systems. Existing linear CI-based precoding methods, including symbol-level precoding (SLP) and block-level precoding (BLP), suffer from performance limitations due to strict symbol-level power budgets or insufficient degrees of freedom over the block. To overcome these challenges, we propose a nonlinear waveform optimization framework that introduces additional optimization variables and maximizes the minimum CI metric across the transmission block. The optimal waveform is derived in closed form using the function and Karush Kuhn Tucker conditions, and the solution is explicitly expressed with respect to the dual variables. Moreover, the original problems are equivalently reformulated as tractable quadratic programming (QP) problems. To efficiently solve the derived QP problems, we develop an improved alternating direction method of multipliers (ADMM) algorithm by integrating a linear-time projection technique, which significantly enhances the computational efficiency. Simulation results demonstrate that the proposed algorithms substantially outperform the conventional CI-SLP and CI-BLP approaches, particularly under high-order modulations and large block lengths.

eess.SP↗

arXiv2025

An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications

In this paper, we explore using the Harrow-Hassidim-Lloyd (HHL) algorithm to address scientific and engineering problems through quantum computing, utilizing the NWQSim simulation package on a high-performance computing platform. Focusing on domains such as power-grid management and climate projection, we demonstrate the correlations of the accuracy of quantum phase estimation, along with various properties of coefficient matrices, on the final solution and quantum resource cost in iterative and non-iterative numerical methods such as the Newton--Raphson method and finite difference method, as well as their impacts on quantum error correction costs using the Microsoft Azure Quantum resource estimator. We summarize the exponential resource cost from quantum phase estimation before and after quantum error correction and illustrate a potential way to reduce the demands on physical qubits. This work lays down a preliminary step for future investigations, urging a closer examination of quantum algorithms' scalability and efficiency in domain applications.

quant-ph↗

arXiv2025

End-to-end image compression and reconstruction with ultrahigh speed and ultralow energy enabled by opto-electronic computing processor

The rapid development of AR/VR, remote sensing, satellite radar, and medical equipment has created an imperative demand for ultra efficient image compression and reconstruction that exceed the capabilities of electronic processors. For the first time, we demonstrate an end to end image compression and reconstruction approach using an optoelectronic computing processor,achieving orders of magnitude higher speed and lower energy consumption than electronic counterparts. At its core is a 32X32 silicon photonic computing chip, which monolithically integrates 32 high speed modulators, 32 detectors, and a programmable photonic matrix core, copackaged with all necessary control electronics (TIA, ADC, DAC, FPGA etc.). Leveraging the photonic matrix core programmability, the processor generates trainable compressive matrices, enabling adjustable image compression ratios (from 2X to 256X) to meet diverse application needs. Deploying a custom lightweight photonic integrated circuit oriented network (LiPICO-Net) enables high quality reconstruction of compressed images. Our approach delivers an end to end latency of only 49.5ps/pixel while consuming only less than 10.6nJ/pixel-both metrics representing 2-3 orders of magnitude improvement compared with classical models running on state-of-the-art GPUs. We validate the system on a 130 million-pixel aerial imagery, enabling real time compression where electronic systems falter due to power and latency constraints. This work not only provides a transformative solution for massive image processing but also opens new avenues for photonic computing applications.

physics.optics↗

arXiv2025

Predictive Auditing of Hidden Tokens in LLM APIs via Reasoning Length Estimation

Commercial LLM services often conceal internal reasoning traces while still charging users for every generated token, including those from hidden intermediate steps, raising concerns of token inflation and potential overbilling. This gap underscores the urgent need for reliable token auditing, yet achieving it is far from straightforward: cryptographic verification (e.g., hash-based signature) offers little assurance when providers control the entire execution pipeline, while user-side prediction struggles with the inherent variance of reasoning LLMs, where token usage fluctuates across domains and prompt styles. To bridge this gap, we present PALACE (Predictive Auditing of LLM APIs via Reasoning Token Count Estimation), a user-side framework that estimates hidden reasoning token counts from prompt-answer pairs without access to internal traces. PALACE introduces a GRPO-augmented adaptation module with a lightweight domain router, enabling dynamic calibration across diverse reasoning tasks and mitigating variance in token usage patterns. Experiments on math, coding, medical, and general reasoning benchmarks show that PALACE achieves low relative error and strong prediction accuracy, supporting both fine-grained cost auditing and inflation detection. Taken together, PALACE represents an important first step toward standardized predictive auditing, offering a practical path to greater transparency, accountability, and user trust.

cs.LG↗

arXiv2025

Unified QMF equation of state for neutron star matter: Static and dynamic properties

We construct a set of unified equations of state based on the quark mean field (QMF) model, calibrated to different values of nuclear symmetry energy slope at the saturation density ($L_0$), with the aim of exploring both the static properties and dynamical behavior of neutron stars (NSs), and building a coherent picture of their internal structure. We assess the performance of these QMF models in describing the mass-radius relation, the cooling evolution of isolated NSs and X-ray transients, and the instabilities (e.g., the r-mode). In comparison to relativistic mean field (RMF) models formulated at the hadronic level, the QMF model predicts heavier nuclear clusters and larger Wigner-Seitz cell sizes in the NS crust, while the density of the free neutron gas remains largely similar between the two approaches. For the cooling of isolated NSs, the thermal evolution is found to be insensitive to both the many-body model and the symmetry energy slope in the absence of the direct Urca (dUrca) process. However, when rapid cooling via the dUrca process is allowed, in the case of large $L_0$ values (e.g., $L_0 \gtrsim 80$ MeV) in our study, the QMF model predicts a longer thermal relaxation time. Both the QMF and RMF models can reproduce cooling curves consistent with observations of X-ray transients (e.g., KS 1731--260) during their crustal cooling phase, although stellar parameters show slight variations depending on the model and symmetry energy slope. Within our unified framework, a larger $L_0$ value generally results in a wider instability window, while increasing the stellar mass tends to suppress the instability window. We also provide simple power-law parameterizations that quantify the dependence of bulk and shear viscosities on the symmetry energy slope for nuclear matter at saturation density.

nucl-th↗

arXiv2025

MCP4EDA: LLM-Powered Model Context Protocol RTL-to-GDSII Automation with Backend Aware Synthesis Optimization

This paper presents MCP4EDA, the first Model Context Protocol server that enables Large Language Models (LLMs) to control and optimize the complete open-source RTL-to-GDSII design flow through natural language interaction. The system integrates Yosys synthesis, Icarus Verilog simulation, OpenLane place-and-route, GTKWave analysis, and KLayout visualization into a unified LLM-accessible interface, enabling designers to execute complex multi-tool EDA workflows conversationally via AI assistants such as Claude Desktop and Cursor IDE. The principal contribution is a backend-aware synthesis optimization methodology wherein LLMs analyze actual post-layout timing, power, and area metrics from OpenLane results to iteratively refine synthesis TCL scripts, establishing a closed-loop optimization system that bridges the traditional gap between synthesis estimates and physical implementation reality. In contrast to conventional flows that rely on wire-load models, this methodology leverages real backend performance data to guide synthesis parameter tuning, optimization sequence selection, and constraint refinement, with the LLM functioning as an intelligent design space exploration agent. Experimental evaluation on representative digital designs demonstrates 15-30% improvements in timing closure and 10-20% area reduction compared to default synthesis flows, establishing MCP4EDA as the first practical LLM-controlled end-to-end open-source EDA automation system. The code and demo are avaiable at: http://www.agent4eda.com/

cs.AR↗

arXiv2025

STQS: A Unified System Architecture for Spatial Temporal Quantum Sensing

Quantum sensing (QS) harnesses quantum phenomena to measure physical observables with extraordinary precision, sensitivity, and resolution. Despite significant advancements in quantum sensing, prevailing efforts have focused predominantly on refining the underlying sensor materials and hardware. Given the growing demands of increasingly complex application domains and the continued evolution of quantum sensing technologies, the present moment is the right time to systematically explore distributed quantum sensing architectures and their corresponding design space. We present STQS, a unified system architecture for spatiotemporal quantum sensing that interlaces four key quantum components: sensing, memory, communication, and computation. By employing a comprehensive gate-based framework, we systemically explore the design space of quantum sensing schemes and probe the influence of noise at each state in a sensing workflow through simulation. We introduce a novel distance-based metric that compares reference states to sensing states and assigns a confidence level. We anticipate that the distance measure will serve as an intermediate step towards more advanced quantum signal processing techniques like quantum machine learning. To our knowledge, STQS is the first system-level framework to integrate quantum sensing within a coherent, unified architectural paradigm. STQS provides seamless avenues for unique state preparation, multi-user sensing requests, and addressing practical implementations. We demonstrate the versatility of STQS through evaluations of quantum radar and qubit-based dark matter detection. To highlight the near-term feasibility of our approach, we present results obtained from IBM's Marrakesh and IonQ's Forte devices, validating key STQS components on present day quantum hardware.

quant-ph↗

arXiv2025

Hierarchical Interaction Summarization and Contrastive Prompting for Explainable Recommendations

Explainable recommendations, which use the information of user and item with interaction to generate a explanation for why the user would interact with the item, are crucial for improving user trust and decision transparency to the recommender system. Existing methods primarily rely on encoding features of users and items to embeddings, which often leads to information loss due to dimensionality reduction, sparse interactions, and so on. With the advancements of large language models (LLMs) in language comprehension, some methods use embeddings as LLM inputs for explanation generation. However, since embeddings lack inherent semantics, LLMs must adjust or extend their parameters to interpret them, a process that inevitably incurs information loss. To address this issue, we propose a novel approach combining profile generation via hierarchical interaction summarization (PGHIS), which leverages a pretrained LLM to hierarchically summarize user-item interactions, generating structured textual profiles as explicit representations of user and item characteristics. Additionally, we propose contrastive prompting for explanation generation (CPEG) which employs contrastive learning to guide another reasoning language models in producing high-quality ground truth recommendation explanations. Finally, we use the textual profiles of user and item as input and high-quality explanation as output to fine-tune a LLM for generating explanations. Experimental results on multiple datasets demonstrate that our approach outperforms existing state-of-the-art methods, achieving a great improvement on metrics about explainability (e.g., 5% on GPTScore) and text quality. Furthermore, our generated ground truth explanations achieve a significantly higher win rate compared to user-written reviews and those produced by other methods, demonstrating the effectiveness of CPEG in generating high-quality ground truths.

cs.IR↗

arXiv2025

Coupled Cluster Downfolding Theory in Simulations of Chemical Systems on Quantum Hardware

The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to these problems is currently infeasible due to limitations in the number of logical qubits, their fidelity, and the shallow circuit depths supported by existing hardware; all of which hinder simulations at the required level of accuracy. A promising alternative is hybrid quantum-classical computing, where classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices. In this paper, we demonstrate the performance of a hybrid approach: coupled-cluster downfolded Hamiltonians are first evaluated in reduced-dimensionality active spaces, and the corresponding ground-state energies are subsequently computed using quantum algorithms. Our comprehensive analysis explores the achievable accuracy in recovering correlation energies when hundreds of orbitals are downfolded into a problem size tractable by today's quantum hardware. We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum (NISQ) devices and future fault-tolerant quantum computers, marking a step toward the early realization of quantum advantage in chemistry.

quant-ph↗

arXiv2025

EdgeLoRA: An Efficient Multi-Tenant LLM Serving System on Edge Devices

Large Language Models (LLMs) have gained significant attention due to their versatility across a wide array of applications. Fine-tuning LLMs with parameter-efficient adapters, such as Low-Rank Adaptation (LoRA), enables these models to efficiently adapt to downstream tasks without extensive retraining. Deploying fine-tuned LLMs on multi-tenant edge devices offers substantial benefits, such as reduced latency, enhanced privacy, and personalized responses. However, serving LLMs efficiently on resource-constrained edge devices presents critical challenges, including the complexity of adapter selection for different tasks and memory overhead from frequent adapter swapping. Moreover, given the multiple requests in multi-tenant settings, processing requests sequentially results in underutilization of computational resources and increased latency. This paper introduces EdgeLoRA, an efficient system for serving LLMs on edge devices in multi-tenant environments. EdgeLoRA incorporates three key innovations: (1) an adaptive adapter selection mechanism to streamline the adapter configuration process; (2) heterogeneous memory management, leveraging intelligent adapter caching and pooling to mitigate memory operation overhead; and (3) batch LoRA inference, enabling efficient batch processing to significantly reduce computational latency. Comprehensive evaluations using the Llama3.1-8B model demonstrate that EdgeLoRA significantly outperforms the status quo (i.e., llama.cpp) in terms of both latency and throughput. The results demonstrate that EdgeLoRA can achieve up to a 4 times boost in throughput. Even more impressively, it can serve several orders of magnitude more adapters simultaneously. These results highlight EdgeLoRA's potential to transform edge deployment of LLMs in multi-tenant scenarios, offering a scalable and efficient solution for resource-constrained environments.

cs.DC↗

arXiv2025

Avoid Forgetting by Preserving Global Knowledge Gradients in Federated Learning with Non-IID Data

The inevitable presence of data heterogeneity has made federated learning very challenging. There are numerous methods to deal with this issue, such as local regularization, better model fusion techniques, and data sharing. Though effective, they lack a deep understanding of how data heterogeneity can affect the global decision boundary. In this paper, we bridge this gap by performing an experimental analysis of the learned decision boundary using a toy example. Our observations are surprising: (1) we find that the existing methods suffer from forgetting and clients forget the global decision boundary and only learn the perfect local one, and (2) this happens regardless of the initial weights, and clients forget the global decision boundary even starting from pre-trained optimal weights. In this paper, we present FedProj, a federated learning framework that robustly learns the global decision boundary and avoids its forgetting during local training. To achieve better ensemble knowledge fusion, we design a novel server-side ensemble knowledge transfer loss to further calibrate the learned global decision boundary. To alleviate the issue of learned global decision boundary forgetting, we further propose leveraging an episodic memory of average ensemble logits on a public unlabeled dataset to regulate the gradient updates at each step of local training. Experimental results demonstrate that FedProj outperforms state-of-the-art methods by a large margin.

cs.LG↗

arXiv2025

Timing results of 22 years for PSR J0922+0638

We conducted a timing analysis of PSR J0922+0638 (B0919+06) using data from the Nanshan 26 m radio telescope and the MeerKAT telescope, spanning from January 2001 to March 2023. During this 22-year period, we discovered a previously unreported small glitch (glitch 1) before the well-known large glitch (glitch 2), occurring at ${\rm MJD} \sim 53325(3)$, with a frequency jump amplitude of $Δν/ν\sim 0.79(6) \times 10^{-9}$. We also identified ten slow glitch events, half of which were newly detected. These slow glitches occurred quasi-periodically, with an average interval of approximately 553(21) days, fractional frequency changes ranging from $Δν/ν\sim 1.13(1) \times 10^{-9}$ to $4.08(5) \times 10^{-9}$, and a maximum fractional change in the first derivative of the frequency of $Δ\dotν/\dotν \sim -4.6 \times 10^{-3}$. Additionally, our timing noise analysis reveals a change in the spectral index for noise power before and after glitch 2, with values of $-6.0$ and $-5.3$, respectively, likely due to this large glitch. Throughout the entire observation period, the first derivative of the spin frequency ($\dotν$) showed a periodic structure. The possible modulation period was estimated to be 537(24) days before the 700-day data gap at MJD 56716 and 600(58) days afterward. We discuss the periodic oscillations in pulsar rotation as a possible manifestation of spin-down noise and quasi-periodic slow glitches.

astro-ph.HE↗

arXiv2025

A direct dispersive signature of Pauli spin blockade

Pauli Spin Blockade (PSB) is a key paradigm in semiconductor nanostructures and gives access to the spin physics. We report the direct observation of PSB with gate-dispersive reflectometry on double quantum dots with source-drain bias. The reservoir charge transitions are strongly modulated, turning on and off when entering and leaving the blockaded region, consistent with a simple model. Seen with holes in Ge and Si, the effects are enhanced with larger bias voltage and suppressed by magnetic field. This work lays the foundation for fast probing of spin physics and minimally invasive spin readout.

cond-mat.mes-hall↗

arXiv2025

EvoVerilog: Large Langugage Model Assisted Evolution of Verilog Code

Large Language Models (LLMs) have demonstrated great potential in automating the generation of Verilog hardware description language code for hardware design. This automation is critical to reducing human effort in the complex and error-prone process of hardware design. However, existing approaches predominantly rely on human intervention and fine-tuning using curated datasets, limiting their scalability in automated design workflows. Although recent iterative search techniques have emerged, they often fail to explore diverse design solutions and may underperform simpler approaches such as repeated prompting. To address these limitations, we introduce EvoVerilog, a novel framework that combines the reasoning capabilities of LLMs with evolutionary algorithms to automatically generate and refine Verilog code. EvoVerilog utilizes a multiobjective, population-based search strategy to explore a wide range of design possibilities without requiring human intervention. Extensive experiments demonstrate that EvoVerilog achieves state-of-the-art performance, with pass@10 scores of 89.1 and 80.2 on the VerilogEval-Machine and VerilogEval-Human benchmarks, respectively. Furthermore, the framework showcases its ability to explore diverse designs by simultaneously generating a variety of functional Verilog code while optimizing resource utilization.

cs.AR↗

arXiv2025

GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems

Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using current quantum computing techniques and high-performance computing (HPC) systems. In this work, we improve the scalability and efficiency of DQAOA through advanced problem decomposition and parallel execution using message passing on the Frontier CPU/GPU supercomputer. Our approach ensures efficient quantum-classical workload management by distributing large problem instances across classical and quantum resources. Experimental results demonstrate that enhanced decomposition strategies and GPU-accelerated quantum simulations significantly improve DQAOA's performance, achieving up to 10x speedup over CPU-based simulations. This advancement enables better scalability for large problem instances, supporting the practical deployment of GPU systems for hybrid quantum-classical applications. We also highlight ongoing integration efforts using the Quantum Framework (QFw) to support future HPC-quantum computing systems.

cs.DC↗