arXiv subjects

Ying Wang

Publications and source records attributed to Ying Wang.

At least 145 records · Page 8Linked to original sources

arXiv2025

Contextuality-based quantum key distribution with deterministic single-photon sources

Photons are central to quantum technologies, with photonic qubits offering a promising platform for quantum communication. Semiconductor quantum dots stand out for their ability to generate single photons on demand, a key capability for enabling long-distance quantum networks. In this work, we utilize high-purity single-photon sources based on self-assembled InAs(Ga)As quantum dots as quantum information carriers. We demonstrate that such on-demand single photons can generate quantum contextuality. This capability enables a novel protocol for semi-device-independent quantum key distribution over free-space channels. Crucially, our method does not require ideal or perfectly projective measurements, opening a new pathway for robust and practical quantum communication.

quant-ph↗

arXiv2025

MMOT: The First Challenging Benchmark for Drone-based Multispectral Multi-Object Tracking

Drone-based multi-object tracking is essential yet highly challenging due to small targets, severe occlusions, and cluttered backgrounds. Existing RGB-based tracking algorithms heavily depend on spatial appearance cues such as color and texture, which often degrade in aerial views, compromising reliability. Multispectral imagery, capturing pixel-level spectral reflectance, provides crucial cues that enhance object discriminability under degraded spatial conditions. However, the lack of dedicated multispectral UAV datasets has hindered progress in this domain. To bridge this gap, we introduce MMOT, the first challenging benchmark for drone-based multispectral multi-object tracking. It features three key characteristics: (i) Large Scale - 125 video sequences with over 488.8K annotations across eight categories; (ii) Comprehensive Challenges - covering diverse conditions such as extreme small targets, high-density scenarios, severe occlusions, and complex motion; and (iii) Precise Oriented Annotations - enabling accurate localization and reduced ambiguity under aerial perspectives. To better extract spectral features and leverage oriented annotations, we further present a multispectral and orientation-aware MOT scheme adapting existing methods, featuring: (i) a lightweight Spectral 3D-Stem integrating spectral features while preserving compatibility with RGB pretraining; (ii) an orientation-aware Kalman filter for precise state estimation; and (iii) an end-to-end orientation-adaptive transformer. Extensive experiments across representative trackers consistently show that multispectral input markedly improves tracking performance over RGB baselines, particularly for small and densely packed objects. We believe our work will advance drone-based multispectral multi-object tracking research. Our MMOT, code, and benchmarks are publicly available at https://github.com/Annzstbl/MMOT.

cs.CV↗

arXiv2025

ChipGPT: How far are we from natural language hardware design

As large language models (LLMs) like ChatGPT exhibited unprecedented machine intelligence, it also shows great performance in assisting hardware engineers to realize higher-efficiency logic design via natural language interaction. To estimate the potential of the hardware design process assisted by LLMs, this work attempts to demonstrate an automated design environment that explores LLMs to generate hardware logic designs from natural language specifications. To realize a more accessible and efficient chip development flow, we present a scalable four-stage zero-code logic design framework based on LLMs without retraining or finetuning. At first, the demo, ChipGPT, begins by generating prompts for the LLM, which then produces initial Verilog programs. Second, an output manager corrects and optimizes these programs before collecting them into the final design space. Eventually, ChipGPT will search through this space to select the optimal design under the target metrics. The evaluation sheds some light on whether LLMs can generate correct and complete hardware logic designs described by natural language for some specifications. It is shown that ChipGPT improves programmability, and controllability, and shows broader design optimization space compared to prior work and native LLMs alone.

cs.AI↗

arXiv2025

Superconducting Sn-Intercalated TaSe$_2$: Structural Diversity Obscured by Routine Characterization Techniques

