arXiv subjects

Qiming Wu

Publications and source records attributed to Qiming Wu.

At least 19 recordsLinked to original sources

arXiv2026

A broadband, individually addressing two- and three-dimensional photonic integrated circuit for trapped-ion qubit control

Trapped ions provide a high-fidelity platform for quantum information processing, yet delivery of multiple, distinct wavelengths across large networks of interaction zones remains a bottleneck. Conventional free-space light delivery lacks scalability, while on-chip grating couplers suffer from narrow operational bandwidth that increases circuit footprint and optical interfacing complexity. Here we show a broadband photonic integrated circuit capable of addressing individual ions. The circuit combines a planar waveguide lens with a micromirror fabricated using two-photon polymerization at wafer scale. This implementation can address three individual ions from $\lambda$ = 405 - 880 nm with -27 dB average intensity crosstalk at $5\,\mu\mathrm{m}$ pitch. We trap $^{40}\mathrm{Ca}^{+}$ and $^{138}\mathrm{Ba}^{+}$ ions above such devices, characterize optical crosstalk with barium ions, and demonstrate individual repumping of calcium ions. This monolithic photonic architecture brings broadband addressing in an on-chip modality to trapped-ion technology. More generally, integrating additive manufacturing into quantum devices is poised to unlock expanded design space for implementing novel quantum architectures.

quant-ph↗

arXiv2025

Observation of synchronization between two quantum van der Pol oscillators in trapped ions

Synchronization is a hallmark of collective behavior that emerges when nonlinear systems interact, spanning scales from mechanical oscillators to planetary orbits. As a universal phenomenon it underpins the study of complex systems and has far-reaching technological implications. While classical synchronization has a long and rich history, it has not been observed experimentally between multiple quantum limit-cycle oscillators despite a decade of theoretical investigations. We realize synchronization between two quantum van der Pol oscillators by engineering dissipation in a mixed-isotope trapped-ion quantum simulator. The synchronized state is encoded in a fixed relative phase between the oscillators that is inaccessible to local measurements and only revealed through joint readout of both oscillators, in stark contrast to the classical case where synchronization can be observed via individual phase measurements. We further show that the relative phase can be precisely controlled, and that the chain of two oscillators can synchronize to an external field, suggesting applications in sensing. Our results provide a promising pathway for studying more complex synchronized quantum dynamics beyond two oscillators, where a theoretical treatment becomes increasingly challenging, and it remains to be understood whether genuinely quantum features persist in such cases.

quant-ph↗

arXiv2025

SPLF-SAM: Self-Prompting Segment Anything Model for Light Field Salient Object Detection

Segment Anything Model (SAM) has demonstrated remarkable capabilities in solving light field salient object detection (LF SOD). However, most existing models tend to neglect the extraction of prompt information under this task. Meanwhile, traditional models ignore the analysis of frequency-domain information, which leads to small objects being overwhelmed by noise. In this paper, we put forward a novel model called self-prompting light field segment anything model (SPLF-SAM), equipped with unified multi-scale feature embedding block (UMFEB) and a multi-scale adaptive filtering adapter (MAFA). UMFEB is capable of identifying multiple objects of varying sizes, while MAFA, by learning frequency features, effectively prevents small objects from being overwhelmed by noise. Extensive experiments have demonstrated the superiority of our method over ten state-of-the-art (SOTA) LF SOD methods. Our code will be available at https://github.com/XucherCH/splfsam.

cs.CV↗

arXiv2025

ContextGuard-LVLM: Enhancing News Veracity through Fine-grained Cross-modal Contextual Consistency Verification

The proliferation of digital news media necessitates robust methods for verifying content veracity, particularly regarding the consistency between visual and textual information. Traditional approaches often fall short in addressing the fine-grained cross-modal contextual consistency (FCCC) problem, which encompasses deeper alignment of visual narrative, emotional tone, and background information with text, beyond mere entity matching. To address this, we propose ContextGuard-LVLM, a novel framework built upon advanced Vision-Language Large Models (LVLMs) and integrating a multi-stage contextual reasoning mechanism. Our model is uniquely enhanced through reinforced or adversarial learning paradigms, enabling it to detect subtle contextual misalignments that evade zero-shot baselines. We extend and augment three established datasets (TamperedNews-Ent, News400-Ent, MMG-Ent) with new fine-grained contextual annotations, including "contextual sentiment," "visual narrative theme," and "scene-event logical coherence," and introduce a comprehensive CTXT (Contextual Coherence) entity type. Extensive experiments demonstrate that ContextGuard-LVLM consistently outperforms state-of-the-art zero-shot LVLM baselines (InstructBLIP and LLaVA 1.5) across nearly all fine-grained consistency tasks, showing significant improvements in complex logical reasoning and nuanced contextual understanding. Furthermore, our model exhibits superior robustness to subtle perturbations and a higher agreement rate with human expert judgments on challenging samples, affirming its efficacy in discerning sophisticated forms of context detachment.

