arXiv subjects

Ximing Wang

Publications and source records attributed to Ximing Wang.

10 recordsLinked to original sources

arXiv2026

AS-FedBridge: Pseudo-Spike Bridge Distillation for Heterogeneous ANN-SNN Federated Learning

Federated learning enables collaborative model training across distributed edge devices while strictly preserving data privacy. To facilitate practical deployment on resource-constrained edge devices, Spiking Neural Networks (SNNs) have emerged as a promising alternative to traditional Artificial Neural Networks (ANNs) due to their sparse computing mechanisms and high energy efficiency. However, jointly training ANNs and SNNs exposes a challenge of representational misalignment, which is intrinsically caused by differences in information representation, specifically the semantic gap between continuous real-valued activations in ANNs and discrete spatio-temporal spikes in SNNs. To overcome this barrier, we propose AS-FedBridge, a novel federated learning framework tailored for mixed ANN-SNN clients. AS-FedBridge features a lightweight Bridge equipped with a Pseudo-Spike Interface, which effectively projects continuous signals into a spike-compatible space to facilitate ANN-SNN alignment. Given the absence of existing mixed ANN-SNN federated frameworks, we establish a comprehensive benchmark to evaluate against multiple advanced heterogeneous FL methods. Our empirical analysis demonstrates a positive correlation between the degree of ANN-SNN alignment and the collaborative FL performance. Across four datasets, AS-FedBridge consistently demonstrates advanced accuracy while mitigating extreme scale, architecture, and client heterogeneity challenge. Furthermore, our framework enables a highly controllable trade-off between model performance and resource efficiency. AS-FedBridge accomplishes these robust performance gains while introducing only marginal computational overhead, establishing a robust and practical foundation for mixed ANN-SNN federated learning systems.

cs.LG↗

arXiv2026

Learning Quantum-Samplers for Stochastic Processes with Quantum Sequence Models

Quantum circuits that generate coherent superpositions of stochastic processes are key to many downstream quantum-accelerated tasks, such as risk analysis, importance sampling, and DNA sequencing. However, traditional methods for designing such circuits from data face immense challenges, given the exponential growth in the size of the associated probability vectors as the desired simulation time horizon increases. Here, we introduce quantum sequence models that leverage a recurrent quantum circuit structure to generate coherent superpositions with circuit complexity that grows linearly with the desired time horizon; together with a recurrent variant of the parameter-shift rule, we train these models from observational data. When benchmarked against baseline quantum Born machines, our constructions exhibit orders-of-magnitude improvements in model accuracy in data-sparse regimes.

quant-ph↗

arXiv2026

Practical Quantum Broadcasting

Incorporating sample efficiency, by requiring the number of states consumed by broadcasting does not exceed that of a naive prepare-and-distribute strategy, gives rise to the no practical quantum broadcasting theorem. To navigate this limitation, we introduce approximate and probabilistic virtual broadcasting and derive analytic expressions for their optimal sample complexity overheads. Allowing deviations at the receivers restores sample efficiency even in the 1-to-2 approximate setting, whereas probabilistic protocols obey a stronger no-go theorem that excludes all sample efficient 1-to-2 implementations for arbitrary dimension and success probability. Rather counterintuitive, this obstruction does not persist at larger receiver numbers: for qubit systems, practical 1-to-6 virtual broadcasting becomes attainable. These results elevate sample complexity from a technical constraint to a defining operational principle, opening an unexplored route to the efficient distribution of quantum information.

quant-ph↗

arXiv2026

Variational Quantum Dimension Reduction for Recurrent Quantum Models

Recurrent quantum models (RQMs) realize sequential quantum processes through repeated application of a unitary operation on a memory system coupled with a series of output registers. However, such models often rely on unnecessarily large memory spaces, introducing redundancy and limiting scalability. Here, we introduce a \textit{variational quantum dimension reduction} framework that identifies and removes irrelevant memory degrees of freedom while preserving the recurrent dynamics of the target model. Our approach employs two parameterized quantum circuits: a decoupling unitary $V(\theta_1)$ that isolates the essential memory subspace; and a compressed recurrent unitary $\tilde{U}(\theta_2)$ that reconstructs the dynamics in the reduced space. The optimization is guided by a unified cost function combining decoupling fidelity and dynamical accuracy, evaluated using the \textit{Quantum Fidelity Divergence Rate} (QFDR), a metric that quantifies long-term fidelity per time step. Applied to a cyclic random walk model, our framework achieves up to three orders of magnitude smaller QFDR compared to variational matrix product state truncation, while requiring only trajectory samples rather than explicit state reconstructions. This establishes a scalable, data-driven paradigm for learning minimal recurrent quantum architectures, enabling variational circuit optimization and quantum process compression for near-term quantum devices.

quant-ph↗

arXiv2026

Early and Prediagnostic Detection of Pancreatic Cancer from Computed Tomography