Using Sn-intercalated TaSe$_2$ as a model system, we demonstrate the presence of structural heterogeneity captured by single-crystal X-ray diffraction (SCXRD) and scanning transmission electron microscopy (STEM) that eludes the routine characterization techniques of powder X-ray diffraction, Raman spectroscopy, and electronic transport measurements. From a single growth composition (1:1:2 Sn:Ta:Se), we obtained crystals diverse in stoichiometry and structure, with near-continuous intercalation for Sn$_x$TaSe$_2$ from $0\lesssim{x}\lesssim1$. Using SCXRD, we found global structural diversity, identifying three new structure types: Sn$_{0.18}$TaSe$_{2.0}$/Sn$_{0.08}$TaSe$_{1.96}$ ($R3m$), Sn$_{0.16}$TaSe$_{2.0}$ ($P6_3/mmc$), and Sn$_{1.2}$TaSe$_{1.9}$ ($Fmm2$). Using STEM, we observed local structural diversity, manifested as regions of highly variable stacking within a single crystal. In contrast, powder X-ray diffraction did not resolve all observed global structures. Raman spectroscopy was unable to distinguish between different structures or compositions in the standard measurement range. Electronic transport measurements showed consistent superconductivity and charge density wave behavior irrespective of Sn-intercalation amount. Our results indicate that routine approaches to characterization of intercalated transition metal dichalcogenides may be inadequate for capturing the diversity of this family of materials, highlighting the need for high-resolution structural characterization when examining the properties of van der Waals-layered compounds.

cond-mat.mtrl-sci↗

arXiv2025

In-Context Clustering with Large Language Models

We propose In-Context Clustering (ICC), a flexible LLM-based procedure for clustering data from diverse distributions. Unlike traditional clustering algorithms constrained by predefined similarity measures, ICC flexibly captures complex relationships among inputs through an attention mechanism. We show that pretrained LLMs exhibit impressive zero-shot clustering capabilities on text-encoded numeric data, with attention matrices showing salient cluster patterns. Spectral clustering using attention matrices offers surprisingly competitive performance. We further enhance the clustering capabilities of LLMs on numeric and image data through fine-tuning using the Next Token Prediction (NTP) loss. Moreover, the flexibility of LLM prompting enables text-conditioned image clustering, a capability that classical clustering methods lack. Our work extends in-context learning to an unsupervised setting, showcasing the effectiveness and flexibility of LLMs for clustering. Our code is available at https://agenticlearning.ai/icc.

cs.LG↗

arXiv2025

Extracting Conceptual Knowledge to Locate Software Issues

Issue localization, which identifies faulty code elements such as files or functions, is critical for effective bug fixing. While recent LLM-based and LLM-agent-based approaches improve accuracy, they struggle in large-scale repositories due to concern tangling, where relevant logic is buried in large functions, and concern scattering, where related logic is dispersed across files. To address these challenges, we propose RepoLens, a novel approach that abstracts and leverages conceptual knowledge from code repositories. RepoLens decomposes fine-grained functionalities and recomposes them into high-level concerns, semantically coherent clusters of functionalities that guide LLMs. It operates in two stages: an offline stage that extracts and enriches conceptual knowledge into a repository-wide knowledge base, and an online stage that retrieves issue-specific terms, clusters and ranks concerns by relevance, and integrates them into localization workflows via minimally intrusive prompt enhancements. We evaluate RepoLens on SWE-Lancer-Loc, a benchmark of 216 tasks derived from SWE-Lancer. RepoLens consistently improves three state-of-the-art tools, namely AgentLess, OpenHands, and mini-SWE-agent, achieving average gains of over 22% in Hit@k and 46% in Recall@k for file- and function-level localization. It generalizes across models (GPT-4o, GPT-4o-mini, GPT-4.1) with Hit@1 and Recall@10 gains up to 504% and 376%, respectively. Ablation studies and manual evaluation confirm the effectiveness and reliability of the constructed concerns.

cs.SE↗

arXiv2025

Sliding multiferroicity in hexagonal stacked CrI3

Developing new multiferroics at the two-dimensional (2D) limit with energy-efficient magnetoelectric coupling can inform the interplay physics of novel orders and advance on-chip high-performance computing applications. Here we apply stacking order engineering to create a new type of 2D multiferroics, namely sliding multiferroics, based on polar hexagonal stacked (H-stacked) CrI3. This new stacking order removes structural inversion symmetry and gives rise to room temperature sliding ferroelectricity, as confirmed by Raman spectroscopy, second harmonic generation spectroscopy and electrical transport measurements. Building upon the gate-dependent reflective magnetic circular dichroism, first-principles calculations, and modeling, sliding ferroelectricity is shown to interplay with an emergent interfacial ferromagnetism via interlayer spin-polarized charge transfer. This coupling mechanism results in non-volatile magnetic switching by as low as 0.4V across the H-stacked CrI3. Our demonstration introduces polar stacking order engineering of 2D magnets as a general approach to create non-volatile 2D multiferroics with efficient magnetoelectric coupling, paving the way for low-power electronics and spintronics at the atomically thin limit.

