SearcharxivSearch

arXiv subjects

Geng Chen

Publications and source records attributed to Geng Chen.

At least 19 recordsLinked to original sources

Correlation Geometry of Quantum Sensor Networks: Local-Global Information Flow and Local Privacy

Quantum sensor networks (QSN) typically encode N unknown parameters while targeting a single linear combination, rendering the N-1 remaining parameters as nuisance directions. To rigorously quantify estimation precision under such nuisances, we use the effective quantum Fisher information (EQFI) and establish a ``barrel-effect'' bottleneck: the global EQFI cannot exceed the weakest weighted local sensing capacity. To elucidate the information allocation mechanism underlying this bottleneck, we derive an exact local--global phase map that delineates how the trade-off between local and global EQFI depends dynamically on quantum correlations, and accordingly we identify concrete conditions for saturating the bottleneck bound. Notably, this geometric map uncovers a counterintuitive ``overcorrelated'' regime where excessive correlations actively degrade both local and global performance. Finally, we apply the phase map to intrinsic local privacy and identify the condition under which every local parameter is inaccessible while the desired global combination remains estimable. Overall, our work provides a principled methodology for engineering optimal network states in quantum sensing architectures.

quant-ph

The $L^2$ contraction of solutions with large perturbation in multiple space dimensions from the oscillatory dispersive planar shock

In this paper, we show the $L^2$ contraction property of the planar oscillatory or monotone dispersive shock profiles of the dissipative Kadomtsev-Petviashvili (KP) equation modelling water waves and the multi-dimensional Korteweg-de Vries (KdV) Burgers equation under arbitrarily large perturbations in two space dimensions, up to Lipschitz time-dependent shifts. This stability result extends the results of two recent papers by Chen, Eun, Kang, and Shen on $L^2$ contraction for the KdV-Burgers equation.

math.AP

ARGON: A GNN-Empowered Compilation Framework for Scalable Neutral Atom Computing

Neutral atom quantum systems offer a promising pathway to large-scale quantum computing due to high qubit uniformity and flexible connectivity. To exploit this architecture, compilers must coordinate dynamic atom transport alongside highly parallel entangling gates. As circuits scale, the interplay between these operations becomes a system bottleneck, introducing denser logical interactions and longer temporal dependencies. Compilers must simultaneously satisfy rigid spatial constraints and complex movement schedules. Existing joint spatiotemporal compilation methods face an exponentially expanding search space, incurring substantial overheads or compromising fidelity as circuit size grows. In this work, we propose ARGON, a scalable compilation framework that introduces a spatiotemporal decoupling paradigm for neutral atom processors. Our key novelty is offloading static geometric conflict resolution to an offline phase, precomputing a library of hardware-certified, high-parallelism spatial layouts. To guide temporal routing, we deploy a Graph Neural Network (GNN) predictor to evaluate candidate layouts against deep temporal horizons, proactively evading downstream kinematic bottlenecks. Finally, a heuristic router translates the selected sequence into collision-free physical transport. Evaluations show ARGON completes compilation in under 10 seconds, delivering up to a >10^4x and 600x average speedup over state-of-the-art baselines. ARGON also minimizes routing decoherence and reduces Rydberg stages, improving execution fidelity by up to 10^2x on dense circuits.

cs.ET

Effect of an aligned current on the stability of oscillatory incompressible flow past a circular cylinder

The stability of incompressible flow past a circular cylinder under collinear steady and oscillatory forcing is investigated within a two-dimensional Floquet framework. The flow is parameterised by the Keulegan-Carpenter number $KC \in [4,12]$, the steady-to-oscillatory velocity ratio $m \in [0,1]$, and the oscillatory Reynolds number $Re_m \in [20,100]$. The loci of the leading Floquet multipliers, and hence case-specific bifurcation modes, are examined by progressively reducing $Re_m$ to subcritical values for prescribed $m$. A steady current with $m > 0.5$ gives rise to a period-doubling subharmonic bifurcation that does not occur in purely oscillatory flow, where only synchronous and quasi-periodic modes arise. For $Re_m = 100$, three key features are discernible. First, the neutral stability curve in $(KC,m)$ space is strongly non-monotonic in $m$, separating intrinsically stable regions from those with single unstable modes; a sub-region of striking mode re-stabilisation appears beyond $m \approx 0.9$, where the flow recovers a $Z_2$-symmetric state at peak Reynolds number $\approx 190$, despite the steady and oscillatory components each being individually unstable. Second, a distinct regime supports the coexistence of two unstable modes of different types. Third, complementary direct numerical simulations show that, for a single unstable mode, the linear analysis successfully predicts the saturated nonlinear state even when $Re_m = 100$ substantially exceeds the critical Reynolds number, whereas under mode coexistence the quasi-periodic attractor tends to dominate the developed dynamics.

