Source author record

Xiaosong Ma

Xiaosong Ma appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

8works
6topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

8 published item(s)

preprint2026arXiv

WindINR: Latent-State INR for Fast Local Wind Query and Correction in Complex Terrain

Many downstream decisions in complex terrain require fast wind estimates at a small number of user-specified locations and heights for a given forecast valid time, rather than another dense forecast field on a fixed grid. We present WindINR, a latent-state implicit neural representation framework for continuous high-resolution local wind query and sparse-observation correction. WindINR maps static terrain descriptors, a low-resolution background field, and continuous query coordinates to a high-resolution wind state through a latent-conditioned decoder. To enable rapid inference-time correction, WindINR separates reusable representation learning from sample-specific latent-state correction. During training, a privileged encoder infers a reference latent state from high-resolution supervision, a deployable latent predictor estimates an initial latent state from inference-time inputs alone, and their discrepancies are summarized into a dataset-adaptive Gaussian prior over latent corrections. At inference time, within the WindINR module, network weights remain fixed and only the latent state is updated by minimizing a regularized correction objective using sparse observations and their uncertainty. In controlled OSSEs over the Senja region, including a UAV-aided approach scenario and random-observation robustness tests, WindINR improves local high-resolution wind estimates by updating only a compact latent state rather than the full network. The corrected representation remains continuously queryable at arbitrary coordinates and, in our CPU benchmark, yields about a $2.6\times$ online-correction speedup over full-network fine-tuning, suggesting a practical interface between kilometer-scale background products, sparse local observations, and wind queries in complex terrain.

preprint2022arXiv

Experimental optimal verification of three-dimensional entanglement on a silicon chip

High-dimensional entanglement is significant for the fundamental studies of quantum physics and offers unique advantages in various quantum information processing (QIP) tasks. Integrated quantum devices have recently emerged as a promising platform for creating, processing, and detecting complex high-dimensional entangled states. A crucial step towards practical quantum technologies is to verify that these devices work reliably with an optimal strategy. In this work, we experimentally implement an optimal quantum verification strategy on a three-dimensional maximally entangled state using local projective measurements on a silicon photonic chip. A 95% confidence is achieved from 1190 copies to verify the target quantum state. The obtained scaling of infidelity as a function of the number of copies is -0.5497+-0.0002, exceeding the standard quantum limit of -0.5 with 248 standard deviations. Our results indicate that quantum state verification could serve as an efficient tool for complex quantum measurement tasks.

preprint2022arXiv

Layer-wised Model Aggregation for Personalized Federated Learning

Personalized Federated Learning (pFL) not only can capture the common priors from broad range of distributed data, but also support customized models for heterogeneous clients. Researches over the past few years have applied the weighted aggregation manner to produce personalized models, where the weights are determined by calibrating the distance of the entire model parameters or loss values, and have yet to consider the layer-level impacts to the aggregation process, leading to lagged model convergence and inadequate personalization over non-IID datasets. In this paper, we propose a novel pFL training framework dubbed Layer-wised Personalized Federated learning (pFedLA) that can discern the importance of each layer from different clients, and thus is able to optimize the personalized model aggregation for clients with heterogeneous data. Specifically, we employ a dedicated hypernetwork per client on the server side, which is trained to identify the mutual contribution factors at layer granularity. Meanwhile, a parameterized mechanism is introduced to update the layer-wised aggregation weights to progressively exploit the inter-user similarity and realize accurate model personalization. Extensive experiments are conducted over different models and learning tasks, and we show that the proposed methods achieve significantly higher performance than state-of-the-art pFL methods.

preprint2021arXiv

Towards the standardization of quantum state verification using optimal strategies