cs.CV↗

arXiv2025

Toward Fair Federated Learning under Demographic Disparities and Data Imbalance

Ensuring fairness is critical when applying artificial intelligence to high-stakes domains such as healthcare, where predictive models trained on imbalanced and demographically skewed data risk exacerbating existing disparities. Federated learning (FL) enables privacy-preserving collaboration across institutions, but remains vulnerable to both algorithmic bias and subgroup imbalance - particularly when multiple sensitive attributes intersect. We propose FedIDA (Fed erated Learning for Imbalance and D isparity A wareness), a framework-agnostic method that combines fairness-aware regularization with group-conditional oversampling. FedIDA supports multiple sensitive attributes and heterogeneous data distributions without altering the convergence behavior of the underlying FL algorithm. We provide theoretical analysis establishing fairness improvement bounds using Lipschitz continuity and concentration inequalities, and show that FedIDA reduces the variance of fairness metrics across test sets. Empirical results on both benchmark and real-world clinical datasets confirm that FedIDA consistently improves fairness while maintaining competitive predictive performance, demonstrating its effectiveness for equitable and privacy-preserving modeling in healthcare. The source code is available on GitHub.

cs.CY↗

arXiv2025

Scalable Trapped Ion Addressing with Adjoint-optimized Multimode Photonic Circuits

Trapped-ion quantum computing requires precise optical control for individual qubit manipulation. However, conventional free-space optics face challenges in alignment stability and scalability as the number of qubits increases. Integrated photonics offers a promising alternative, providing miniaturized optical systems on a chip. Here, we propose a design for a multimode photonic circuit integrated with a surface-electrode ion trap capable of targeted and reconfigurable light delivery. Three closely positioned ions can be addressed using a focusing grating coupler that emits multimode light through electrode openings to ions trapped 80 $\mu$m above the chip. Simulations show that the couplers achieve diffraction-limited spot with a 4.3 $\mu$m beam waist along the trap axis and 2.2 $\mu$m perpendicular to the trap axis. Controlled interference of the TE$_{\text{10}}$ and TE$_{\text{20}}$ modes results in crosstalk of -20 dB to -30 dB at ion separations of 5-8 $\mu$m when addressing ions individually, and down to -60 dB when two of the three ions are addressed simultaneously. Additionally, the higher-order TE modes can offer a novel mechanism for driving spin-motion coupling transitions, potentially enabling alternative approaches to quantum gates and simulations. The proposed integrated platform offers a viable path for constructing large-scale trapped-ion systems, leveraging the benefits of nanophotonic design for precise and reliable ion manipulation.

physics.optics↗

arXiv2025

Mitigation of birefringence in cavity-based quantum networks using frequency-encoded photons

Atom-cavity systems offer unique advantages for building large-scale distributed quantum computers by providing strong atom-photon coupling while allowing for high-fidelity local operations of atomic qubits. However, in prevalent schemes where the photonic state is encoded in polarization, cavity birefringence introduces an energy splitting of the cavity eigenmodes and alters the polarization states, thus limiting the fidelity of remote entanglement generation. To address this challenge, we propose a scheme that encodes the photonic qubit in the frequency degree-of-freedom. The scheme relies on resonant coupling of multiple transverse cavity modes to different atomic transitions that are well-separated in frequency. We numerically investigate the temporal properties of the photonic wavepacket, two-photon interference visibility, and atom-atom entanglement fidelity under various cavity polarization-mode splittings and find that our scheme is less affected by cavity birefringence. Finally, we propose practical implementations in two trapped ion systems, using the fine structure splitting in the metastable D state of $\mathrm{^{40}Ca^{+}}$, and the hyperfine splitting in the ground state of $\mathrm{^{225}Ra^{+}}$. Our study presents an alternative approach for cavity-based quantum networks that is less sensitive to birefringent effects, and is applicable to a variety of atomic and solid-state emitter-cavity interfaces.