physics.flu-dyn

Long-Horizon Manipulation via Trace-Conditioned VLA Planning

Long-horizon manipulation remains challenging for vision-language-action (VLA) policies: real tasks are multi-step, progress-dependent, and brittle to compounding execution errors. We present LoHo-Manip, a modular framework that scales short-horizon VLA execution to long-horizon instruction following via a dedicated task-management VLM. The manager is decoupled from the executor and is invoked in a receding-horizon manner: given the current observation, it predicts a progress-aware remaining plan that combines (i) a subtask sequence with an explicit done + remaining split as lightweight language memory, and (ii) a visual trace -- a compact 2D keypoint trajectory prompt specifying where to go and what to approach next. The executor VLA is adapted to condition on the rendered trace, thereby turning long-horizon decision-making into repeated local control by following the trace. Crucially, predicting the remaining plan at each step yields an implicit closed loop: failed steps persist in subsequent outputs, and traces update accordingly, enabling automatic continuation and replanning without hand-crafted recovery logic or brittle visual-history buffers. Extensive experiments spanning embodied planning, long-horizon reasoning, trajectory prediction, and end-to-end manipulation in simulation and on a real Franka robot demonstrate strong gains in long-horizon success, robustness, and out-of-distribution generalization. Project page: https://www.liuisabella.com/LoHoManip

cs.RO

EgoVerse: An Egocentric Human Dataset for Robot Learning from Around the World

Robot learning increasingly depends on large and diverse data, yet robot data collection remains expensive and difficult to scale. Egocentric human data offer a promising alternative by capturing rich manipulation behavior across everyday environments. However, existing human datasets are often limited in scope, difficult to extend, and fragmented across institutions. We introduce EgoVerse, a collaborative platform for human data-driven robot learning that unifies data collection, processing, and access under a shared framework, enabling contributions from individual researchers, academic labs, and industry partners. The current release includes 1,362 hours (80k episodes) of human demonstrations spanning 1,965 tasks, 240 scenes, and 2,087 unique demonstrators, with standardized formats, manipulation-relevant annotations, and tooling for downstream learning. Beyond the dataset, we conduct a large-scale study of human-to-robot transfer with experiments replicated across multiple labs, tasks, and robot embodiments under shared protocols. We find that policy performance generally improves with increased human data, but that effective scaling depends on alignment between human data and robot learning objectives. Together, the dataset, platform, and study establish a foundation for reproducible progress in human data-driven robot learning. Videos and additional information can be found at https://egoverse.ai/

cs.RO

Existence and singularity formation for the supersonic expanding wave of radially symmetric non-isentropic compressible Euler equations

This paper studies the existence and singularity formation of supersonic expanding waves for the radially symmetric non-isentropic compressible Euler equations of polytropic gases. We introduce a suitable pair of gradient variables to characterize the rarefaction and compression properties of the solutions. Based on their Riccati equations, we construct several useful invariant domains to establish a series of priori estimates of solutions under some assumptions on the initial data. We show that the solution is smooth in the characteristic triangle or quadrangle domain if both of these two gradient variables are non-negative at the initial time. On the other hand, when one of these two variables is very negative at some initial point, the solution forms a singularity in finite time.

math.AP

$L^2$-contraction of Shock Waves for KdV-Burgers Equation

The KdV-Burgers equation is a canonical model describing the interplay between nonlinearity, viscosity and dispersion, and it admits viscous-dispersive shocks as traveling wave solutions. In this paper, we establish an $L^2$-contraction property for viscous-dispersive shocks under arbitrarily large perturbations, up to a time-dependent shift. This yields time-asymptotic stability and uniform estimates with respect to the strengths of viscosity and dispersion. We present the proof for the monotone shocks, and introduce the companion work in [6] on the stability and structural properties of oscillatory shocks.

math.AP

Complex Dynamics of Wave-Character Transitions in Radially Symmetric Isentropic Euler Flows: Theory and Numerics

