Search arXivSearch

arXiv subjects

Yiling Wang

Publications and source records attributed to Yiling Wang.

13 recordsLinked to original sources

Sharp State-Independent Uncertainty Relations for Multipartite systems

Uncertainty relations constrain the fluctuations of incompatible observables, but most familiar bounds depend on the quantum state. State-independent uncertainty relations instead ask how much fluctuation remains unavoidable for every quantum state. For observables generated by a continuous symmetry, sharp state-independent bounds are known when the symmetry representation is irreducible. Multipartite collective systems, however, generally appear as reducible tensor-product representations of a symmetry algebra, which raises the question of how to determine their total uncertainty. We resolve this problem for multipartite quantum systems with a compact semisimple symmetry algebra $\mathfrak g$. Exploiting the symmetry structure, we formulate a general framework for state-independent uncertainty based on representation theory. The total variance admits an exact decomposition into intrinsic fluctuations within irreducible sectors and a nonnegative dispersion between sectors. This yields the sharp state-independent bound for the total variance $\Delta_\rho^2(\mathfrak g)$ on the multipartite Hilbert space $\mathcal H$ \[ \min_{\rho}\Delta_\rho^2(\mathfrak g) = \min_{\lambda\in\Lambda(\mathcal H)} 2\langle\lambda,\delta\rangle, \] where $\rho$ is any density operator on $\mathcal H$, $\Lambda(\mathcal H)$ is the set of highest weights $\lambda$ labeling those sectors, and $\delta$ is the Weyl vector. This demonstrates that the ultimate uncertainty is completely controlled by its intrinsic symmetry structure. As a special example, this result confirms our previous conjecture that the total uncertainty floor of collective spin-$1/2$ systems depends only on the parity of the particle number. We further illustrate the framework for multipartite spin-$1$ systems, demonstrating that the same symmetry-sector mechanism persists beyond spin-$1/2$.

quant-ph

Unified monogamy and polygamy relations for multipartite systems

For a bipartite entanglement measure $\mathcal{E}$ that satisfies the $\gamma$th-power monogamy inequality (Eq.~\eqref{e:chap1-ineq1}), and for its assisted counterpart $\mathcal{E}_a$ that obeys the $\delta$th-power polygamy inequality (Eq.~\eqref{e:chap1-ineq2}), we introduce a unified, tunable framework indexed by a parameter $m\geq1$. Within this framework, we derive two hierarchical families of refined inequalities: a tightened $\alpha$-power monogamy relation for $\mathcal{E}$, valid for all $\alpha \geq m\gamma$; a tightened $\beta$-power polygamy relation for $\mathcal{E}_a$, applicable for $(m-1)\delta < \beta \leq m\delta$. As $m$ increases, the bounds become progressively tighter, recovering known results at $m=1$. Notably, the optimal monogamy bound emerges as a piecewise function of $\alpha$, with additional correction terms activated as $\alpha$ crosses successive integer thresholds, thereby offering a sharper characterization of entanglement distribution. We demonstrate that our results generalize and strengthen existing monogamy and polygamy relations through analytical comparisons and numerical evaluations using concurrence and concurrence of assistance. This hierarchical, parameterized approach offers enhanced and flexible tools for applications in quantum communication, quantum networks, and multipartite quantum information processing.

quant-ph

State-independent uncertainty relations on multipartite spin $1/2$-systems

Uncertainty relations quantify fundamental limits on simultaneous measurement of quantum observables. While conventional formulations are state-dependent, state-independent uncertainty relations (SIURs) impose universal bounds determined solely by the algebraic structure of the operators, with applications across metrology, quantum cryptography, and entanglement detection. Despite extensive study, exact analytical variance-based SIURs have so far been established primarily for one- and bi-partite systems, while entropic SIURs have been extended to multipartite and memory-assisted settings through information-theoretic constructions. In contrast, exact variance-based SIURs beyond the bipartite level have remained analytically unresolved.} Here we develop a representation-theoretic framework for multipartite SIURs in collective spin-$\tfrac{1}{2}$ systems. Using the Clebsch--Gordan decomposition and extremal analysis of total spin variance, we derive exact state-independent bounds up to quintipartite systems. A clear structural dichotomy emerges: odd $n$ systems exhibit strictly positive universal bounds (e.g., $\Delta^2(\mathfrak{su}_2)\!\ge\!4/11$ for $n=3$), whereas even $n$ admit vanishing variance on trivial sectors but retain positive reduced-space bounds (e.g., $\Delta^2(\mathfrak{su}_2)\!\ge\!1/8$ for $n=4$). These results establish the first unified, algebraic framework for multipartite variance-based SIURs in qubit ensembles.

quant-ph

ACR: Adaptive Context Refactoring via Context Refactoring Operators for Multi-Turn Dialogue