quant-ph↗

arXiv2025

Searching for Nearby Diffuse Dwarf Galaxies in the COSMOS Field

It remains challenging to systematically survey nearby diffuse dwarf galaxies and address the formation mechanism of this population distinguishing from regular ones. We carry out a pilot search for these galaxies in the COSMOS field using the deep \textit{HST}/F814W imaging data. We report three diffuse dwarf galaxies satisfying the criteria: (1) redshift $z<0.2$, (2) effective radius $r_{\rm e}>1.0''$, and (3) central surface brightness $\mu_{\rm 0}>24$ mag arcsec$^{-2}$. Two of the three galaxies, COSMOS-UDG1 and COSMOS-UDG2, are recognized as ultra-diffuse galaxies (UDGs) with redshift $z=0.130$ and $0.049$, respectively. The third galaxy, COSMOS-dw1, is spectroscopically confirmed as a dwarf galaxy at $z=0.004$. We derive the physical properties through fitting their spectral energy distributions (SEDs) extracted from deep multiwavelength observations. COSMOS-dw1 has a stellar mass of $5.6_{-2.7}^{+2.5}\times10^{6}$ M$_{\odot}$, harboring neutral hydrogen gas of mass $4.90\pm0.90\times10^{6}$ M$_{\odot}$, hinting that this galaxy may be in the nascent stages of quenching. The estimated dynamical mass of $3.4\times10^{7}\,M_{\odot}$ further suggests that COSMOS-dw1 is predominantly of dark matter. COSMOS-UDG1 and COSMOS-UDG2 exhibit comparable stellar masses of $\sim 2\times10^{8}$ M$_{\odot}$. Notably, COSMOS-UDG1 is younger and more metal-rich than COSMOS-UDG2 and COSMOS-dw1. Conversely, COSMOS-UDG2 and COSMOS-dw1 have similar stellar metallicities, yet COSMOS-UDG2 is older than COSMOS-dw1. All three galaxies adhere to the stellar mass-metallicity relation (MZR) for dwarf galaxies in the local Universe, implying they belong to the dwarf galaxy population.

astro-ph.GA↗

arXiv2024

Chasing Better Deep Image Priors between Over- and Under-parameterization

Deep Neural Networks (DNNs) are well-known to act as over-parameterized deep image priors (DIP) that regularize various image inverse problems. Meanwhile, researchers also proposed extremely compact, under-parameterized image priors (e.g., deep decoder) that are strikingly competent for image restoration too, despite a loss of accuracy. These two extremes push us to think whether there exists a better solution in the middle: between over- and under-parameterized image priors, can one identify "intermediate" parameterized image priors that achieve better trade-offs between performance, efficiency, and even preserving strong transferability? Drawing inspirations from the lottery ticket hypothesis (LTH), we conjecture and study a novel "lottery image prior" (LIP) by exploiting DNN inherent sparsity, stated as: given an over-parameterized DNN-based image prior, it will contain a sparse subnetwork that can be trained in isolation, to match the original DNN's performance when being applied as a prior to various image inverse problems. Our results validate the superiority of LIPs: we can successfully locate the LIP subnetworks from over-parameterized DIPs at substantial sparsity ranges. Those LIP subnetworks significantly outperform deep decoders under comparably compact model sizes (by often fully preserving the effectiveness of their over-parameterized counterparts), and they also possess high transferability across different images as well as restoration task types. Besides, we also extend LIP to compressive sensing image reconstruction, where a pre-trained GAN generator is used as the prior (in contrast to untrained DIP or deep decoder), and confirm its validity in this setting too. To our best knowledge, this is the first time that LTH is demonstrated to be relevant in the context of inverse problems or image priors.

cs.CV↗

arXiv2024

Using Crank-Nikolson Scheme to Solve the Korteweg-de Vries (KdV) Equation

The Korteweg-de Vries (KdV) equation is a fundamental partial differential equation that models wave propagation in shallow water and other dispersive media. Accurately solving the KdV equation is essential for understanding wave dynamics in physics and engineering applications. This project focuses on implementing the Crank-Nicolson scheme, a finite difference method known for its stability and accuracy, to solve the KdV equation. The Crank-Nicolson scheme's implicit nature allows for a more stable numerical solution, especially in handling the dispersive and nonlinear terms of the KdV equation. We investigate the performance of the scheme through various test cases, analyzing its convergence and error behavior. The results demonstrate that the Crank-Nicolson method provides a robust approach for solving the KdV equation, with improved accuracy over traditional explicit methods. Code is available at the end of the paper.