We investigate the qualitative dynamics of smooth solutions to the radially symmetric isentropic compressible Euler equations, focusing specifically on the evolution of rarefactive and compressive wave characters across three distinct configurations: the outward supersonic, subsonic, and inward supersonic regimes. For each case, we establish structural restrictions on wave-character transitions and identify invariant sign domains for gradient variables under specific initial data conditions. While our findings refine existing invariance properties in the outward supersonic regime, they reveal novel asymmetric transition mechanisms in the subsonic and inward regimes that are absent in purely supersonic expanding cases. Consequently, we derive sufficient conditions for finite-time singularity formation. To complement the analytical results where closed-form solutions are unavailable, we provide numerical experiments using a Semi-Discrete Lagrangian-Eulerian (SDLE) formulation. These simulations reproduce the predicted wave-character dynamics and offer qualitative evidence that supports our theoretical findings, providing a unified description of wave transitions in radially symmetric isentropic gas dynamics.

math.AP

Uniform Stability of Oscillatory Shocks for KdV-Burgers Equation

We study viscous-dispersive shock waves with infinite oscillations of the Korteweg-de Vries-Burgers (KdVB) equation. First, we establish detail structures of the shock waves, including the rates at which the local extrema converge to the left end state towards the left far field. Then, by exploiting the structural properties of the shocks, we show the $L^2$-contraction property of the shock profiles under arbitrarily large perturbations, up to time-dependent shifts. This property implies both time-asymptotic stability and uniform stability with respect to the viscosity and dispersion coefficients. This uniformity yields the existence of zero viscosity-dispersion limits, on which Riemann shocks are orbitally stable.

math.AP

Informationally Complete Distributed Metrology Without a Shared Reference Frame

In quantum information processing, implementing arbitrary preparations and measurements on qubits necessitates precise information to identify a specific reference frame (RF). In space quantum communication and sensing, where a shared RF is absent, the interplay between locality and symmetry imposes fundamental restrictions on physical systems. A restriction on realizable unitary operations results in a no-go theorem prohibiting the extraction of locally encoded information in RF-independent distributed metrology. Here, we propose a reversed-encoding method applied to two copies of local-unitary-invariant network states. This approach circumvents the no-go theorem while simultaneously mitigating decoherence-like noise caused by RF misalignment, thereby enabling the complete recovery of the quantum Fisher information (QFI). Furthermore, we confirm local Bell-state measurements as an optimal strategy to saturate the QFI. Our findings pave the way for the field application of distributed quantum sensing, which is inherently subject to unknown RF misalignment and was previously precluded by the no-go theorem.

quant-ph

Non-commutativity as a Universal Characterization for Enhanced Quantum Metrology

A central challenge in quantum metrology is to effectively harness quantum resources to surpass classical precision bounds. Although recent studies suggest that the indefinite causal order may enable sensitivities to attain the super-Heisenberg scaling, the physical origins of such enhancements remain elusive. Here, we introduce the nilpotency index $\mathcal{K}$, which quantifies the depth of non-commutativity between operators during the encoding process, can act as a fundamental parameter governing quantum-enhanced sensing. We show that a finite $\mathcal{K}$ yields an enhanced scaling of root-mean-square error as $N^{-(1+\mathcal{K})}$. Meanwhile, the requirement for indefinite causal order arises only when the nested commutators become constant. Remarkably, in the limit $\mathcal{K} \to \infty$, exponential precision scaling $N^{-1}e^{-N}$ is achievable. We propose experimentally feasible protocols implementing these mechanisms, providing a systematic pathway towards practical quantum-enhanced metrology.

quant-ph

In-N-On: Scaling Egocentric Manipulation with in-the-wild and on-task Data

Egocentric videos are a valuable and scalable data source to learn manipulation policies. However, due to significant data heterogeneity, most existing approaches utilize human data for simple pre-training, which does not unlock its full potential. This paper first provides a scalable recipe for collecting and using egocentric data by categorizing human data into two categories: in-the-wild and on-task alongside with systematic analysis on how to use the data. We first curate a dataset, PHSD, which contains over 1,000 hours of diverse in-the-wild egocentric data and over 20 hours of on-task data directly aligned to the target manipulation tasks. This enables learning a large egocentric language-conditioned flow matching policy, Human0. With domain adaptation techniques, Human0 minimizes the gap between humans and humanoids. Empirically, we show Human0 achieves several novel properties from scaling human data, including language following of instructions from only human data, few-shot learning, and improved robustness using on-task data. Project website: https://xiongyicai.github.io/In-N-On/

cs.RO

Channel-Constrained Markovian Quantum Diffusion Model from Open System Perspective