Large Language Models (LLMs) have shown remarkable performance in multi-turn dialogue. However, in multi-turn dialogue, models still struggle to stay aligned with what has been established earlier, follow dependencies across many turns, and avoid drifting into incorrect facts as the interaction grows longer. Existing approaches primarily focus on extending the context window, introducing external memory, or applying context compression, yet these methods still face limitations such as \textbf{contextual inertia} and \textbf{state drift}. To address these challenges, we propose the \textbf{A}daptive \textbf{C}ontext \textbf{R}efactoring \textbf{(ACR)} Framework, which dynamically monitors and reshapes the interaction history to mitigate contextual inertia and state drift actively. ACR is built on a library of context refactoring operators and a teacher-guided self-evolving training paradigm that learns when to intervene and how to refactor, thereby decoupling context management from the reasoning process. Extensive experiments on multi-turn dialogue demonstrate that our method significantly outperforms existing baselines while reducing token consumption.

cs.CL

SafeMo: Linguistically Grounded Unlearning for Trustworthy Text-to-Motion Generation

Text-to-motion (T2M) generation with diffusion backbones achieves strong realism and alignment. Safety concerns in T2M methods have been raised in recent years; existing methods replace discrete VQ-VAE codebook entries to steer the model away from unsafe behaviors. However, discrete codebook replacement-based methods have two critical flaws: firstly, replacing codebook entries which are reused by benign prompts leads to drifts on everyday tasks, degrading the model's benign performance; secondly, discrete token-based methods introduce quantization and smoothness loss, resulting in artifacts and jerky transitions. Moreover, existing text-to-motion datasets naturally contain unsafe intents and corresponding motions, making them unsuitable for safety-driven machine learning. To address these challenges, we propose SafeMo, a trustworthy motion generative framework integrating Minimal Motion Unlearning (MMU), a two-stage machine unlearning strategy, enabling safe human motion generation in continuous space, preserving continuous kinematics without codebook loss and delivering strong safety-utility trade-offs compared to current baselines. Additionally, we present the first safe text-to-motion dataset SafeMoVAE-29K integrating rewritten safe text prompts and continuous refined motion for trustworthy human motion unlearning. Built upon DiP, SafeMo efficiently generates safe human motions with natural transitions. Experiments demonstrate effective unlearning performance of SafeMo by showing strengthened forgetting on unsafe prompts, reaching 2.5x and 14.4x higher forget-set FID on HumanML3D and Motion-X respectively, compared to the previous SOTA human motion unlearning method LCR, with benign performance on safe prompts being better or comparable. Code: https://github.com/AIGeeksGroup/SafeMo. Website: https://aigeeksgroup.github.io/SafeMo.

cs.CV

Zassenhaus Expansion in Solving the Schr\"odinger Equation

A fundamental challenge in quantum simulation is approximating the time-evolution operator \(U(t)=e^{-i\mathcal{H}t}\) generated by a large sum of typically non-commuting Hamiltonians using resource-efficient circuits compatible with near-term devices. We present a refinement of fixed-depth Lie-theoretic simulation that incorporates second-order Zassenhaus commutator corrections into a Cartan/KAK decomposition template. The resulting approximation retains constant circuit depth while achieving local error \(\mathcal{O}(t^3)\) in operator norm under standard boundedness assumptions, and it substantially reduces gate counts relative to first-order product formulas when time is large and depth is constrained. The method leverages closure of Pauli commutators inside Pauli-generated Lie algebras, enabling symbolic commutator evaluation and avoiding explicit matrix exponentiation in classical preprocessing. This yields a structured pathway to compile lattice and chemistry-inspired Hamiltonians with locality constraints into fixed-depth circuits suitable for noisy intermediate-scale quantum hardware.

quant-ph

TrackRAD2025 challenge dataset: Real-time tumor tracking for MRI-guided radiotherapy