math.NA↗

arXiv2024

FairFML: Fair Federated Machine Learning with a Case Study on Reducing Gender Disparities in Cardiac Arrest Outcome Prediction

Objective: Mitigating algorithmic disparities is a critical challenge in healthcare research, where ensuring equity and fairness is paramount. While large-scale healthcare data exist across multiple institutions, cross-institutional collaborations often face privacy constraints, highlighting the need for privacy-preserving solutions that also promote fairness. Materials and Methods: In this study, we present Fair Federated Machine Learning (FairFML), a model-agnostic solution designed to reduce algorithmic bias in cross-institutional healthcare collaborations while preserving patient privacy. As a proof of concept, we validated FairFML using a real-world clinical case study focused on reducing gender disparities in cardiac arrest outcome prediction. Results: We demonstrate that the proposed FairFML framework enhances fairness in federated learning (FL) models without compromising predictive performance. Our findings show that FairFML improves model fairness by up to 65% compared to the centralized model, while maintaining performance comparable to both local and centralized models, as measured by receiver operating characteristic analysis. Discussion and Conclusion: FairFML offers a promising and flexible solution for FL collaborations, with its adaptability allowing seamless integration with various FL frameworks and models, from traditional statistical methods to deep learning techniques. This makes FairFML a robust approach for developing fairer FL models across diverse clinical and biomedical applications.

cs.CY↗

arXiv2024

Bound Tightening Network for Robust Crowd Counting

Crowd Counting is a fundamental topic, aiming to estimate the number of individuals in the crowded images or videos fed from surveillance cameras. Recent works focus on improving counting accuracy, while ignoring the certified robustness of counting models. In this paper, we propose a novel Bound Tightening Network (BTN) for Robust Crowd Counting. It consists of three parts: base model, smooth regularization module and certify bound module. The core idea is to propagate the interval bound through the base model (certify bound module) and utilize the layer weights (smooth regularization module) to guide the network learning. Experiments on different benchmark datasets for counting demonstrate the effectiveness and efficiency of BTN.

cs.CV↗

arXiv2024

Bridging Data Gaps in Healthcare: A Scoping Review of Transfer Learning in Biomedical Data Analysis

Clinical and biomedical research in low-resource settings often faces significant challenges due to the need for high-quality data with sufficient sample sizes to construct effective models. These constraints hinder robust model training and prompt researchers to seek methods for leveraging existing knowledge from related studies to support new research efforts. Transfer learning (TL), a machine learning technique, emerges as a powerful solution by utilizing knowledge from pre-trained models to enhance the performance of new models, offering promise across various healthcare domains. Despite its conceptual origins in the 1990s, the application of TL in medical research has remained limited, especially beyond image analysis. In our review of TL applications in structured clinical and biomedical data, we screened 3,515 papers, with 55 meeting the inclusion criteria. Among these, only 2% (one out of 55) utilized external studies, and 7% (four out of 55) addressed scenarios involving multi-site collaborations with privacy constraints. To achieve actionable TL with structured medical data while addressing regional disparities, inequality, and privacy constraints in healthcare research, we advocate for the careful identification of appropriate source data and models, the selection of suitable TL frameworks, and the validation of TL models with proper baselines.

cs.LG↗

arXiv2024

GraphEval36K: Benchmarking Coding and Reasoning Capabilities of Large Language Models on Graph Datasets

Large language models (LLMs) have achieved remarkable success in natural language processing (NLP), demonstrating significant capabilities in processing and understanding text data. However, recent studies have identified limitations in LLMs' ability to manipulate, program, and reason about structured data, especially graphs. We introduce GraphEval36K, the first comprehensive graph dataset, comprising 40 graph coding problems and 36,900 test cases to evaluate the ability of LLMs on graph problem-solving. Our dataset is categorized into eight primary and four sub-categories to ensure a thorough evaluation across different types of graphs. We benchmark ten LLMs, finding that private models outperform open-source ones, though the gap is narrowing. We also analyze the performance of LLMs across directed vs undirected graphs, different kinds of graph concepts, and network models. Furthermore, to improve the usability of our evaluation framework, we propose Structured Symbolic Decomposition (SSD), an instruction-based method designed to enhance LLM performance on complex graph tasks. Results show that SSD improves the average passing rate of GPT-4, GPT-4o, Gemini-Pro and Claude-3-Sonnet by 8.38%, 6.78%, 29.28% and 25.28%, respectively.