We present a channel-constrained Markovian quantum diffusion (CCMQD) model that prepares quantum states by rigorously framing the generative process within the dynamics of open quantum systems. Our model interprets the forward diffusion process as natural decoherence using quantum master equations, whereas the reverse denoising is achieved by learning inverse quantum channels. Our core innovation is a comprehensive channel-constrained framework: we model the diffusion and denoising steps as quantum channels defined by Kraus operators, ensure their physical validity through optimization on the Stiefel manifold, and introduce tailored training strategies and loss functions that leverage this constrained structure for high-fidelity state reconstruction. Experimental validation on systems ranging from single qubits to entangled states $7$ -qubits demonstrates high-fidelity state generation, achieving fidelities exceeding $0.998$ under both random and depolarizing noise conditions. This work confirms that quantum diffusion can be characterized as a controlled Markov evolution, demonstrating that environmental interactions are not limited to being a source of decoherence but can also be utilized to achieve high-fidelity quantum state synthesis.

quant-ph

AirCopBench: A Benchmark for Multi-drone Collaborative Embodied Perception and Reasoning

Multimodal Large Language Models (MLLMs) have shown promise in single-agent vision tasks, yet benchmarks for evaluating multi-agent collaborative perception remain scarce. This gap is critical, as multi-drone systems provide enhanced coverage, robustness, and collaboration compared to single-sensor setups. Existing multi-image benchmarks mainly target basic perception tasks using high-quality single-agent images, thus failing to evaluate MLLMs in more complex, egocentric collaborative scenarios, especially under real-world degraded perception conditions.To address these challenges, we introduce AirCopBench, the first comprehensive benchmark designed to evaluate MLLMs in embodied aerial collaborative perception under challenging perceptual conditions. AirCopBench includes 14.6k+ questions derived from both simulator and real-world data, spanning four key task dimensions: Scene Understanding, Object Understanding, Perception Assessment, and Collaborative Decision, across 14 task types. We construct the benchmark using data from challenging degraded-perception scenarios with annotated collaborative events, generating large-scale questions through model-, rule-, and human-based methods under rigorous quality control. Evaluations on 40 MLLMs show significant performance gaps in collaborative perception tasks, with the best model trailing humans by 24.38% on average and exhibiting inconsistent results across tasks. Fine-tuning experiments further confirm the feasibility of sim-to-real transfer in aerial collaborative perception and reasoning.

cs.CV

Quantitative weak-BV stability of "wild'' solutions to compressible Euler equations, with a view towards higher systems

For hyperbolic systems of conservation laws, including important physical models from continuum mechanics, the question of stability for large data solutions remains a challenging open problem. In recent work (arXiv:2507.23645) the authors introduce a framework for showing H\"older stability of potentially "wild" large data solutions, relative to a class of BV solutions, for systems with two conserved quantities. This is referred to as "weak-BV" stability. In this paper, we give a short introduction to the methods while applying them to the "full" Euler system with three conserved quantities. We discuss applications to future work for higher systems with additional conserved quantities.

math.AP

PeftCD: Leveraging Vision Foundation Models with Parameter-Efficient Fine-Tuning for Remote Sensing Change Detection

To tackle the prevalence of pseudo changes, the scarcity of labeled samples, and the difficulty of cross-domain generalization in multi-temporal and multi-source remote sensing imagery, we propose PeftCD, a change detection framework built upon Vision Foundation Models (VFMs) with Parameter-Efficient Fine-Tuning (PEFT). At its core, PeftCD employs a weight-sharing Siamese encoder derived from a VFM, into which LoRA and Adapter modules are seamlessly integrated. This design enables highly efficient task adaptation by training only a minimal set of additional parameters. To fully unlock the potential of VFMs, we investigate two leading backbones: the Segment Anything Model v2 (SAM2), renowned for its strong segmentation priors, and DINOv3, a state-of-the-art self-supervised representation learner. The framework is complemented by a deliberately lightweight decoder, ensuring the focus remains on the powerful feature representations from the backbones. Extensive experiments demonstrate that PeftCD achieves state-of-the-art performance across multiple public datasets, including SYSU-CD (IoU 73.81%), WHUCD (92.05%), MSRSCD (64.07%), MLCD (76.89%), CDD (97.01%), S2Looking (52.25%) and LEVIR-CD (85.62%), with notably precise boundary delineation and strong suppression of pseudo-changes. In summary, PeftCD presents an optimal balance of accuracy, efficiency, and generalization. It offers a powerful and scalable paradigm for adapting large-scale VFMs to real-world remote sensing change detection applications. The code and pretrained models will be released at https://github.com/dyzy41/PeftCD.

cs.CV