Pancreatic ductal adenocarcinoma (PDAC), one of the deadliest solid malignancies, is often detected at a late and inoperable stage. Retrospective reviews of prediagnostic CT scans, when conducted by expert radiologists aware that the patient later developed PDAC, frequently reveal lesions that were previously overlooked. To help detecting these lesions earlier, we developed an automated system named ePAI (early Pancreatic cancer detection with Artificial Intelligence). It was trained on data from 1,598 patients from a single medical center. In the internal test involving 1,009 patients, ePAI achieved an area under the receiver operating characteristic curve (AUC) of 0.939-0.999, a sensitivity of 95.3%, and a specificity of 98.7% for detecting small PDAC less than 2 cm in diameter, precisely localizing PDAC as small as 2 mm. In an external test involving 7,158 patients across 6 centers, ePAI achieved an AUC of 0.918-0.945, a sensitivity of 91.5%, and a specificity of 88.0%, precisely localizing PDAC as small as 5 mm. Importantly, ePAI detected PDACs on prediagnostic CT scans obtained 3 to 36 months before clinical diagnosis that had originally been overlooked by radiologists. It successfully detected and localized PDACs in 75 of 159 patients, with a median lead time of 347 days before clinical diagnosis. Our multi-reader study showed that ePAI significantly outperformed 30 board-certified radiologists by 50.3% (P < 0.05) in sensitivity while maintaining a comparable specificity of 95.4% in detecting PDACs early and prediagnostic. These findings suggest its potential of ePAI as an assistive tool to improve early detection of pancreatic cancer.

cs.CV↗

arXiv2024

Variational Quantum Circuit Decoupling

Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means to simulate such processes on a computer. Here we outline a variational decoupling algorithm for decoupling unitary quantum dynamics -- allowing us to decompose a given $n$-qubit unitary gate into multiple independently evolving sub-components. We apply this approach to quantum circuit synthesis - the task of discovering quantum circuit implementations of target unitary dynamics. Our numerical studies illustrate significant benefits, showing that variational decoupling enables us to synthesize general $2$ and $4$-qubit gates to fidelity that conventional variational circuits cannot reach.

quant-ph↗

arXiv2023

Quantum Uncertainty Principles for Measurements with Interventions

Heisenberg's uncertainty principle implies fundamental constraints on what properties of a quantum system can we simultaneously learn. However, it typically assumes that we probe these properties via measurements at a single point in time. In contrast, inferring causal dependencies in complex processes often requires interactive experimentation - multiple rounds of interventions where we adaptively probe the process with different inputs to observe how they affect outputs. Here we demonstrate universal uncertainty principles for general interactive measurements involving arbitrary rounds of interventions. As a case study, we show that they imply an uncertainty trade-off between measurements compatible with different causal dependencies.

quant-ph↗

arXiv2022

Game-theoretic Learning Anti-jamming Approaches in Wireless Networks

In this article, the anti-jamming communication problem is investigated from a game-theoretic learning perspective. By exploring and analyzing intelligent anti-jamming communication, we present the characteristics of jammers and the requirements of an intelligent anti-jamming approach. Such approach is required of self-sensing, self-decision making, self-coordination, self-evaluation, and learning ability. Then, a game-theoretic learning anti-jamming (GTLAJ) paradigm is proposed, and its framework and challenges of GTLAJ are introduced. Moreover, through three cases, i.e., Stackelberg anti-jamming game, Markov anti-jamming game and hypergraph-based anti-jamming game, different anti-jamming game models and applications are discussed, and some future directions are presented.

cs.NI↗

arXiv2019

A Game-Theoretic Learning Framework for Multi-Agent Intelligent Wireless Networks

In this article, we introduce a game-theoretic learning framework for the multi-agent wireless network. By combining learning in artificial intelligence (AI) with game theory, several promising properties emerge such as obtaining high payoff in the unknown and dynamic environment, coordinating the actions of agents and making the adversarial decisions with the existence of malicious users. Unfortunately, there is no free lunch. To begin with, we discuss the connections between learning in AI and game theory mainly in three levels, i.e., pattern recognition, prediction and decision making. Then, we discuss the challenges and requirements of the combination for the intelligent wireless network, such as constrained capabilities of agents, incomplete information obtained from the environment and the distributed, dynamically scalable and heterogeneous characteristics of wireless network. To cope with these, we propose a game-theoretic learning framework for the wireless network, including the internal coordination (resource optimization) and external adversarial decision-making (anti-jamming). Based on the framework, we introduce several attractive game-theoretic learning methods combining with the typical applications that we have proposed. What's more, we developed a real-life testbed for the multi-agent anti-jamming problem based on the game-theoretic learning framework. The experiment results verify the effectiveness of the proposed game-theoretic learning method.

cs.GT↗

arXiv2019

Quantum Speedup in Adaptive Boosting of Binary Classification

In classical machine learning, a set of weak classifiers can be adaptively combined to form a strong classifier for improving the overall performance, a technique called adaptive boosting (or AdaBoost). However, constructing the strong classifier for a large data set is typically resource consuming. Here we propose a quantum extension of AdaBoost, demonstrating a quantum algorithm that can output the optimal strong classifier with a quadratic speedup in the number of queries of the weak classifiers. Our results also include a generalization of the standard AdaBoost to the cases where the output of each classifier may be probabilistic even for the same input. We prove that the update rules and the query complexity of the non-deterministic classifiers are the same as those of deterministic classifiers, which may be of independent interest to the classical machine-learning community. Furthermore, the AdaBoost algorithm can also be applied to data encoded in the form of quantum states; we show how the training set can be simplified by using the tools of t-design. Our approach describes a model of quantum machine learning where quantum speedup is achieved in finding the optimal classifier, which can then be applied for classical machine-learning applications.

quant-ph↗