Purpose: Magnetic resonance imaging (MRI) to visualize anatomical motion is becoming increasingly important when treating cancer patients with radiotherapy. Hybrid MRI-linear accelerator (MRI-linac) systems allow real-time motion management during irradiation. This paper presents a multi-institutional real-time MRI time series dataset from different MRI-linac vendors. The dataset is designed to support developing and evaluating real-time tumor localization (tracking) algorithms for MRI-guided radiotherapy within the TrackRAD2025 challenge (https://trackrad2025.grand-challenge.org/). Acquisition and validation methods: The dataset consists of sagittal 2D cine MRIs in 585 patients from six centers (3 Dutch, 1 German, 1 Australian, and 1 Chinese). Tumors in the thorax, abdomen, and pelvis acquired on two commercially available MRI-linacs (0.35 T and 1.5 T) were included. For 108 cases, irradiation targets or tracking surrogates were manually segmented on each temporal frame. The dataset was randomly split into a public training set of 527 cases (477 unlabeled and 50 labeled) and a private testing set of 58 cases (all labeled). Data Format and Usage Notes: The data is publicly available under the TrackRAD2025 collection: https://doi.org/10.57967/hf/4539. Both the images and segmentations for each patient are available in metadata format. Potential Applications: This novel clinical dataset will enable the development and evaluation of real-time tumor localization algorithms for MRI-guided radiotherapy. By enabling more accurate motion management and adaptive treatment strategies, this dataset has the potential to advance the field of radiotherapy significantly.

physics.med-ph

Superior monogamy and polygamy relations and estimates of concurrence

It is well known that any well-defined bipartite entanglement measure $\mathcal{E}$ obeys $\gamma$th-monogamy relations Eq. (1.1) and assisted measure $\mathcal{E}_{a}$ obeys $\delta$th-polygamy relations Eq. (1.2). Recently, we presented a class of tighter parameterized monogamy relation for the $\alpha$th $(\alpha\geq\gamma)$ power based on Eq. (1.1). This study provides a family of tighter lower (resp. upper) bounds of the monogamy (resp. polygamy) relations in a unified manner. In the first part of the paper, the following three basic problems are focused: (i) tighter monogamy relation for the $\alpha$th ($0\leq \alpha\leq \gamma$) power of any bipartite entanglement measure $\mathcal{E}$ based on Eq. (1.1); (ii) tighter polygamy relation for the $\beta$th ($ \beta \geq \delta$) power of any bipartite assisted entanglement measure $\mathcal{E}_{a}$ based on Eq. (1.2); (iii) tighter polygamy relation for the $\omega$th ($0\leq \omega \leq \delta$) power of any bipartite assisted entanglement measure $\mathcal{E}_{a}$ based on Eq. (1.2). In the second part, using the tighter polygamy relation for the $\omega$th ($0\leq \omega \leq 2$) power of CoA, we obtain good estimates or bounds for the $\omega$th ($0\leq \omega \leq 2$) power of concurrence for any $N$-qubit pure states $|\psi\rangle_{AB_{1}\cdots B_{N-1}}$ under the partition $AB_{1}$ and $B_{2}\cdots B_{N-1}$. Detailed examples are given to illustrate that our findings exhibit greater strength across all the region.

quant-ph

Tighter bounds for generalized monogamy and polygamy relations

We study generalized monogamy and polygamy relations for concurrence of assistance and negativity of assistance using parametrized bounds in general multi-partite quantum systems. The new method overcomes the shortcomings of previous studies where a method is only good at a particular region. We provide detailed examples to show why the new approach is effective in all regions.

quant-ph

Tighter parameterized monogamy relations

We seek a systematic tightening method to represent the monogamy relation for some measure in multipartite quantum systems. By introducing a family of parametrized bounds, we obtain tighter lowering bounds for the monogamy relation compared with the most recently discovered relations. We provide detailed examples to illustrate why our bounds are better.

quant-ph

Universal deterministic patterns in stochastic count data

We report the existence of deterministic patterns in plots showing the relationship between the mean and the Fano factor (ratio of variance and mean) of stochastic count data. These patterns are found in a wide variety of datasets, including those from genomics, paper citations, commerce, ecology, disease outbreaks, and employment statistics. We develop a theory showing that the patterns naturally emerge when data sampled from discrete probability distributions is organised in matrix form. The theory precisely predicts the patterns and shows that they are a function of only one variable - the sample size.

q-bio.QM

Fast Online Movement Optimization of Aerial Base Stations Based on Global Connectivity Map

Aerial base stations (ABSs) mounted on unmanned aerial vehicles (UAVs) are capable of extending wireless connectivity to ground users (GUs) across a variety of scenarios. However, it is an NP-hard problem with exponential complexity in $M$ and $N$, in order to maximize the coverage rate (CR) of $M$ GUs by jointly placing $N$ ABSs with limited coverage range. The complexity of the problem escalates in environments where the signal propagation is obstructed by localized obstacles such as buildings, and is further compounded by the dynamic GU positions. In response to these challenges, this paper focuses on the optimization of a multi-ABS movement problem, aiming to improve the mean CR for mobile GUs within a site-specific environment. Our proposals include 1) introducing the concept of global connectivity map (GCM) which contains the connectivity information between given pairs of ABS/GU locations; 2) partitioning the ABS movement problem into ABS placement sub-problems and formulate each sub-problem into a binary integer linear programming (BILP) problem based on GCM; 3) and proposing a fast online algorithm to execute (one-pass) projected stochastic subgradient descent within the dual space to rapidly solve the BILP problem with near-optimal performance. Numerical results demonstrate that our proposed method achieves a high CR performance close to the upper bound obtained by the open-source solver (SCIP), yet with significantly reduced running time. Moreover, our method also outperforms common benchmarks in the literature such as the K-means initiated evolutionary algorithm or the ones based on deep reinforcement learning (DRL), in terms of CR performance and/or time efficiency.

cs.IT

Weighted monogamy and polygamy relations

This research offers a comprehensive approach to strengthening both monogamous and polygamous relationships within the context of quantum correlations in multipartite quantum systems. We present the most stringent bounds for both monogamy and polygamy in multipartite systems compared to recently established relations. We show that whenever a bound is given (named it monogamy or polygamy), our bound indexed by some parameter $s$ will always be stronger than the given bound derived from the base relation. The study includes detailed examples, highlighting that our findings exhibit greater strength across all existing cases in comparison.

quant-ph