cs.AI↗

arXiv2024

Temporally multiplexed ion-photon quantum interface via fast ion-chain transport

High-rate remote entanglement between photon and matter-based qubits is essential for distributed quantum information processing. A key technique to increase the modest entangling rates of existing long-distance quantum networking approaches is multiplexing. Here, we demonstrate a temporally multiplexed ion-photon interface via rapid transport of a chain of nine calcium ions across 74 $\mathrm{\mu m}$ within 86 $\mathrm{\mu s}$. The non-classical nature of the multiplexed photons is verified by measuring the second-order correlation function with an average value of $g^{(2)}(0)$ = 0.060(13), indicating negligible crosstalk between the multiplexed modes. In addition, we characterize the motional degree-of-freedom of the ion crystal after transport and find that it is coherently excited to as much as $\bar{n}_\alpha\approx 110$ for the center-of-mass mode. Our proof-of-principle implementation paves the way for large-scale quantum networking with trapped ions, but highlights some challenges that must be overcome.

quant-ph↗

arXiv2024

Developing Federated Time-to-Event Scores Using Heterogeneous Real-World Survival Data

Survival analysis serves as a fundamental component in numerous healthcare applications, where the determination of the time to specific events (such as the onset of a certain disease or death) for patients is crucial for clinical decision-making. Scoring systems are widely used for swift and efficient risk prediction. However, existing methods for constructing survival scores presume that data originates from a single source, posing privacy challenges in collaborations with multiple data owners. We propose a novel framework for building federated scoring systems for multi-site survival outcomes, ensuring both privacy and communication efficiency. We applied our approach to sites with heterogeneous survival data originating from emergency departments in Singapore and the United States. Additionally, we independently developed local scores at each site. In testing datasets from each participant site, our proposed federated scoring system consistently outperformed all local models, evidenced by higher integrated area under the receiver operating characteristic curve (iAUC) values, with a maximum improvement of 11.6%. Additionally, the federated score's time-dependent AUC(t) values showed advantages over local scores, exhibiting narrower confidence intervals (CIs) across most time points. The model developed through our proposed method exhibits effective performance on each local site, signifying noteworthy implications for healthcare research. Sites participating in our proposed federated scoring model training gained benefits by acquiring survival models with enhanced prediction accuracy and efficiency. This study demonstrates the effectiveness of our privacy-preserving federated survival score generation framework and its applicability to real-world heterogeneous survival data.

cs.AI↗

arXiv2023

Federated Learning for Clinical Structured Data: A Benchmark Comparison of Engineering and Statistical Approaches

Federated learning (FL) has shown promising potential in safeguarding data privacy in healthcare collaborations. While the term "FL" was originally coined by the engineering community, the statistical field has also explored similar privacy-preserving algorithms. Statistical FL algorithms, however, remain considerably less recognized than their engineering counterparts. Our goal was to bridge the gap by presenting the first comprehensive comparison of FL frameworks from both engineering and statistical domains. We evaluated five FL frameworks using both simulated and real-world data. The results indicate that statistical FL algorithms yield less biased point estimates for model coefficients and offer convenient confidence interval estimations. In contrast, engineering-based methods tend to generate more accurate predictions, sometimes surpassing central pooled and statistical FL models. This study underscores the relative strengths and weaknesses of both types of methods, emphasizing the need for increased awareness and their integration in future FL applications.

cs.LG↗

arXiv2023

Qubits on programmable geometries with a trapped-ion quantum processor

Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body systems, the entanglement structure can change if the constituents are connected differently, leading to altered bounds for correlation growth and difficulties for classical computers to simulate large systems. While a universal quantum computer can perform digital simulations, an analog-digital hybrid quantum processor offers advantages such as parallelism. Here, we engineer a class of high-dimensional Ising interactions using a linear one-dimensional (1D) ion chain with up to 8 qubits through stroboscopic sequences of commuting Hamiltonians. %with a thorough understanding of the error sources and deviation from the target Hamiltonian. In addition, we extend this method to non-commuting circuits and demonstrate the quantum XY and Heisenberg models using Floquet periodic drives with tunable symmetries. The realization of higher dimensional spin models offers new opportunities ranging from studying topological phases of matter or quantum spin glasses to future fault-tolerant quantum computation.

quant-ph↗