cond-mat.mtrl-sci↗

arXiv2025

Material Synthesis 2025 (MatSyn25) Dataset for 2D Materials

Two-dimensional (2D) materials have shown broad application prospects in fields such as energy, environment, and aerospace owing to their unique electrical, mechanical, thermal and other properties. With the development of artificial intelligence (AI), the discovery and design of novel 2D materials have been significantly accelerated. However, due to the lack of basic theories of material synthesis, identifying reliable synthesis processes for theoretically designed materials is a challenge. The emergence of large language model offers new approaches for the reliability prediction of material synthesis processes. However, its development is limited by the lack of publicly available datasets of material synthesis processes. To address this, we present the Material Synthesis 2025 (MatSyn25), a large-scale open dataset of 2D material synthesis processes. MatSyn25 contains 163,240 pieces of synthesis process information extracted from 85,160 high-quality research articles, each including basic material information and detailed synthesis process steps. Based on MatSyn25, we developed MatSyn AI which specializes in material synthesis, and provided an interactive web platform that enables multifaceted exploration of the dataset (https://matsynai.stpaper.cn/). MatSyn25 is publicly available, allowing the research community to build upon our work and further advance AI-assisted materials science.

cond-mat.mtrl-sci↗

arXiv2025

CLASS: A Controller-Centric Layout Synthesizer for Dynamic Quantum Circuits

Layout Synthesis for Quantum Computing (LSQC) is a critical component of quantum design tools. Traditional LSQC studies primarily focus on optimizing for reduced circuit depth by adopting a device-centric design methodology. However, these approaches overlook the impact of classical processing and communication time, thereby being insufficient for Dynamic Quantum Circuits (DQC). To address this, we introduce CLASS, a controller-centric layout synthesizer designed to reduce inter-controller communication latency in a distributed control system. It consists of a two-stage framework featuring a hypergraph-based modeling and a heuristic-based graph partitioning algorithm. Evaluations demonstrate that CLASS effectively reduces communication latency by up to 100% with only a 2.10% average increase in the number of additional operations.

quant-ph↗

arXiv2025

TITAN: A Trajectory-Informed Technique for Adaptive Parameter Freezing in Large-Scale VQE

Variational quantum Eigensolver (VQE) is a leading candidate for harnessing quantum computers to advance quantum chemistry and materials simulations, yet its training efficiency deteriorates rapidly for large Hamiltonians. Two issues underlie this bottleneck: (i) the no-cloning theorem imposes a linear growth in circuit evaluations with the number of parameters per gradient step; and (ii) deeper circuits encounter barren plateaus (BPs), leading to exponentially increasing measurement overheads. To address these challenges, here we propose a deep learning framework, dubbed Titan, which identifies and freezes inactive parameters of a given ansatze at initialization for a specific class of Hamiltonians, reducing the optimization overhead without sacrificing accuracy. The motivation of Titan starts with our empirical findings that a subset of parameters consistently has a negligible influence on training dynamics. Its design combines a theoretically grounded data construction strategy, ensuring each training example is informative and BP-resilient, with an adaptive neural architecture that generalizes across ansatze of varying sizes. Across benchmark transverse-field Ising models, Heisenberg models, and multiple molecule systems up to 30 qubits, Titan achieves up to 3 times faster convergence and 40% to 60% fewer circuit evaluations than state-of-the-art baselines, while matching or surpassing their estimation accuracy. By proactively trimming parameter space, Titan lowers hardware demands and offers a scalable path toward utilizing VQE to advance practical quantum chemistry and materials science.

quant-ph↗

arXiv2025

Distributed-HISQ: A Distributed Quantum Control Architecture

The design of a scalable Quantum Control Architecture (QCA) faces two primary challenges. First, the continuous growth in qubit counts has rendered distributed QCA inevitable, yet the nondeterministic latencies inherent in feedback loops demand cycleaccurate synchronization across multiple controllers. Existing synchronization strategies -- whether lock-step or demand-driven -- introduce significant performance penalties. Second, existing quantum instruction set architectures are polarized, being either too abstract or too granular. This lack of a unifying design necessitates recurrent hardware customization for each new control requirement, which limits the system's reconfigurability and impedes the path toward a scalable and unified digital microarchitecture. Addressing these challenges, we propose Distributed-HISQ, featuring: (i) HISQ, A universal instruction set that redefines quantum control with a hardware-agnostic design. By decoupling from quantum operation semantics, HISQ provides a unified language for control sequences, enabling a single microarchitecture to support various control methods and enhancing system reconfigurability. (ii) BISP, a booking-based synchronization protocol that can potentially achieve zero-cycle synchronization overhead. The feasibility and adaptability of Distributed-HISQ are validated through its implementation on a commercial quantum control system targeting superconducting qubits. We performed a comprehensive evaluation using a customized quantum software stack. Our results show that BISP effectively synchronizes multiple control boards, leading to a 22.8% reduction in average program execution time and a $\sim$5$\times$ reduction in infidelity when compared to an existing lock-step synchronization scheme.

quant-ph↗

arXiv2025

Unsupervised Dataset Cleaning Framework for Encrypted Traffic Classification

Traffic classification, a technique for assigning network flows to predefined categories, has been widely deployed in enterprise and carrier networks. With the massive adoption of mobile devices, encryption is increasingly used in mobile applications to address privacy concerns. Consequently, traditional methods such as Deep Packet Inspection (DPI) fail to distinguish encrypted traffic. To tackle this challenge, Artificial Intelligence (AI), in particular Machine Learning (ML), has emerged as a promising solution for encrypted traffic classification. A crucial prerequisite for any ML-based approach is traffic data cleaning, which removes flows that are not useful for training (e.g., irrelevant protocols, background activity, control-plane messages, and long-lived sessions). Existing cleaning solutions depend on manual inspection of every captured packet, making the process both costly and time-consuming. In this poster, we present an unsupervised framework that automatically cleans encrypted mobile traffic. Evaluation on real-world datasets shows that our framework incurs only a 2%~2.5% reduction in classification accuracy compared with manual cleaning. These results demonstrate that our method offers an efficient and effective preprocessing step for ML-based encrypted traffic classification.

cs.NI↗

arXiv2025

CrystalICL: Enabling In-Context Learning for Crystal Generation

Designing crystal materials with desired physicochemical properties remains a fundamental challenge in materials science. While large language models (LLMs) have demonstrated strong in-context learning (ICL) capabilities, existing LLM-based crystal generation approaches are limited to zero-shot scenarios and are unable to benefit from few-shot scenarios. In contrast, human experts typically design new materials by modifying relevant known structures which aligns closely with the few-shot ICL paradigm. Motivated by this, we propose CrystalICL, a novel model designed for few-shot crystal generation. Specifically, we introduce a space-group based crystal tokenization method, which effectively reduces the complexity of modeling crystal symmetry in LLMs. We further introduce a condition-structure aware hybrid instruction tuning framework and a multi-task instruction tuning strategy, enabling the model to better exploit ICL by capturing structure-property relationships from limited data. Extensive experiments on four crystal generation benchmarks demonstrate the superiority of CrystalICL over the leading baseline methods on conditional and unconditional generation tasks.

cs.LG↗

arXiv2025

DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs

Approximate nearest neighbor search (ANNS) is essential for applications like recommendation systems and retrieval-augmented generation (RAG) but is highly I/O-intensive and memory-demanding. CPUs face I/O bottlenecks, while GPUs are constrained by limited memory. DRAM-based Processing-in-Memory (DRAM-PIM) offers a promising alternative by providing high bandwidth, large memory capacity, and near-data computation. This work introduces DRIM-ANN, the first optimized ANNS engine leveraging UPMEM's DRAM-PIM. While UPMEM scales memory bandwidth and capacity, it suffers from low computing power because of the limited processor embedded in each DRAM bank. To address this, we systematically optimize ANNS approximation configurations and replace expensive squaring operations with lookup tables to align the computing requirements with UPMEM's architecture. Additionally, we propose load-balancing and I/O optimization strategies to maximize parallel processing efficiency. Experimental results show that DRIM-ANN achieves a 2.46x speedup over a 32-thread CPU and up to 2.67x over a GPU when deployed on computationally enhanced PIM platforms.

cs.PF↗

arXiv2025

LLMulator: Generalizable Cost Modeling for Dataflow Accelerators with Input-Adaptive Control Flow

Accurate and fast performance prediction for dataflow-based accelerators is vital for efficient hardware design and design space exploration, yet existing methods struggle to generalize across architectures, applications, and input-dependent control flows. We present LLMulator, a progressive numeric modeling framework leveraging the program semantic knowledge of pre-trained large language models (LLMs) for robust, hardware- and application-aware prediction. Our numeric model treats performance values as categorical token sequences, enabling range-agnostic estimates and confidence-aware predictions for unseen applications. To handle input-dependent control flows, we introduce a reinforcement learning-based dynamic calibration method, reducing cycle prediction error by 9.7% over static models and converging to 11.2% error after a few iterations. For cross-hardware generalization, we develop a progressive data augmentation strategy that generates diverse datasets covering multi-level dataflow structures, memory parameters, and loop mapping primitives, significantly boosting prediction accuracy across architectures and configurations.

cs.AR↗

arXiv2025

Can Classical Initialization Help Variational Quantum Circuits Escape the Barren Plateau?

Variational quantum algorithms (VQAs) have emerged as a leading paradigm in near-term quantum computing, yet their performance can be hindered by the so-called barren plateau problem, where gradients vanish exponentially with system size or circuit depth. While most existing VQA research employs simple Gaussian or zero-initialization schemes, classical deep learning has long benefited from sophisticated weight initialization strategies such as Xavier, He, and orthogonal initialization to improve gradient flow and expedite convergence. In this work, we systematically investigate whether these classical methods can mitigate barren plateaus in quantum circuits. We first review each initialization's theoretical grounding and outline how to adapt the notions from neural networks to VQAs. We then conduct extensive numerical experiments on various circuit architectures and optimization tasks. Our findings indicate that while the initial heuristics, inspired by classical initialization, yield moderate improvements in certain experiments, their overall benefits remain marginal. By outlining a preliminary exploration plan in this paper, we aim to offer the research community a broader perspective and accessible demonstrations. Furthermore, we propose future research directions that may be further refined by leveraging the insights gained from this work.

quant-ph↗

arXiv2025

Breaking Through Barren Plateaus: Reinforcement Learning Initializations for Deep Variational Quantum Circuits

Variational Quantum Algorithms (VQAs) have gained prominence as a viable framework for exploiting near-term quantum devices in applications ranging from optimization and chemistry simulation to machine learning. However, the effectiveness of VQAs is often constrained by the so-called barren plateau problem, wherein gradients diminish exponentially as system size or circuit depth increases, thereby hindering training. In this work, we propose a reinforcement learning (RL)-based initialization strategy to alleviate the barren plateau issue by reshaping the initial parameter landscape to avoid regions prone to vanishing gradients. In particular, we explore several RL algorithms (Deterministic Policy Gradient, Soft Actor-Critic, and Proximal Policy Optimization, etc.) to generate the circuit parameters (treated as actions) that minimize the VQAs cost function before standard gradient-based optimization. By pre-training with RL in this manner, subsequent optimization using methods such as gradient descent or Adam proceeds from a more favorable initial state. Extensive numerical experiments under various noise conditions and tasks consistently demonstrate that the RL-based initialization method significantly enhances both convergence speed and final solution quality. Moreover, comparisons among different RL algorithms highlight that multiple approaches can achieve comparable performance gains, underscoring the flexibility and robustness of our method. These findings shed light on a promising avenue for integrating machine learning techniques into quantum algorithm design, offering insights into how RL-driven parameter initialization can accelerate the scalability and practical deployment of VQAs. Opening up a promising path for the research community in machine learning for quantum, especially barren plateau problems in VQAs.

cs.LG↗

arXiv2025

An LLM Agent-Based Complex Semantic Table Annotation Approach

The Semantic Table Annotation (STA) task, which includes Column Type Annotation (CTA) and Cell Entity Annotation (CEA), maps table contents to ontology entities and plays important roles in various semantic applications. However, complex tables often pose challenges such as semantic loss of column names or cell values, strict ontological hierarchy requirements, homonyms, spelling errors, and abbreviations, which hinder annotation accuracy. To address these issues, this paper proposes an LLM-based agent approach for CTA and CEA. We design and implement five external tools with tailored prompts based on the ReAct framework, enabling the STA agent to dynamically select suitable annotation strategies depending on table characteristics. Experiments are conducted on the Tough Tables and BiodivTab datasets from the SemTab challenge, which contain the aforementioned challenges. Our method outperforms existing approaches across various metrics. Furthermore, by leveraging Levenshtein distance to reduce redundant annotations, we achieve a 70% reduction in time costs and a 60% reduction in LLM token usage, providing an efficient and cost-effective solution for STA.

cs.CL↗