Quantum devices for generating entangled states have been extensively studied and widely used. As so, it becomes necessary to verify that these devices truly work reliably and efficiently as they are specified. Here, we experimentally realize the recently proposed two-qubit entangled state verification strategies using both local measurements (nonadaptive) and active feed-forward operations (adaptive) with a photonic platform. About 3283/536 number of copies ($N$) are required to achieve a 99% confidence to verify the target quantum state for nonadaptive/adaptive strategies. These optimal strategies provide the Heisenberg scaling of the infidelity $ε$ as a function of $N$ ($ε$ $\sim$ $N^r$) with the parameter $r=-1$, exceeding the standard quantum limit with $r=-0.5$. We experimentally obtain the scaling parameter of $r=-0.88\pm$0.03 and $-0.78\pm$0.07 for nonadaptive and adaptive strategies, respectively. Our experimental work could serve as a standardized procedure for the verification of quantum states.

preprint2020arXiv

LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans

The specific characteristics of graph workloads make it hard to design a one-size-fits-all graph storage system. Systems that support transactional updates use data structures with poor data locality, which limits the efficiency of analytical workloads or even simple edge scans. Other systems run graph analytics workloads efficiently, but cannot properly support transactions. This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data. LiveGraph does that by ensuring that adjacency list scans, a key operation in graph workloads, are purely sequential: they never require random accesses even in presence of concurrent transactions. This is achieved by combining a novel graph-aware data structure, the Transactional Edge Log (TEL), together with a concurrency control mechanism that leverages TEL's data layout. Our evaluation shows that LiveGraph significantly outperforms state-of-the-art (graph) database solutions on both transactional and real-time analytical workloads.

preprint2016arXiv

Self-aligned multi-channel superconducting nanowire avalanche photodetector

We describe a micromachining process to allow the coupling of an array of single-mode telecommunication fibers to individual superconducting nanowire single photon detectors (SNSPDs). As proof of principle, we show the integration of four detectors on the same silicon chip, including two standard single-section nanowire detectors and two superconducting nanowire avalanche photodetectors (SNAPs) with modified series structure without external inductor, and their performances are compared. The SNAP shows saturated system detection efficiency of 16% while the dark count rate is less than 20 Hz, without the use of photon-recycling reflectors. The SNAP also demonstrates doubled signal-to-noise ratio, reduced reset time (~ 4.9 ns decay time) and improved timing jitter (62 ps FWHM) compared to standard SNSPDs.

preprint2013arXiv

Optical time domain reflectometry with low noise waveguide-coupled superconducting nanowire single-photon detectors

We demonstrate optical time domain reflectometry over 200 km of optical fiber using low-noise NbTiN superconducting single-photon detectors integrated with Si3N4 waveguides. Our small detector footprint enables high timing resolution of 50ps and a dark count rate of 3 Hz with unshielded fibers, allowing for identification of defects along the fiber over a dynamic range of 37.4 dB. Photons scattered and reflected back from the fiber under test can be detected in free-running mode without showing dead zones or other impairments often encountered in semiconductor photon-counting optical time domain reflectometers.

preprint2013arXiv

Quantum discord as resource for remote state preparation

Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However, computational models have been discovered, which consume very little or no entanglement and still can efficiently solve certain problems thought to be classically intractable. The existence of these models suggests that separable or weakly entangled states could be extremely useful tools for quantum information processing as they are much easier to prepare and control even in dissipative environments. It has been proposed that a requirement for useful quantum states is the generation of so-called quantum discord, a measure of non-classical correlations that includes entanglement as a subset. Although a link between quantum discord and few quantum information tasks has been studied, its role in computation speed-up is still open and its operational interpretation remains restricted to only few somewhat contrived situations. Here we show that quantum discord is the optimal resource for the remote quantum state preparation, a variant of the quantum teleportation protocol. Using photonic quantum systems, we explicitly show that the geometric measure of quantum discord is related to the fidelity of this task, which provides an operational meaning. Moreover, we demonstrate that separable states with non-zero quantum discord can outperform entangled states. Therefore, the role of quantum discord might provide fundamental insights for resource-efficient quantum information processing.