Quantum Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 2 September
Teleportation performance is commonly characterized by the average teleportation fidelity, while its variation over input states provides additional information captured by the fidelity deviation. In controlled teleportation, the controller's measurement introduces an additional source of fidelity variation through its measurement outcomes. We investigate the fidelity deviation in controlled teleportation with three-qubit pure states. We derive a lower bound on the fidelity deviation and show that it is attainable together with the maximal average teleportation fidelity. Among the measurements attaining the maximal average fidelity, however, the fidelity deviation can vary depending on the controller's measurement. We further examine the effect of controller assistance by comparing controlled teleportation with direct teleportation using the reduced state. Unlike the maximal average fidelity, which cannot decrease with controller assistance, the minimal fidelity deviation is not necessarily reduced by controller assistance. In particular, for any W-class pure state, controller assistance cannot reduce the fidelity deviation. These results reveal contrasting effects of control on teleportation fidelity and its deviation in controlled teleportation.
Computer Vision
Morphology signal in whole slide image foundation models can automatically triage slides
Patient exams in the cancer diagnosis and staging process typically generate several whole slide images (WSIs). One of the initial steps in training models on WSI data is identifying one or a few slides containing tumor or other diagnostic biomarkers necessary for downstream prediction tasks such as estimating recurrence risk or progression-free survival. This step requires tedious manual curation by experienced pathologists. Many published datasets make the artificial assumption of 1 slide per patient. Alternatively, all slides per patient may be used for model training, which may dilute the signal from the few slides containing tumor or other relevant information. In this paper, we present a pipeline to overcome these challenges using publicly available WSI foundation models (FMs). Our evaluations show that ranking WSIs based on predictions from zero-shot classification using WSI FMs accurately identifies slides with the most tumor, indicating that WSI FMs contain sufficient morphology signal to automatically triage slides. We also present a formulation for ranked evaluation to benchmark FM performance in slide triage. We show, on multiple datasets, that tumor slides are identified in the top-2 ranked slides for patients with up to 43 slides.
Read the full abstract
High Energy Physics (Theory)
Pre-Strings Lectures on Holographic Correlators and Analytic Bootstrap
Over the past decade, the bootstrap strategy has transformed the computation of holographic correlators and revealed structures suggesting an emerging scattering amplitude program in AdS. These notes, which are an extended version of the five lectures delivered at the Pre-Strings 2026 School, give a pedagogical introduction and synthesis of these developments. We start with a quick reminder of the essentials of CFT and a brief review of AdS perturbation theory. We then demonstrate in detail the bootstrap strategy for computing holographic correlators in the canonical example 4d $\mathcal{N}=4$ super Yang-Mills theory, at the level of four-point functions and in the regime dual to classical Type IIB supergravity. Several extensions, including higher-point functions, quantum corrections and stringy corrections, are discussed at varying levels of detail. We also explain how the bootstrap strategy can be extended to holographic CFTs with conformal defects, covering a diverse array of different setups.
Read the full abstract
Artificial Intelligence
When Agents Implement Systems: A Case Study in Defects, Detection, and Evaluation Rigor
As LLM coding agents increasingly perform end-to-end engineering work, we lack empirical characterization of how they behave on systems-level requirements: schema design, async orchestration, configuration correctness, and retrieval-filtering trade-offs. We present a case study of one such agent implementing a multi-component data system against a detailed pre-existing specification. Storage technologies, schema, entity-resolution algorithm, and retrieval-filtering strategy were fixed in advance; the agent autonomy was in the implementation, in diagnosing and fixing defects it introduced, and in interaction-design choices left open. Over a single session, we catalog five such defects, categorized by constraint violated and detection method. We further evaluate, on the public HotpotQA benchmark, the one retrieval trade-off specified in that architecture: restricting candidates to a graph-identified entity set before ranking versus unfiltered search. We substitute the benchmark gold evidence labels for entity identification, since we lacked LLM access to run that stage, and report standard recall rather than the benchmark own accuracy metrics. Across retrieval budgets from 1 to 10 and 100 questions against a pooled corpus of 2994 paragraphs, filtered recall reaches its ceiling by a budget of 3, expected once candidates are restricted to the gold paragraphs themselves, while unfiltered search recovers all required evidence only 69 percent of the time even at a budget of 10, a gap that holds at every budget tested, with sign test p less than 0.0001. We close with a discussion of where the agent autonomy succeeded versus required correction, including one instance where a claimed performance fix was never re-measured on the regression that motivated it.
Read the full abstract
Probability
Instantaneous shrinking of supports for stochastic PDEs
We study instantaneous shrinking of supports for nonnegative solutions of the stochastic partial differential equation \[ \partial_t u=a(t,x)\,\partial_x^2 u + b(t,x)\,\partial_x u + c(t,x)\,u +\sigma(u)\,\xi(t,x), \qquad (t,x)\in(0,\infty)\times\mathbb R, \] where $\xi$ is space-time white noise, the coefficients $a$, $b$, $c$ may be random, and the noise coefficient $\sigma$ vanishes at the origin and is sublinear there. The model case is $\sigma(u)=u^\gamma$ with $\gamma\in(0,1)$. We show that, under a uniqueness-in-law assumption, if the initial datum has a sufficiently light spatial tail, then every nonnegative solution has compact support at every positive time, even though the initial support is not compact. The initial datum may also be a measure, such as a Dirac mass. When $\gamma\in(0,1/2]$, finite initial mass suffices; this covers the super-Brownian case $\gamma=1/2$. When $\gamma\in(1/2,1)$, we identify a polynomial moment condition on the initial state whose order diverges as $\gamma\uparrow1$, quantifying the trade-off between the strength of the noise near zero and the decay of the initial data required for instantaneous shrinking. As a step of independent interest, we establish weak existence of solutions started from measure-valued initial data for non-Lipschitz $\sigma$ and random operators. Our results provide a stochastic counterpart of the instantaneous shrinking phenomenon of Evans and Knerr for deterministic parabolic equations with strong absorption, in which the role of the absorption term is played entirely by the noise.
Read the full abstract
Databases
Dual-Metric Partitioning with Adaptive Kernel Execution for Efficient GCN Acceleration
Graph Convolutional Networks (GCNs) are widely used for large graph-structured data, including social, citation, and e-commerce networks, but their deployment is constrained by irregular memory access and severe GPU workload imbalance. These challenges arise in two dimensions: width imbalance from power-law degree distributions and depth imbalance from heterogeneous neighborhood connectivity.We present DualGCN, a GPU acceleration framework addressing both dimensions through dual-metric graph partitioning and adaptive kernel execution. DualGCN combines node degree, reflecting aggregation width, with neighborhood density estimated by anonymous random walks, capturing multihop connectivity and access depth. This hybrid workload metric enables connectivity-aware partitioning of large graphs into sparse and dense regions while reducing workload imbalance from linear to logarithmic complexity. DualGCN then selects partition-specific execution strategies: sparse partitions use warp-level parallelism and coalesced memory access, whereas dense partitions exploit instruction-level parallelism to hide latency and improve GPU utilization. Experiments on twelve real-world graph datasets show that DualGCN consistently accelerates GCN computation, achieving average speedups of 2.53x, 3.8x, and 2.13x over cuSPARSE, GNNAdvisor, and ACCEL, respectively. These results demonstrate that jointly optimizing graph partitioning and kernel execution provides an effective solution for processing large-scale graph and socialnetwork workloads.
Read the full abstract
Artificial Intelligence
Benchmarking Language Models for Statistical Problem Formulation
Large language models (LLMs) are increasingly used as assistants for statistical and data science work, yet existing evaluations largely assume the analysis target is already specified. In practice, users arrive with informal goals and heterogeneous data, leaving the model to decide what statistical task is implied and which data are relevant. We first formalize this upstream step as Statistical Problem Formulation and decompose it into two subtasks: (1) Statistical Problem Classification and (2) Variable Identification & Role Assignment. We then introduce StatFormBench, a benchmark built from five cross-domain statistics textbooks and a data science case library, covering diverse problem types, data representations, and scenario styles. It contains 1,013 samples spanning 20 coarse-grained and 85 fine-grained statistical problem categories. Across 14 open- and closed-source LLMs, the best zero-shot models reach only 72.0 fine-grained classification accuracy and 63.2 variable set overlap. No model performs consistently best across the two subtasks, while enhanced prompting strategies yield only limited or inconsistent gains. We release the benchmark data on Hugging Face at https://huggingface.co/datasets/THU-CongLab/StatFormBench and the evaluation code on GitHub at https://github.com/THU-CongLab/StatFormBench.
Read the full abstract
Human-Computer Interaction
Reconciling Kinesthetic Mismatches: A Somatic Alignment Mindset for Musical Body Transformation
Mastering musical performance requires precise multisensory coordination, yet learners encounter a kinesthetic mismatch, which is a discrepancy between the internal perception of an action and the actual physiological state of the body. While multisensory Body Transformation Experiences (BTE) provide tools to bridge this gap, existing designs often focus on external correction rather than internal alignment. To address this, we propose the Somatic Alignment Mindset (SAM), a conceptual lens that integrates Taoist philosophy to shift the focus of HCI design from prescriptive feedback toward holistic embodied unity. By positioning technology as a reflective medium, SAM operationalizes the principles of Adaptation, Assessment, and Awareness to reconcile somatic discrepancies and foster deep, self-aligned musical mastery.
Read the full abstract
High Energy Physics (Phenomenology)
Generalized Foldy-Wouthuysen approach for the derivation of non-relativistic effective field theories
Effective field theories (EFTs) are a powerful framework for performing high-precision calculations at reduced complexity compared to their fundamental counterparts. A particularly important class of EFTs arises in the non-relativistic (NR) regime. Their construction relies on a different realization of the underlying symmetries, since Lorentz invariance is no longer manifest in covariant form in the NR regime. This behavior imposes a link between certain matching coefficients, and therefore additional constraints, commonly referred to as hidden Lorentz invariance. These constraints are established in quantum field theories on inertial flat spacetime, such as NR quantum electrodynamics. However, deriving these constraints becomes considerably more involved for theories involving physics beyond the Standard Model or formulated in non-inertial spacetime backgrounds, where the hidden symmetry structure is less transparent. In this work, we present an approach to obtain the NR EFT by first constructing a relativistic EFT and then performing a generalized NR reduction based on an extended Foldy-Wouthuysen transformation. We illustrate this method by a quantum chromo-electrodynamics EFT for inertial flat spacetime, describing both electromagnetic and strong interactions, and show how it reduces to the established Lagrangian of NR quantum chromodynamics and electrodynamics. The hidden Lorentz invariance emerges as a direct consequence of the construction. This approach provides a route to obtain the NR limits of more complex theories, \eg Dirac fields in non-inertial spacetime or extensions involving physics beyond the Standard Model. As an example, we apply the method to add the coupling of a pseudoscalar axion field in a simplified model and derive its NR limit.
Read the full abstract
Information Theory
ISAC with Co-Prime Arrays: Virtual-Aperture Sensing and uplink downlink communications
Integrated sensing and communication (ISAC) enables simultaneous communication and environmental sensing in unmanned aerial vehicle (UAV) networks, but its performance is constrained by the physical antenna aperture and residual self-interference (SI) in full-duplex (FD) sensing. To address these issues, we propose a shared-aperture ISAC architecture in which a sparse co-prime array (CPA) is embedded in a uniform linear array (ULA) grid for FD sensing, while the remaining antenna positions support time-division duplexing (TDD) communication. We characterize the sensing performance through an order-wise Cramer-Rao bound (CRB) analysis, showing that the CPA achieves a stronger asymptotic sensing gain than the partitioned ULA benchmark in both single-target and nondegenerate multi-target scenarios. We further reveal a space-time sampling tradeoff under the same physical aperture. Based on the proposed architecture, we formulate a non-convex joint resource allocation problem that maximizes the weighted downlink-uplink sum rate by jointly designing the sensing transmit covariance, downlink precoder, and uplink receive beamformers under sensing accuracy, BS transmit-power, communication QoS, and residual SI constraints. An alternating-optimization-based algorithm is developed. Simulations demonstrate consistent performance gains over the considered baselines and confirm the complementary benefits of the CPA virtual aperture and sensing covariance optimization.
Read the full abstract
Instrumentation and Methods for Astrophysics
Scalability in Simulating a Large-Aperture, Fresnel Zone Plate Lens for a Conceptual Space Telescope
As ambitious space telescope concepts such as ultra-lightweight planar diffractive optical elements (DOEs) emerge, validating the performance remains a major computational challenge. Conventional Fourier propagation algorithms were observed to fail at meter-class apertures due to severe memory limits caused by rigid grid-sampling requirements, and the scaled-down proxy models used for reflector telescopes cannot be applied, since scaling compresses the outermost zones that govern resolution. We benchmarked five Fourier-based propagators against a common Fresnel diffraction integral and found that only those decoupling the focal-plane grid from the input aperture converge within a 1% error threshold. With these findings, we implemented an optimized, stripe-processed Chirp Z-Transform (CZT) framework, evaluating the focal spot strictly within a fixed region of interest to reduce peak memory usage. Applied to five full-aperture configurations from 1.0 m to 5.0 m at f/# = 5, the framework predicted spatial resolution and diffraction efficiency to within 0.001% and 0.16% of analytical references, with modulation transfer function results cross-checked by two analytical extraction methods, all within 6.4 GB of memory on a single consumer-grade GPU. This simulation study represents first steps toward quantifying the expected results of ambitious space telescope concepts and aids the mission development (or selection) phase. With a highly accurate, memory-efficient validation tool, the findings obtained will be used to guide the fabrication decisions of future hardware, optical testing, and physical deployment mechanisms of large-scale diffractive telescopes.
Read the full abstract
Cosmology and Nongalactic Astrophysics
Inflationary Magnetogenesis with $f(R,\phi)$ Coupling
Inflationary magnetogenesis provides a promising mechanism for generating primordial large-scale magnetic fields, but faces challenges such as the strong coupling problem and backreaction issues. In this paper, we extend the Ratra model by introducing a coupling between the electromagnetic field and the background geometry, parameterized as $K(R)I^2(\phi)$. Starting from a general action with $f^2(R,\phi)F_{\mu\nu}F^{\mu\nu}$, we adopt $f^2(R,\phi)=K(R)I^2(\phi)$ as a concrete realization. Rather than focusing on the slow-roll inflationary stage (which reduces to the standard Ratra scenario), we concentrate on the post-inflationary reheating epoch, where the broken-power-law evolution of the scale factor and coupling function across the inflation-to-reheating transition allows us to derive analytic expressions for the magnetic and electric energy density spectra. Three key theoretical constraints are imposed on the model parameter space: the strong coupling condition, the backreaction constraint, and the CMB isotropy requirement. We obtain predictions for the present-day magnetic field strength $B_0$ and coherence length $L_{c0}$ for various combinations of the inflationary energy scale $H_f$ and the reheating temperature $T_r$. By comparing with observational constraints from radio observations and Fermi-LAT gamma-ray data, we demonstrate that the inflationary energy scale $H_f$, the reheating temperature $T_r$, the parameter $\beta$, and the e-folding numbers $N_f$, $N_r$ must satisfy stringent joint constraints. This work provides a viable theoretical framework for inflationary magnetogenesis that simultaneously satisfies theoretical consistency conditions and current observational bounds, with the reheating-stage nonlinear MHD evolution serving as a crucial ingredient for producing observationally compatible magnetic fields.
Read the full abstract
Human-Computer Interaction
Knowing Is Not Enough: Information Retrievability as a Precondition to Effective LLM Oversight
Large language models (LLMs) are increasingly embedded in organizational work, yet their errors often pass human review. Prior research locates such failures in users' capability to review LLM output or their engagement in doing so. We develop an alternative, retrieval-based account of human oversight and posit that error detection is more effective when oversight-relevant information is accessible to users at the moment of review. Across two randomized lab-in-the-field experiments with 640 customer-facing employees, we show that self-generated explanations improve error detection and strengthen recall of verification-relevant reasoning, while cues that reactivate such reasoning help sustain detection under repeated LLM use. Theoretically, we identify information retrievability as a distinct precondition for effective oversight and specify generative encoding and cue-supported reactivation as mechanisms that build and sustain it. Practically, lightweight onboarding self-explanations and daily retrieval cues can make human oversight more resilient as LLM use becomes routine.
Read the full abstract
Distributed Computing
RT-HiSS: Ray Tracing Accelerated High Dimensional Vector Similarity Searches
Recent GPU generations include special-purpose ray tracing (RT) cores for graphics applications. While RT cores are primarily used for rendering, recent works show they can be leveraged for general-purpose tasks, including similarity searches. However, existing approaches do not support datasets exceeding three dimensions. In this work, we propose RT-HiSS, the first exact GPU RT-core-based similarity search algorithm for high-dimensional datasets. GPU similarity search often scales poorly for large datasets with substantial search distances. To address this, RT-HiSS uses RT cores for fast index construction and searches, followed by candidate refinement on CUDA cores. We introduce a two-pass approach to estimate an upper bound on result size, enabling efficient batching under GPU memory constraints with near-perfect load balancing. Additionally, we examine shared memory tiling and compressed result masks to improve GPU resource utilization. RT-HiSS yields speedups up to 8.37$\times$ over competitive state-of-the-art GPU algorithms across six real-world datasets.
Read the full abstract
Human-Computer Interaction
Exploring Breathing-Music Coupling: Using the Breathing Mirror for Somatic Reflection in Piano Performance
While breathing is essential to living and for sound production in some instruments, for pianists, it is often a hidden and automatic process, making it difficult to analyze or refine. A critical gap exists between data and awareness: while sensors record precise physical metrics, they fail to capture the performer's somatic experience. Conversely, the high cognitive load of performance makes it nearly impossible for musicians to recall their internal states with temporal precision. To address this, we present a system, Breathing Mirror, and associated methodology designed to externalize the pianist's internal somatic experience through three analytical lenses: a Baseline View (synchronized signals), a First-Person View (subjective recall), and an Interpersonal View (collaborative reflection). Through a four-week longitudinal study with a skilled amateur pianist (35 years of experience), we evaluated the system's effectiveness by recording respiratory data using textile-integrated strain sensor belts. The results show that the Breathing Mirror reveals some patterns of breathing-music coupling and identifies critical blind spots where objective data diverges from subjective perception. Furthermore, we propose four somatic themes regarding the link between breathing and musical elements, offering a foundation for future large-scale validation across a broader range of pianists. This work provides a new way to study body signals, transforming breathing from an internal biological function into an articulate expressive parameter.
Read the full abstract
Statistical Methodology
Testing for trends in online experiments
Time-varying treatment effects can be estimated with linear regression paired with jackknife confidence intervals. In experiments at a large online video platform, the test based on this estimator is not much less powerful than modern tests for monotonic trends. If you suspect trends in your online experiments, consider using this estimator.
Read the full abstract
Systems and Control
Dimension-Reduced ADP for Real-Time Microgrid Operation with Massive Air-Conditioning Loads under Multiple Uncertainties
This paper proposes a dimension-reduced approximate dynamic programming (ADP) method for real-time microgrid operation with massive air-conditioning loads under multiple uncertainties. The operation problem is formulated as a multi-stage Markov decision process, and a post-decision value function is introduced to characterize the impact of current decisions on future operating costs. To address the curse of dimensionality caused by massive air-conditioning loads, a consistency-based value function projection is developed to map the high-dimensional state space at each node into a tractable aggregated state space. Based on the reduced states, piecewise linear approximation is further employed for efficient value function training. Case studies on 33-bus and 123-bus systems show that the proposed method achieves near-optimal operation performance with low computational cost and good scalability under both deterministic and stochastic conditions.
Read the full abstract
Computation and Language
NS-Copilot: An LLM-Driven Agent System for Autonomous Neuroscience Analysis
AI is rapidly advancing neuroscience, yet many laboratories fail to fully unleash its potential due to significant interdisciplinary barriers. While pre-trained neural models for physiological data are progressing quickly, their heterogeneous architectures and modality-specific constraints hinder systematic integration, selection, and evaluation. Despite recent advances in large language model (LLM)-based agent systems for intelligent scientific applications, existing approaches often still lack the domain expertise required to effectively select and coordinate diverse neuroscience pre-trained models and handle unique data types in this domain. We present NS-Copilot, an LLM-driven multi-agent system for neuroscience analysis that autonomously supports end-to-end workflows for diverse professional tasks. It unifies domain-specific pre-trained models and supports key neuroscience modalities, including EEG and extracellular spike data, through a natural-language interface. Given raw data and a task description, NS-Copilot orchestrates agents with specialized roles for planning, adaptive control, code generation, and result synthesis, enabling analysis without dataset-specific heuristics. We evaluate NS-Copilot on neuroscience benchmarks spanning Alzheimer's disease, Parkinson's disease, and working memory spike decoding. Across 8 trials per task, the system consistently outperforms strong baselines on the primary metric, demonstrating the ability of NS-Copilot for effective and scalable neuroscience analysis. Our code is publicly available at https://github.com/FrankLiu1102/ns-copilot.
Read the full abstract
Quantum Physics
Maximal-velocity deficit under a finite-support constraint in a hard-wall half-line continuous-time quantum walk
Continuous-time quantum walks on a lattice spread ballistically and converge to a limiting distribution for the rescaled position. On the hard-wall half line the boundary reflects the walker but does not change the bulk dispersion, so the ballistic front remains set by the maximal group velocity. We ask how close one can get to this front when the initial state is constrained to occupy only the first $M$ sites. We show that optimizing the moment-generating function of the limiting-velocity distribution over this finite-support class reduces to the principal eigenvalue of an explicit $M\times M$ Hermitian matrix, which yields the optimal state by direct diagonalization. For large $M$, a near-front scaling limit produces a continuum description that controls the entire peak region. In particular, the maximal mean drift approaches the front with an inverse-square deficit in $M$ and a constant prefactor $\pi^2/4$. Numerical results verify both the finite-$M$ spectral formulation and the predicted scaling.
Read the full abstract
Strongly Correlated Electrons
Observation of g-wave altermagnetic multipole
Over the past few years, altermagnets have emerged as a new class of collinear magnets with broken time-reversal symmetry, offering novel opportunities for spintronics beyond conventional magnets. Rather than from net magnetization, as in ferromagnets, the unconventional time-reversal symmetry breaking of altermagnets originates from antiferroic magnetic dipoles locked to higher-order multipoles. Here we report the direct visualization of a $g$-wave altermagnetic multipole in the canonical altermagnet CrSb. Combining high-energy synchrotron X-ray diffraction with valence electron density (VED) analysis, we uncover a pronounced directional anisotropy of the VED distribution alternating between Cr sublattices. This evidences the antiferroic order of electric hexadecapoles predicted in $g$-wave altermagnets. Its coexistence with antiferroic magnetic dipoles induces ferroic magnetic multipoles, as probed by polarized neutron diffraction. We further identify a microscopic model of altermagnetism that directly relates the $g$-wave multipole and the $g$-wave spin splitting. Through direct observation and quantification of multipoles, this study provides a real-space fingerprint of altermagnetism and establishes a general probe of hidden multipole order in quantum materials.
Read the full abstract
Statistics Applications
Sequential Certification of Threshold Decisions in Rare-Event Risk Prediction
Rare clinical outcomes pose a difficulty deeper than ordinary class imbalance: a penalized logistic model can return finite, stable-looking coefficients before the data support a reliable threshold decision. We formulate the accrual question as decision-targeted sequential certification. On a prespecified finite monitoring schedule and target set, asymptotic prediction bands are adjusted for simultaneous coverage, and certification is assessed only among profiles that might be referred, so that a large low-risk majority cannot trigger an uninformative stop. Under the working rare-event logistic model and stated regularity conditions, each certified decision is asymptotically model-conditionally correct with probability at least \(1-\alpha\) over the schedule, and the effective information scales with the number of genuine events. Simulations and a US linked birth/infant-death application illustrate the gap between a model that is merely estimable and one whose decisions are certifiable: the whole-population rule stopped while more than half of referral-relevant profiles remained ambiguous, whereas the decision-targeted rule did not certify by the 300{,}000-birth horizon despite stable temporal validation. Regularization makes a rare-event model estimable but does not substitute for genuine rare-event information.
Read the full abstract
Machine Learning
A Unified Particle Filter LSTM for Data-Driven Process Simulation
Data-driven process simulation aims to generate realistic case trajectories from historical event logs without requiring an explicitly specified model of the underlying dynamics. Deep sequence models can capture complex temporal dependencies through next-activity probabilities and conditional time distributions. However, event logs provide only a partial view of the underlying process state, often recording activity completions without the corresponding service-start times. Consequently, the same observed process history may be consistent with multiple plausible latent process conditions, whereas standard recurrent models compress each process prefix into a single deterministic recurrent state. We propose a Unified Particle Filter LSTM (Unified PF-LSTM) that maintains and sequentially updates a weighted set of recurrent-state hypotheses. We summarize this particle belief using its weighted mean and learned features based on the moment-generating function. The resulting representation is used to predict a categorical distribution over the next activity and conditional quantiles of the current activity's sojourn time. The framework is trained end-to-end from event-log data and evaluated on three real-world emergency department datasets. The results show that the proposed framework consistently outperforms the considered data-driven baselines in reproducing routing, duration, and system-level behavior across all datasets, with particularly strong gains in settings where complex process dynamics are only partially reflected in the available event logs.
Read the full abstract
Quantum Physics
Localizing quantum information
The idea that information can be localized is pervasive in physics. In thermodynamics, entropy flows from one reservoir to another, and in quantum gravity, the entropy content of some spatial regions is bounded. In quantum information theory, information is transmitted from one place to another, and entanglement can provide an advantage when there are constraints on such transmission. Shannon entropy quantifies localizable information in the sense that marginalization defines an outer measure on the set of parts of a classical multipartite system. In contrast, von Neumann entropy does not quantify localizable information in this sense. However, a variant of von Neumann entropy, which originates in noncommutative geometry, does. We prove that this adjusted von Neumann entropy is the minimum quantum entropy that quantifies localizable information. We also prove that this is the unique quantum entropy that characterizes Bell states in terms of redundant information, directly generalizing the classical case. We work with finite-dimensional $C^*$-algebras throughout, modeling finite quantum systems that may have superselection sectors.
Read the full abstract
Algebraic Geometry
A logarithmic Bogomolov–Sommese vanishing theorem on compact Kähler manifolds
In this paper, we establish a logarithmic Bogomolov–Sommese vanishing theorem in terms of numerical dimension for pseudo-effective line bundles on compact Kähler manifolds. As an application, we obtain a rigidity result with vanishing second Chern class for logarithmic cotangent bundles by combining the vanishing theorem with a structure theorem of Iwai and Matsumura.
Read the full abstract
Analysis of PDEs
The critical exponent for the two-dimensional semilinear wave equation with strong damping
In this manuscript, we determine the critical exponent for the two-dimensional semilinear wave equation with strong damping. A recent result in D'Abbicco (arXiv, 2026) gives global in-time small data solutions for $p>\frac{10}{3}$, whereas we in the paper prove finite-time blow-up for $2<p\leqslant\frac{10}{3}$ under an averaged sign condition on the initial velocity. Together with the previously known blow-up result for $1<p\leqslant3$, the threshold for the power nonlinearity $|u|^p$ is \begin{align*} p=p_{\mathrm{crit}}=\frac{10}{3}. \end{align*} We prove positivity of the full two-dimensional velocity fundamental solution and construct a positive averaged kernel, which allows us to establish a nonlinear lower-bound iteration in a parabolic region.
Read the full abstract
Computer Vision
Aggregating Neighbor Embedding Projection and Rank-Based Manifold Learning for Image Retrieval
Content-based image retrieval (CBIR) has advanced significantly with deep learning, yet effectively ranking similar images remains challenging, particularly in high-dimensional feature spaces, where pairwise distances often fail to capture contextual relationships and the semantic gap between visual features and high-level concepts persists. Manifold learning and rank-based refinement methods have emerged as complementary strategies, respectively improving feature representations and exploiting contextual information embedded in ranked lists, such as neighborhood relationships among images. However, combining these projection-based and rank-based strategies to exploit their complementary properties remains a challenging research problem. To address this, we propose a framework that combines neighbor embedding projections with rank-based manifold learning through rank aggregation. Uniform Manifold Approximation and Projection (UMAP) generates alternative low-dimensional feature representations, and ranked lists obtained from UMAP projections and rank-based re-ranking methods are combined using the Borda Count aggregation strategy. Experiments were conducted on several public datasets using deep learning features extracted from ResNet152, Swin Transformer, and DINOv2 models. Results show that the proposed approach improves retrieval effectiveness in several scenarios, particularly when the baseline representation struggles to achieve high precision. The aggregation strategy also often improves the quality of top-ranked positions, leading to competitive Mean Average Precision (MAP) and Precision values across different datasets and feature extractors. These findings suggest that combining projection-based and rank-based manifold learning strategies through rank aggregation can provide complementary contextual information for image retrieval tasks.
Read the full abstract
Artificial Intelligence
Post-Training Ternarization of Qwen3-4B Capability, Effective Bit Budget, Storage Compression, and Deployment
Ultra-low-bit language models can reduce storage and memory bandwidth, but a nominal "1.58-bit" label does not fully describe the stored representation, retained capability, or runtime behavior. We study an end-to-end post-training conversion of Qwen, an instruction-tuned 4B-parameter model, using KOTMS rotation, E2M-ATQ ternarization, and GPTQ-style error compensation from TWLA. The experiment is weight-only: activations remain at 16-bit precision, so ILA-AMP is omitted. We evaluate effective bit accounting, task capability retention, perplexity, calibration sensitivity, checkpoint composition, and deployment behavior. The final conversion uses 1.641 effective bits per weight for quantized linear weights, with 81.62% of model parameters targeted. Across ten scored capability comparisons, accuracy falls from 64.5% to 54.7%. Degradation is uneven: BoolQ retains 84.6% chance-corrected teacher performance, while ARC-Challenge retains 43.8%. Perplexity rises from 13.639 to 18.748 on WikiText-2, 24.700 to 31.992 on PTB, and 19.831 to 28.966 on C4. A subsequent packing run preserves the ternary planes and scales, reducing reported model size from 8.29 GiB to 3.96 GiB with essentially unchanged perplexity. A separate third-party packing attempt was lossy and is excluded from the primary artifact claim. The packed artifact has not been benchmarked end-to-end for task accuracy or generation throughput. A preliminary Triton GEMV microbenchmark is 4.6x slower than FP16 cuBLAS on one tested shape. We therefore do not claim that compression alone yields faster inference.
Read the full abstract
Robotics
MACAW: Reliable And Efficient Surgical Debridement Using Monocular Adaptive Compact Attention Windows
Augmenting the dexterity of human surgeons has the potential to free them from tedious subtasks. We consider debridement (removal of diseased or dead tissue fragments), which is challenging due to imprecision in spatial perception and cable actuation. We develop an augmented dexterity system for surgical debridement that uses visual servoing to align the cable-driven gripper with the target position in the image plane, and then introduces a novel approach to depth control, MACAW: Monocular Adaptive Compact Attention Windows. Across 100 physical trials using the da Vinci Research Kit (dVRK) robot, camera-frame servoing reduced average gripper position offset from 37 to fewer than 5 pixels within 4 optimization steps, taking an average of only 0.39s. MACAW significantly outperforms procedural and learned VLA baselines, achieving a 93% success rate at 11 seconds per fragment, yielding a throughput of 304 fragments per hour. Extending MACAW to a bimanual debridement setup maintains a 92% success rate at an average of 7 seconds per fragment, increasing the throughput to 473 fragments per hour.
Read the full abstract
Medical Physics
Mesoscopic Light Localization and Inverse Participation Ratio Analysis of Tissue Structural Disorder for Optical Cancer Detection
We introduce a mesoscopic physics-based framework that transforms conventional transmission optical micrographs into quantitative maps of tissue structural heterogeneity using the Inverse Participation Ratio (IPR). For the first time, to our knowledge, IPR-based light-localization analysis is applied to cancer tissue imaging to quantify nano- to submicron-scale structural alterations through spatial fluctuations in tissue mass density or refractive index. Unlike conventional morphology-based assessment, this physics-driven approach provides objective structural biomarkers from label-free or routinely stained tissue images. The method establishes a scalable, reproducible platform for quantitative computational pathology and enhanced cancer diagnosis by integrating mesoscopic optical physics with standard optical microscopy.
Read the full abstract
Image and Video Processing
Data-Efficient Networks for Multi-Contrast MRI Reconstruction based on a Generalized Content/Style Prior
Multi-contrast MR scans contain redundant structural information that can be leveraged during reconstruction and potentially accelerate acquisition times. This idea has inspired end-to-end guided reconstruction models, leveraging one or more contrasts to guide the reconstruction of a different contrast. However, these models require large paired multi-contrast raw datasets for training, limiting their application in low-data regimes. In this work, we propose a modular framework, namely CoSMo-RecNet, for learning guided reconstruction models in the low-data regime. At its core is a reusable multi-contrast representation based on a content/style model, which can be learned from large-scale, publicly accessible, unpaired multi-contrast image datasets, without available k-space data. Using this frozen model as a multi-contrast prior and using a set of reference contrasts, the reconstruction problem reduces to a much simpler refinement problem that can be solved by a lightweight unrolled network and thus learned from small, task-specific reconstruction datasets. We demonstrate the efficacy of CoSMo-RecNet by evaluating it on the low-field 0.3 T M4Raw dataset, showing stable reconstruction quality on decreasing the raw training data budget. CoSMo-RecNet achieved higher reconstruction quality with 5 training subjects or lower compared to a parameter-count-matched MoDL trained on 100 subjects. On a data-limited and severely out-of-distribution ultra-low-field 47 mT Halbach scanner dataset, CoSMo-RecNet was superior to other viable strategies, including classical reconstruction, transfer learning, and zero-shot reconstruction.