Functional Analysis
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Let $g$ be a nondecreasing left-continuous function and let $\mu_g$ be its Lebesgue–Stieltjes measure. We establish a Banach-valued fundamental theorem of calculus and an Aubin–Lions compactness theorem for evolution measured by $\mu_g$, allowing absolutely continuous, singular continuous and atomic components. If the range space has the Radon–Nikodým property, a curve is $g$-absolutely continuous if and only if it is an indefinite Bochner integral; its strong $g$-derivative is the Bochner density and the variation measure has density equal to its norm. A terminal atom may make the derivative invisible from the Bochner state class, so the natural evolution space is a graph of state–derivative pairs. For $B_0\Subset B\hookrightarrow B_1$, with $B_0$ and $B_1$ reflexive and $1<p_0,p_1<\infty$, the state projection is a compact linear operator into $L_g^{p_0}([a,b);B)$. The proof combines bounded evaluation at atoms, local $\mu_g$-averages at nonatomic points and Ehrling's inequality. The result recovers the classical theorem and yields compactness principles for bounded time scales, weighted sequences and mixed Stieltjes measures.
Combinatorics
Asymptotic Bounds for Irredundant Covers of Square Grids by 2 x 2 Cards
We study an irredundant covering of an $m \times m$ square grid by $2 \times 2$ cards, where cards may overlap and every card must lie entirely inside the grid. Every square of the grid must be covered, and every card must contain at least one square that is covered only by itself. Let \(F(m)\) denote the maximum number of cards in such an irredundant cover. We develop a general framework for bounding the maximum possible size of such an irredundant cover based on square multiplicities, double counting, and local geometric restrictions arising around highly covered squares. These arguments yield a general upper bound whose leading term is $\frac{1}{2}m^2$, accompanied by a negative linear term. In the opposite direction, we construct a family of irredundant covers based on a density-$\frac{1}{2}$ covering pattern, referred to as the period-four staircase pattern, together with a boundary-repair construction. Thus, we obtain a lower bound with the same leading term and a linear-order error, proving that for every \(m\ge6\), \[ \frac{2m}{9} \le \frac12m^2-F(m) \le 2m-3, \] and consequently that the maximum density of an irredundant cover tends to $\frac{1}{2}$ as $m\to\infty$. The known $10\times 10$ case is used as motivation and as a finite benchmark for the general theory.
Read the full abstract
Strongly Correlated Electrons
Non-equilibrium dissipative stabilization of s- and d-wave superconductivity
Stabilizing superconductivity beyond its equilibrium regime has been one of the quests of nonequilibrium state engineering. We report the presence of nonthermal pairing gap in BCS superconductors coupled to two thermal baths, where one of the baths can be at a temperature well above the equilibrium $T_c$. Superconducting state is enabled by a highly non-equilibrium steady state stabilized by weak coupling to baths that break detailed balance condition. The steady-state is well described by a generalized Gibbs ensemble parametrized with chemical potentials for associated Bogoliubov quasiparticle. A strong, non-perturbative effect is reported for both $s$-wave and $d$-wave superconductors, and its possible realization in cavity-based experiments is discussed.
Read the full abstract
Optics
Transition of Photonic Dissipative Dynamics through the Exceptional Point
The decay of light in an optical structure depends not only on the intrinsic properties of the material but also on the surrounding electromagnetic environment. This principle has laid the foundation for the engineering of dissipation in photonic emitters. In the conventional wisdom, dissipation is governed by a fixed set of decay channels, each defined by the eigenstates of the structure, and energy leaks through and interacts with these channels. Here we provide experimental evidence that this paradigm fails in non-Hermitian systems. Specifically, we observe an accelerated transient decay in a pair of coupled microcavities tuned near the exceptional point, revealing that photonic dissipation can be governed not by reconfiguring existing loss channels, but rather by restructuring the underlying state space. The universality of this phenomenon is corroborated through two independent control parameters.The finding provides a new perspective on dissipative dynamics in open optical systems and offers a distinct mechanism for controlling transient decay in ultrafast photonic systems.
Read the full abstract
Artificial Intelligence
Reference-Based Bias Detection in LLMs via Relative Representations of Hidden States
Existing bias auditing methods typically rely on model outputs, requiring costly benchmarks or judge models and potentially missing internal shifts that never appear in generated text. We propose a reference-based method that audits bias in hidden-state representations across related model variants, for example before and after fine-tuning. Because fine-tuning reshapes representation geometry, absolute hidden states are not directly comparable, so we encode each sentence by its similarities to a fixed set of anchor sentences, yielding relative representations in a shared comparison space. There we measure how target groups shift in their association with positive and negative attributes, a quantity we call the Representational Bias Shift $\Delta B$. Across three model families and the WildGuardMix, DecodingTrust and ToxiGen benchmarks, $\Delta B$ correlates with output-level bias change in 15 of the 18 settings we test, reaching $|r| = 0.84$ ($p < 0.001$) under full fine-tuning and becoming more model-dependent under parameter-efficient adaptation. Thresholding $\Delta B$ detects checkpoints whose bias increased with ROC AUC between $0.65$ and $0.99$, and on WildGuardMix and DecodingTrust it separates them better than a SEAT-based baseline for all three families. $\Delta B$ is also stable under changes to the anchor set, attribute sets and target templates. Our method requires no task-specific evaluation data and audits a model in about three minutes, using $3$-$50\times$ less compute than the output-level benchmarks considered here. We view it as complementary to output-based auditing rather than a replacement for it.
Read the full abstract
Metric Geometry
On the Gromov product and its generalization in partial metric spaces
The first aim of this article is to extend the notion of the Gromov product to the class of partial metric spaces. A relation between $\delta$-hyperbolicity of a partial metric space and $\delta$-hyperbolicity of metric spaces endowed with the metrics defined via that partial metric is also established. The second one is to analyze the Gromov product in the wide class of metric spaces in which metrics are defined via Chebyshev sets. Midpoint mappings in this class of spaces will be also examined.
Read the full abstract
Sound
NOPE-HYPE: A Structured Simulation Workflow for Robust Speech-to-Text Across Diverse Acoustic Environments
Robust speech-to-text translation systems should perform reliably across diverse acoustic conditions, yet practical pipelines lack controllable tools for systematic environment exploration. Large speech models remain sensitive to unseen acoustic conditions, as training data rarely cover the full range of real environments.We present NOPEHYPE, a structured training workflow that combines a controllable environment simulator, coverage-optimal environment reduction on Power Spectral Density (PSD) templates, and a small, interpretable hyperparameter search over simulator knobs. We show that simulator-generated noise achieves performance comparable to balanced realnoise training across Whisper and SeamlessM4T models, provide principled environment prototype sets, and identify practical default simulator configurations from a structured 27-run hyperparameter sweep.
Read the full abstract
Cryptography and Security
AutoTrans: AI-Assisted Automatic Translation of Security Assertions for RISC-V Processors
Reusing a set of verified security assertions across RISC-V processor targets remains one of the most expensive bottlenecks in hardware security verification. Manual translation takes hours per assertion. Raw LLM translation is fast but unreliable, introducing signal hallucination, where the model invents port names absent from the target RTL and produces outputs that may vary across model updates or even within the same model version. This paper presents AutoTrans, an automated framework that addresses the above shortcomings. First, a new lightweight Regular Expression-based System Verilog signal extractor is proposed to identify the signals for generating security assertions. This step is necessary to prevent signal hallucination. Second, a template is introduced to create prompt and pinned inference parameters that guarantee a byte-identical prompt assembly on every run, making the pipeline output resilient to model updates. Moreover, the introduced template for LLM prompting is capable of generating security assertions from English-only security descriptions of RISC-V processors, with no manual authoring. Third, a formal verification process (JasperGold FPV) is integrated, which guarantees that the generated security assertions verify the security of the RISC-V processor rather than silently entering the result set. The workflow is applied on Deepseek V4 to translate security assertions from one RISC-V to another (e.g., for IBEX from NS31A RISC-V). The experiment shows that AutoTrans achieves 78% Auto Translation Acceptance Rate (TAR) automatically and without human intervention and 100% Final TAR after refinement by humans.
Read the full abstract
Quantum Physics
Accelerating A*-Based Algorithms for Decoding Quantum Low-Density Parity-Check Codes
Quantum low-density parity-check (QLDPC) codes represent a promising approach for error correction in quantum computing. The recently proposed Tesseract decoder uses the A* search algorithm that guarantees finding the most likely error pattern. However, practical implementations of Tesseract often involve an extremely large graph, and the inherently sequential nature of the search results in high computational overhead and long runtime. To improve decoding efficiency, we propose a two-stage decoding framework. First, a belief propagation (BP) decoder efficiently processes the syndrome. This step generates hard decisions (a binary error vector) and soft information (per-qubit confidence levels). In non-convergent BP cases, a gating mechanism examines the BP decoder's output to identify and filter out qubits with oscillating confidence values. In these cases, the refined output serves as input to Tesseract, which then attempts to identify and correct any residual errors. This hybrid approach leverages the high speed of BP decoding and delegates the more challenging decoding instances to Tesseract. Numerical results demonstrate a substantial reduction in overall decoding complexity while maintaining the logical error rate (LER) of the stand-alone Tesseract. Across all tested physical error rates, the proposed method achieves at least 5x reduction in the number of expanded nodes in the Tesseract, with a peak reduction of nearly 15x at a physical error rate of p = 0.05 for the [[126, 12, d < 11]] T1 code, and approximately 8.8x at p = 0.05 for the [[72, 12, 6]] bicycle bivariate (BB) code.
Read the full abstract
Artificial Intelligence
OntologyAligner: Ontology-Aligned Retrieval and Hierarchy-Guided Large Language Model Reranking for Biomedical Ontology Normalization
Biomedical ontology normalization maps free-text expressions to standardized concepts, enabling consistent integration and analysis of biomedical data. This task remains challenging because lexical variation and subtle distinctions among hierarchically related concepts can obscure concept boundaries. We present OntologyAligner, a three-stage framework that combines ontology-aligned retrieval, large language model candidate reranking, and selective hierarchy-guided refinement. We also construct PhenoNormBench, a unified benchmark comprising 13,390 samples from seven Human Phenotype Ontology datasets. OntologyAligner achieved state-of-the-art performance on HPO normalization, with 88.78% Macro Top-1 Accuracy and 86.75% Micro Top-1 Accuracy, exceeding the strongest baseline by 4.85 and 5.07 percentage points, respectively. Ablation analyses showed complementary contributions from all three stages, and sensitivity analyses demonstrated stability across candidate-set sizes and model backbones. Applications to MONDO, MEDIC, and NCBITaxon further established portability to other ontologies. OntologyAligner offers a generalizable framework for accurate mapping of biomedical text to structured ontology concepts. PhenoNormBench and the code are publicly available at https://github.com/zhelishisongjie/OntologyAligner.
Read the full abstract
Sound
Orukeet: Multilingual ASR with Frozen Gabor Kernels
Orukeet replaces half of an adapted Parakeet encoder's temporal filters with 12,288 fitted Gabor kernels, freezes these replacements, and trains the remaining parameters on multilingual and multi-accent data. Final adaptation and checkpoint selection use LibriSpeech test-other. Across 20,146 FLEURS recordings in 25 languages, pooled word error rate (WER) falls from Parakeet's 11.01% to Orukeet's 9.85%, a 10.6% relative reduction. Orukeet has lower WER on 23 of the 25 languages. Orukeet outperforms Parakeet on 61 out of 74 tested splits, including LibriSpeech test-clean (1.46% vs. 1.53% WER), test-other (2.86% vs. 3.14%), and FLEURS English (3.82% vs. 4.28%). All comparisons decode the same audio with matched NeMo settings. The fitted kernels are stored as ordinary convolution weights, retaining Parakeet's architecture and inference operators.
Read the full abstract
General Economics
Do wind and solar curtail at negative electricity prices? Incentives and evidence across two decades of German renewable support schemes
In many power systems, installed wind and solar now exceed peak electricity demand. In very sunny or windy periods, curtailing renewable generation becomes a precondition for grid stability. While turning off wind turbines and solar panels is technically easy, support schemes often give renewables an economic incentive to keep producing at negative prices. This paper studies wind and solar energy in Germany, estimating, for each cohort of generators, hour by hour the incentives implied by two decades of support policy. It then sets those incentives against observed behavior, using a new estimate of market-based curtailment built from reanalysis weather data. I find that in 2025, at prices below -50 EUR/MWh, almost all wind generators had an incentive to stop producing, but only half of them did. Nearly two thirds of solar capacity had no incentive to curtail at all, mostly because it receives a feed-in tariff that shields it from wholesale prices. Of the exposed remainder, about one in seven cut production. Low exposure and response rates inflate subsidy payments and make the power system harder to operate safely. I conclude that a further expansion of wind and solar requires them to respond to price signals, which depends on policy makers providing proper incentives and on generators acting on them.
Read the full abstract
Computation and Language
Direct Diversity Optimization for Diverse Successful Trajectories in Preference Post-Training
LLM agents for sequential decision tasks are often post-trained with trajectory-level outcome labels, but such labels provide little supervision for preserving multiple successful branches from the same decision state. We study this problem as successful strategy coverage: how broadly a model realizes distinct successful strategies under a fixed rollout budget. We present Direct Diversity Optimization (DDO), an offline post-training method that combines Divergence-Tree Collection (DTC) with the Reference-Relative Target-Odds Objective (RTO). DTC constructs state-aligned branch sets rooted at shared decision states, and RTO trains the model to match reference-relative targets over successful alternatives. DDO achieves the strongest task success and successful strategy coverage among the compared post-training methods across BabyAI, BabaIsAI, and WebShop. It also achieves the highest recovery rate after local action replacement and higher task success and coverage than successful-only imitation and decoding-time diversification controls.
Read the full abstract
Sound
Zero-Shot Temporal Localisation of Audio Deepfakes in Multi-Speaker Conversations
Voice-cloning fraud increasingly relies on surgical injection: a genuine conversation in which only one or two sentences are replaced by synthetic speech. Utterance-level deepfake detectors emit a single real/fake label per clip and cannot report where the synthetic speech lies. We formalise this as Temporal Deepfake Localisation in Multi-Speaker Conversations (TDLMC), show that equal error rate and min-DCF are ill-posed once a file contains both classes, and propose temporal metrics for this regime. Our contribution is a training-free five-stage pipeline that wraps a frozen binary detector and adds segment-level output with no retraining, using a two-threshold hysteresis finitestate-machine decoder to turn noisy window scores into coherent intervals. On 180 constructed multi-speaker conversations from ASVspoof 5, the system attains temporal intersection-over-union 0.90, temporal detection rate 0.95, and MS-DCF 0.26 with a strong backbone, and its false-alarm rate on genuine speech is below 6%, falling under 2% on genuine real multi-speaker dialogue (AMI). Under an identical pipeline, a trained localiser improves temporal IoU by only about 0.04, bounding the cost of forgoing supervision. Evaluated across three frozen detectors under one decoder whose constants are selected on a held-out calibration split, and with a controlled analysis attributing the residual false-alarm rate to a backbone domain gap rather than to the decoder, this provides the first zero-shot baseline and a reusable benchmark for TDLMC.
Read the full abstract
Robotics
Grounding Generated Video Plans in Simulation Towards Versatile Dexterous Controllers
Generated hand-object interaction (HOI) videos provide a controllable way to propose manipulation motions. Simulation-based HOI tracking can translate such kinematic references into feasible low-level control, but its scalability is limited by the lack of reliable reference motions. We therefore combine generated videos with simulation-based HOI grounding: during training, generated videos provide diverse motion references for learning a multi-object, multi-trajectory HOI tracker, and at deployment, the video model produces motion plans that are executed by the learned tracker. In particular, we propose a method that enables scalable reference generation by HOI reconstruction with minimal manual intervention and successfully grounds more than 1,500 generated videos in simulation, achieving success rates over 25 percentage points higher than those of baselines during simulation-based training. In real-world closed-loop experiments, it achieves diverse grasps, including functional grasps, non-prehensile manipulation, and post-grasp object-pose tracking. Videos and code are available at https://boyuan-an.github.io/GALATEA/.
Read the full abstract
Computation and Language
MedDeID enables locally governed clinical-text de-identification from real or synthetic training data
Clinical notes contain personally identifiable information (PII), restricting reuse for research and medical AI, especially when data cannot leave an institution. We developed MedDeID, an on-premises framework combining in-house annotation and synthetic-note generation with model training, inference, pseudonymisation and evaluation. On an independently annotated, adjudicated 300-note Dutch hospital benchmark, a hospital-trained compact transformer detected 98.9% of identifying text while redacting 0.24% of text outside annotated identifiers; a synthetic-only counterpart detected 96.1%. On 100 primary-care notes, the synthetic-trained model achieved higher recall than the hospital-trained model (90.3% versus 87.0%) and greater robustness to identifier-format perturbations. An English instantiation trained without real text detected 99.7% and 98.9% of annotated identifier characters on two external synthetic benchmarks. These results demonstrate transfer of the workflow to another language, but not clinical English performance. MedDeID provides a route to locally governed de-identification using real or synthetic training data.
Read the full abstract
Nuclear Experiment
Search for neutrinoless quadruple beta decay of $^{136}$Xe in PandaX-4T detector
The observation of neutrinoless quadruple beta decay (0$\nu$4$\beta$) in the absence of neutrinoless double beta decay (0$\nu$2$\beta$) has been argued to provide a strong indication that neutrinos are Dirac particles. We report a search for 0$\nu$4$\beta$ decay of $^{136}\text{Xe}$ using a total $^{136}\text{Xe}$ exposure of 148.4 kg$\cdot$yr, collected during the commissioning and the first science runs of the PandaX-4T experiment. No significant excess of events over the background is observed. A lower limit on the 0$\nu$4$\beta$ decay half-life of $^{136}\text{Xe}$ is set at 6.01 x $10^{24}$ yr at the 90% confidence level. This result establishes the most stringent constraint on this process in xenon, demonstrating the unique capability of the PandaX-4T detector in probing lepton number violation and shedding light on the fundamental nature of neutrinos.
Read the full abstract
Human-Computer Interaction
Streaming P300 Acquisition and Statistical Signal Validation Across Five EEG Platforms: A Hardware-Agnostic BrainFlow/LSL Pipeline
P300 spellers offer people with severe motor impairment, such as ALS, an effective communication channel and remain one of the most established surgery-free alternatives to intracortical interfaces. Advanced language models have made spellers faster and more robust, yet the hardware beneath them is under-studied. We present a hardware-agnostic, real-time P300 acquisition pipeline built on BrainFlow and Lab Streaming Layer (LSL) that runs unchanged across consumer- and research-grade EEG headsets, with permutation tests of signal separability. Using a standard 6 x 6 row/column paradigm, we piloted five configurations: a custom dry system, a custom wet/gel system, Emotiv Flex, Emotiv EPOC X, and Muse 2. The custom systems and EPOC X showed weak or inconsistent signal separability, Muse 2 had the highest acquisition reliability despite limited centro-parietal coverage, and Flex showed the most promising signal. In 20 further Flex sessions varying subject, timing, and phrase length (131 target characters), a peak-amplitude permutation test and a cross-validated xDAWN decoder both detected a significant target response under two channel-exclusion policies, with decoder AUC reaching about 0.72 after 15 repetitions. Character accuracy depended heavily on evaluation methodology: in-sample majority voting reached 94.7%, whereas character-held-out accuracy was 31.3% with evidence accumulated across repetitions, about three times that of held-out majority voting. These analyses indicate that Flex captured a detectable, if still weak, P300 under the studied conditions, while broader participant-level validation and improved decoding remain necessary.
Read the full abstract
Information Retrieval
Guaranteeing Faithful Evidence Extraction in Speculative Retrieval-Augmented Generation
Large Language Models (LLMs) are increasingly used as interfaces for information retrieval, but they remain prone to hallucinations and faithfulness errors, in which the generated answers diverge from the retrieved evidence. While Retrieval-Augmented Generation (RAG) and recent hybrid or semi-extractive approaches mitigate this issue, they do not guarantee that quoted or extracted spans are verbatim from the retrieved context. This limitation can have severe consequences in safety-critical domains, where answers must exactly match certified documentation. We introduce Constrained Hybrid Decoding (CHyD), a novel faithfulness-first paradigm for speculative RAG. While traditional speculative decoding is optimized for inference speed, CHyD repurposes this architecture to ensure faithful verbatim evidence extraction when the extraction mode is correctly triggered. Our approach enforces hard decoding constraints that restrict generation to continuous spans present in the retrieved documents. This design provides a robust but straightforward guarantee: any explicitly quoted span in the output appears verbatim in the provided context. We evaluate our method across state-of-the-art LLMs on diverse abstractive, extractive, and semi-extractive QA benchmarks, including technical datasets motivated by aircraft maintenance. Results show that existing hybrid methods frequently hallucinate quoted spans, with exact extraction accuracy dropping below 40% in technical domains. In contrast, our approach achieves near-perfect extraction faithfulness regardless of the model used. Although enforcing hard constraints introduces a trade-off with fluency-oriented metrics, our method improves exact answer correctness and remains competitive overall, highlighting its suitability for safety-critical information retrieval applications.
Read the full abstract
Quantum Gases
A machine-learned dynamical phase diagram of the one-dimensional nonlinear Schrödinger equation with quasiperiodic disorder and a static field
We map the transport regimes of a wave packet evolving under the one-dimensional discrete nonlinear Schrödinger (Gross-Pitaevskii) equation with a quasiperiodic Aubry-André potential and a static (Stark) field, as a function of self-interaction $g$, field $F$, and quasiperiodic strength $\lambda$, for two initial states (delta and Gaussian). Instead of one expensive long-time simulation per grid point, we run 3600 short simulations, reduce each to eight dynamical features, and cluster parameter space with a Gaussian mixture model. Clustering finds the boundaries between regimes unsupervised; each cluster's name is then assigned by a hand-calibrated rule, and an ablation shows clustering measurably smooths those boundaries rather than merely relabeling them. The five resulting regimes (ballistic, localized, oscillatory-localized, subdiffusive, and self-trapped) are validated against 100 long runs on a lattice eight times larger than the short sweep, so the validation window is longer than the training window even for the fastest-spreading regime. The short-time clusters predict the long-time asymptotic spreading exponent ($\alpha_\infty = 2.01\pm0.07$ ballistic, $0.28\pm0.16$ subdiffusive, consistent with the weak-chaos prediction $\alpha=1/3$) and, independently, a long-time retention $\Pi_0=0.72\pm0.32$ for the self-trapped cluster, whose exponent alone is not diagnostic. The initial-state contrast is striking: the delta state develops a broad self-trapping wedge (onset at $g=3.907\pm0.017$ at $\lambda=0$) that invades the ballistic and localized regions as $g$ grows, while the Gaussian state shows no self-trapping, instead opening a subdiffusive corridor along the Aubry-André critical line that widens with $g$. The scheme yields a full $15\times15$ phase map in minutes per slice, where direct asymptotic simulation ($t\gtrsim10^6$ per point) is prohibitive.
Read the full abstract
Distributed Computing
Introvert Clustering for Distributed Graph Algorithms
We introduce a graph decomposition primitive called introvert clustering, which strengthens standard low-diameter clustering by guaranteeing that every clustered vertex keeps at least a $\left(\frac12-\varepsilon\right)$-fraction of its relevant neighbors in its own cluster. Repeatedly applying this primitive yields a layered introvert network decomposition with $O(\log n)$ layers and weak diameter $O(\log n)$. We give two applications in the $\mathsf{LOCAL}$ model. For every constant $\varepsilon>0$, we obtain a $\widetilde O(\log^2 n)$-round deterministic algorithm for list $\left(\frac32+\varepsilon\right)\Delta$-edge coloring on graphs of maximum degree $\Delta\geq\Delta_0(\varepsilon)$; for bipartite graphs, the result holds for all $\Delta$. For every constant $0<\varepsilon<1/4$, we also obtain a $\widetilde O(\log^2 n)$-round deterministic algorithm for a $\left(\frac14-\varepsilon\right)$-locally balanced cut, where every vertex has at least a $\left(\frac14-\varepsilon\right)$-fraction of its neighbors on the opposite side. The resulting algorithms are remarkably simple: edge coloring processes the layers in reverse order and colors each cluster, while locally balanced cut processes them forward and computes a locally maximum cut within each cluster. The introvert guarantee enables these procedures beyond the usual greedy regime of network decomposition. We construct the decomposition in $O(\log^2 n)$ randomized rounds using Miller–Peng–Xu low-diameter clustering and a simple trimming procedure, and deterministically in $\widetilde O(\log^2 n)$ rounds via a white-box adaptation of the recursive network decomposition algorithm of Ghaffari and Grunau [FOCS 2024].
Read the full abstract
Quantum Physics
Quantum computational resources and validation protocols for a three-mode non-Gaussian trilinear Hamiltonian
Non-Gaussian interactions are a key ingredient for achieving universality in continuous-variable quantum computation, yet their experimental characterization and the validation of their correct implementation remain challenging tasks. In this work, we focus on a three-mode non-Gaussian trilinear Hamiltonian that has recently been realized in superconducting microwave platforms, and present a comprehensive theoretical analysis of the computational resources it generates, together with experimentally accessible protocols to validate their presence. We systematically investigate its ability to generate two key resources for quantum computation: multipartite entanglement and Wigner negativity. In particular, using displaced-parity Bell tests, we demonstrate the generation of nonlocal states and thereby provide an operational certification of multipartite entanglement in the non-Gaussian states produced by the dynamics. We further quantify the Wigner logarithmic negativity and benchmark it against that of established non-Gaussian resource states. Building on this resource-based characterization, we introduce a measurement-efficient protocol for the experimental validation of the Hamiltonian implementation without requiring full reconstruction of the Wigner function. The protocol combines the measurement of zero-variance observables (nullifiers and stabilizers) with a limited number of targeted phase-space measurements, leading to a drastic reduction of the experimental overhead.
Read the full abstract
Instrumentation and Methods for Astrophysics
Modelling Fourier filtering wavefront sensors for PSD-based methods: the AOPERA tool
Compensation of the atmospheric turbulence thanks to adaptive optics (AO) has now become commonly used for VLT or ELT class telescopes in order to retrieve a resolution close to their diffraction limit. Following the increasing trend of AO system, there is also a stronger necessity for simulations in order to understand and predict their performance facing different observing conditions, that are the evolution of the atmospheric turbulence or the diversity of AO guide source. The so-called PSD based methods are well adapted to the demand thanks to their simplicity and speed. Moreover, they provide a comprehensive breakdown error budget and impact on focal plane, that is of high interest especially in the case of extreme adaptive optics. Their drawback is the challenge to describe non-linear wavefront sensors (WFS) such as the pyramid WFS or the Zernike WFS. There is a necessity to develop fast yet accurate methods to describe the behaviour of AO systems including sensitive WFS. We thus develop a method to compute the AO system response (electromagnetic phase power spectral density, and point spread function) including the non-linear behaviour of the wavefront sensor within PSD-based numerical tools. Mathematical formalism to describe the FF-WFS sensitivity combined to non-linearity management greatly improve the accuracy of description of AO systems through numerical simulations. After a mathematical description of the method, its numerical implementation is compared with end-to-end simulations using the OOPAO tool. Indeed end-to-end simulations are reproducing the response of AO systems with high fidelity, especially regarding WFS sensitivity and non-linearity. Similarity of results for the fitting error, temporal error and noise error proves the validity of our method in managing Fourier filtering WFS sensitivity and non-linearity.
Read the full abstract
High Energy Astrophysical Phenomena
Evidence of a Low-Energy Cutoff in the Injected Spectrum of a Pulsar Wind Nebula
Bow-shock pulsar wind nebulae (PWNe) are synchrotron sources formed when the outflow of supersonic pulsars is confined by the surrounding interstellar medium. These sources are dominated by freshly injected particles, thus providing a unique laboratory for studying particle acceleration in relativistic outflows. The Mouse is a prototypical bow-shock PWN and is bright in the radio and X-ray bands, enabling detailed multi-wavelength spectral modeling. With data from 17 telescopes, the Mouse is detected from 118 MHz to 353 GHz, covering over 3 decades in frequency, and in X-rays from 0.5 to 30 keV. A clear spectral break is identified at 3.7 GHz. The radio spectrum exhibits a rising trend at low frequency, peaks at the break, and then declines. We find a change in spectral index $\Delta\alpha=0.65\pm0.05$ across the break. We attribute this to an intrinsic cutoff or steepening in the injected particle distribution. This could indicate the characteristic energy of leptons leaving the pulsar magnetosphere, or energy dissipation after the particles cross the termination shock.
Read the full abstract
Probability
A central limit theorem for Bessel and Dunkl processes with drift
For some discrete parameters, multivariate (Dunkl-)Bessel processes on Weyl chambers $C$ are projections of Brownian motions on Euclidean spaces $V$; the most prominent examples are Dyson Brownian motions. More generally, the projections of Brownian motions on $V$ with drift are Bessel processes with drifts on $C$, where again the associated transition densities can be described in terms of multivariate Bessel functions. Moreover, Dunkl processes with drift can be defined in an analogous way. In this paper we prove central limit theorems for these Bessel and Dunkl processes with drift for regular drift vectors, and arbitrary root systems and multiplicities. These results improve recent results of the author.
Read the full abstract
Information Theory
On the Evolution of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel
We consider an additive white Gaussian noise channel subject to a peak-amplitude constraint and study how the support of the capacity-achieving input distribution (CAID) evolves as the amplitude constraint $A$ varies. Although the CAID is known to be unique, symmetric, discrete, and finitely supported, the structure of its support transitions has remained largely unresolved. We show that the origin is the only possible degenerate support point and the only possible inactive contact point of the KKT function. We then establish continuity properties of the optimal distribution and the KKT function and prove that every nonzero support point is locally stable: under small changes in $A$, it persists as a unique nearby atom whose location and probability mass vary continuously. Combining these results, we prove that, locally, the support cardinality at a nearby amplitude is either unchanged or larger by one and that any such increase can occur only at the origin. Consequently, all local changes in support cardinality are confined to the origin: locally, the only possible transition mechanisms are the appearance or disappearance of the point at the origin and the splitting or merging of the origin into a symmetric pair.
Read the full abstract
Statistics Theory
Parametric bootstrap simultaneous confidence interval based on doubly type-II censoring
Parametric bootstrap and fiducial generalized methods are proposed to construct simultaneous confidence intervals (SCIs) for all pairwise mean differences of several two-parameter exponential distributions, based on doubly censored samples. Both methods have been shown to have correct asymptotic coverage probabilities. Simulation studies are conducted to compare the performance of the two proposed methods. The usefulness of our proposed procedure is illustrated with two examples.
Read the full abstract
Quantum Physics
Semi-device-independent quantum randomness certification in semiconductor spin-noise measurements
Complex solid-state systems are promising platforms for scalable, high-bandwidth quantum random-number generation, yet certifying the quantum origin of their fluctuations remains difficult because the underlying microscopic dynamics are hard to model and validate. Here we demonstrate semi-device-independent quantum randomness certification from semiconductor spin noise, to our knowledge the first such certificate on any spin-noise source, without relying on a microscopic model of the spin system. The untrusted optical source is constrained by an experimentally tested mean-photon-number bound together with a declared analogue-range and per-sample clipping ceiling, while the trusted receiver is described as a calibrated, noisy, coarse-grained homodyne measurement. Using a semidefinite programme with rigorously controlled Fock-space truncation, we certify randomness that remains private against an adversary holding arbitrary quantum side information. Offline analysis yields certified entropy rates of $3.2$–$3.4$\,Gbit/s from a singly charged (In,Ga)As quantum-dot ensemble and $33$\,Mbit/s from $n$-GaAs in a spin-noise-matched detection mode. This exceeds the certified entropy rate of earlier spin-noise generators by more than two orders of magnitude, and the certificate tolerates a resolved per-symbol energy contribution from the solid-state emitter itself rather than requiring a near-vacuum input.
Read the full abstract
Artificial Intelligence
Belief-State Engine: Augmenting LLMs for Principled Planning Under Partial Observability
Large language model agents produce fluent action sequences across a wide range of tasks, yet they fail in characteristic ways once the environment becomes partially observable. Ambiguous feedback pushes them into premature commitments. A single informative observation can collapse their uncertainty onto the wrong hypothesis. Policies drift as the history grows. We trace these symptoms to a common structural cause. An LLM agent, as commonly deployed, is a history-conditioned policy with no explicit belief over hidden state. We propose an architectural fix. The Belief-State Engine (BSE) is an inference module placed outside the LLM. It maintains a Bayesian posterior over the latent states of a given POMDP (Partially Observable Markov Decision Process) model, and at each decision step it exposes only that posterior to the LLM. The raw action-observation log is not shown. We set out a minimal four-axiom specification of what a belief-consistent internal state must satisfy, and prove that the LLM paired with the BSE is a sound Markov policy on the belief MDP induced by the underlying POMDP. It therefore inherits the Bellman optimality guarantees of classical POMDP theory, provided the LLM is never exposed to the raw history. We evaluate the architecture on the Tiger POMDP and a red-team attack-graph task, against six baselines: a reactive LLM, Chain-of-Thought, ReAct, a natural-language belief tracker, QMDP, and POMCP. Across both domains, the BSE-augmented agent improves task return, belief calibration, and decision consistency. Ten targeted ablations isolate the contribution of each architectural choice confirms that the effect is not specific to any one model. Code, environment specifications, prompt templates, and seed logs accompany this paper.
Read the full abstract
Earth and Planetary Astrophysics
Magnetically Driven Obliquity in Circumplanetary Disks and Twisted Bipolar-jet Formation
Circumplanetary disks (CPDs) regulate gas accretion onto forming giant planets and provide the environment in which their satellites may form. We use high-resolution, global three-dimensional simulations to investigate the early formation, orientation, and outflows of a CPD around a Jupiter-mass planet embedded in a turbulent magnetized protoplanetary disk. Within a locally isothermal, ideal-MHD framework, we evolve disks threaded by net vertical magnetic fields, corresponding to initial plasma parameters $875\leq\beta\leq3500$, until magnetorotational-instability-driven turbulence is established before inserting the planet. We also perform a hydrodynamic control simulation. In the most strongly magnetized model, with $\beta=875$, the CPD forms already highly inclined and reaches a maximum tilt of approximately $87^\circ$. By contrast, the hydrodynamic CPD and the MHD models with $\beta\gtrsim1000$ remain nearly coplanar. A control simulation in which the planet is inserted before global MRI turbulence develops also remains coplanar, despite producing local turbulence and bipolar outflows. The large tilt is therefore associated with the pre-existing global turbulent state and its evolved velocity and toroidal magnetic-field structure, although our current diagnostics do not distinguish between a direct magnetic torque and the accretion of misaligned angular momentum. All MHD models launch bipolar outflows; in the highly tilted case, these develop a curved, helical morphology that persists until the end of our short-term simulations. These results identify pre-existing global magnetized turbulence as a viable route to generating strongly inclined CPDs and twisted planetary outflows.