Systems and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 31 August
Control Barrier Functions (CBFs), their High-Order variants (HOCBFs) and Exponential CBFs (ECBFs) are standard geometric tools for enforcing nonlinear safety constraints. CBFs, and their variants, offer an elegant geometric framework for nonlinear safety, yet mathematically, they reduce to continuous-time convolutions restricted by zero-memory kernels. In the presence of high-frequency measurement noise, these memoryless operators act as improper filters, leading to significant control chattering and the potential loss of active control authority due to Quadratic Program (QP) infeasibility. To address this structural limitation, this paper introduces a space-time transform that embeds dynamic temporal filtering directly into the safety constraint synthesis. By designing a proper spatio-temporal kernel, this approach inherently attenuates high-frequency noise while preserving affine control authority. Crucially, we prove the robust forward invariance of the designed STT-CBF. Monte Carlo simulations of a third-order system demonstrate that the proposed framework achieves a 100% safety rate while reducing control total variation by over 99% compared to conventional parameterized barrier methods, mitigating hardware hazards and enabling reliable deployment on physical robotic platforms.
Machine Learning
RW-LoRA: Communication-Efficient Decentralized LoRA Fine-Tuning via Random Walks
Parameter-efficient fine-tuning methods such as LoRA have become a standard approach for adapting large foundation models. Adopting fine-tuning to distributed settings faces several challenges. Most existing distributed LoRA methods rely on centralized aggregation, and gossip-based decentralized LoRA requires repeated synchronization among multiple model copies. Both methods incur significant communication overhead and introduce errors due to simultaneous aggregation of multiple model updates. In this paper, we take a different perspective and propose a random-walk-based LoRA fine-tuning scheme. Instead of maintaining multiple model replicas, a single model token traverses the network and is updated sequentially using local fine-tuning objectives. This design eliminates the need for global synchronization, substantially reduces communication and computation costs, and avoids aggregation errors. We provide rigorous convergence guarantees for non-convex objectives under standard assumptions. Through empirical results on multiple NLP tasks and graph topologies, we show that the proposed method achieves competitive task performance with substantially less communication and computation than gossip-based LoRA.
Read the full abstract
Computation and Language
Beneath the Diff: Diagnosing and Mitigating Algorithmic Mode Collapse in Code-Level Autonomous Research Loops
Code-level autonomous research loops (ARLs) have recently emerged as a concrete object of study in automated machine learning research. In such loops, an LLM agent proposes modifications to an experimental training pipeline, executes the modified pipeline, and retains edits that improve a verifiable in-loop metric. Although executable metrics may appear to provide a reliable signal of progress, it remains unclear whether repeated metric-driven code editing leads to genuine improvements that generalize beyond the loop. We provide a systematic diagnosis of this question. Across various experiment settings, we identify a robust failure mode that we call algorithmic mode collapse. In this regime, surface-level edit diversity remains stable, but semantic and mechanism-level diversity collapse: the agent continues to edit different lines of code while repeatedly proposing the same kinds of algorithmic changes. This collapse is accompanied by a widening gap between in-loop metric gains and gains measured on independent held-out evaluations. We then propose Diversity-Aware Proposal Sampling (DAPS), a lightweight mitigation that combines category-coverage reweighting, persistent edit memory, and a validation gate. Under a three-tier protocol separating the in-loop metric, the audit metric read by the gate, and a blind metric no loop component ever accesses, DAPS reduces semantic-cluster decay of edits by $69.1\%$ and improves relative faithfulness by $83.7\%$ blind and $81.6\%$ audited, while preserving in-loop optimization speed. We provide the code in Github \href{https://github.com/BokwaiHo/arl-mode-collapse}{repository}.
Read the full abstract
Artificial Intelligence
AI Morbidity and Mortality: A Framework for Clinical AI Failure Review
Clinical artificial intelligence is increasingly embedded in real-world care, yet existing safety mechanisms are poorly suited to reconstructing and learning from individual AI-related errors and near-misses. Aggregate model monitoring can identify performance changes, and traditional patient safety reporting can capture adverse events, but neither is designed to explain how risk emerges across the interaction among AI systems, clinicians, workflows, and institutional controls. We propose AI Morbidity and Mortality (AI M&M), a structured, blameless framework for case-based review of clinical AI failures. The framework combines standardized case intake, evidence preservation and investigator-level reconstruction, tool-in-loop attribution, and corrective-action tracking. Each event is classified across four linked dimensions: Trigger - Mechanism - Clinical Pathway - Corrective Action, separating the condition that exposed a vulnerability from the process that produced risk, its consequence for care, and the remediation assigned. We demonstrate the framework using five illustrative outpatient medication and clinical decision-support cases; two clinician reviewers independently applied all four classification axes and reached agreement across all 20 axis-level classifications. AI M&M is intended to complement, rather than replace, model monitoring, patient safety reporting, and regulatory oversight by converting individual AI-in-workflow failures into actionable institutional learning. Prospective evaluation across institutions, AI systems, and clinical settings is needed.
Read the full abstract
History and Philosophy of Physics
Foreknowledge and Free Will Revisited
The apparent incompatibility between foreknowledge and free will is traditionally formulated in terms of the implication of knowledge of a future event for the freedom of that event. This paper reexamines the problem using the notions of causal order and physical determination provided by modern physics. I consider measurements of two entangled particles at spacelike-separated events, where a measurement outcome is taken to be free if it is not determined by the previous history of the part of the universe accessible to it. Relativity allows the temporal order of the two measurements to be reversed between reference frames while preserving their causal independence. Quantum correlations nevertheless allow an observer at one measurement event to know the outcome at the other. I show that there is, therefore, a frame in which an observer possesses foreknowledge of a measurement outcome that remains free in this sense. The argument demonstrates that epistemic access to a future event need not be grounded in physical conditions that determine it.
Read the full abstract
Combinatorics
Double basic hypergeometric sums via a regularized Jackson $q$-integral
Using the Andrews–Askey integral, we derive a holomorphic extension formula for a Jackson $q$-integral. This formula allows identities established for terminating specializations to be continued to the nonterminating case. Our first application yields two companion binomial-type double-sum formulas. The second formula contains, as special cases, the nonterminating Sears–Carlitz transformation of Gasper and Rahman and Rahman's generating function for the Askey–Wilson polynomials. Applying the same method to the $q$-Chu–Vandermonde and Rogers' ${}_6\phi_5$ summations, we obtain two further integral representations for double sums of basic hypergeometric type. A balanced ${}_4\phi_3$ specialization of the latter identity is equivalent, via Sears' transformation, to the double-series transformation of Ismail, Rahman, and Suslov.
Read the full abstract
Artificial Intelligence
MiNER: Fine-Tuned Biomedical Natural Language Processing for Malaria Disease Entity Recognition in Clinical Texts
Malaria remains a significant global health burden, necessitating continuous research efforts to understand its complex molecular mechanisms, epidemiology, and potential therapeutic interventions. Extracting essential biomedical information from the vast and constantly growing malaria literature is a challenging task that demands innovative approaches. Recently, pre-trained language models have revolutionized natural language processing tasks, demonstrating remarkable capabilities in various domains. This paper proposes a fine-tuned pre-trained biomedical language model for biomedical information extraction from scientific literature on malaria disease. The proposed methodology selects and preprocesses a large corpus of scientific articles on malaria, and then annotates them with entities of clinical significance. It then leverages BioBERT, a state-of-the-art pre-trained language model, to encode the textual data into context-aware representations. We fine-tune the model using domain-specific annotations and supervised learning to enhance its ability to extract relevant biomedical named entities. Extensive experiments and comparisons with different encoding and machine learning algorithms show that the proposed approach significantly outperforms them in precision, recall, and accuracy. We also publish our human-labeled dataset for entity and relation extraction to enable other health informatics researchers to train advanced models for malaria information extraction.
Read the full abstract
Software Engineering
Can MCP Clients Decide What to Do After Failure? A Result-Only Actionability Audit
A client that receives isError:true knows that something went wrong. It may still have no machine-readable basis for deciding whether to fix an argument, authenticate, wait, choose another tool, or stop. This paper studies what deterministic software can learn from a completed MCP failure result alone; request arguments, schemas, discovery history, authen- tication state, transport metadata, host policy, and ap- plication state are outside that boundary. We introduce a six-part actionability profile and apply it with record- level evidence. In a small illustrative study of 21 safely induced failures from ten reachable sampled servers, typed fields expose failure in 18 cases and a broad policy in 8, yet expose no specific cause, target, executable repair, or replay constraint. Prose often carries more cause and target information, at the price of making semantic interpretation part of the recovery path. A lexical source audit finds the same text-centered pat- tern. Finally, a fail-closed prototype demonstrates how a separate experimental control plane could support deterministic branching. The result is deliberately nar- rower than an ecosystem survey or an agent benchmark: completed MCP results often make failure observable, sometimes make a broad response possible, and rarely make concrete recovery or safe replay self-contained in this sample.
Read the full abstract
High Energy Physics (Phenomenology)
Quantum Simulation of Markovian and Non-Markovian Open Quantum Dynamics in Heavy-Ion Collisions
We present a quantum computing framework for simulating open-quantum-system approaches based on Markovian and non-Markovian dynamics, which is relevant to heavy-ion collisions. To simulate the non-Markovian evolution on quantum computers, we introduce an auxiliary two-level pseudomode that carries the memory forward and couples to both the subsystem and the residual Markovian bath. We explicitly show that tracing out the pseudomode reproduces the non-Markovian evolution with the exact memory kernel. Moreover, in the relevant time scale hierarchy, the quantum circuit construction of the pseudomode smoothly converges to the Markovian limit. For a given bath memory kernel, our results demonstrate the feasibility of quantum simulations of both Markovian and non-Markovian dynamics, establishing a framework for future studies of hard probes such as jets, heavy quarks, and quarkonia in heavy-ion collisions.
Read the full abstract
High Energy Physics (Theory)
Superfluid memory effect
We identify a memory effect produced by phonon scattering in a superfluid: a localized scattering event generates a far-field pressure pulse with vanishing time integral but a nonzero first temporal moment, corresponding to a permanent shift in a prepotential for the far-field velocity. The effect is controlled by the soft factor for phonon emission, including corrections from nonlinear dispersion. In superfluid $^4$He, scattering macroscopic phonon wave packets produces a signal whose estimated magnitude may lie within experimental reach, thereby providing a laboratory analogue of electromagnetic and gravitational memory.
Read the full abstract
Analysis of PDEs
Finite-energy spacetimes with torus symmetry. Cauchy stability of Einstein-Euler and Einstein-Navier-Stokes areal flows
We establish finite-energy Cauchy stability for vacuum and matter spacetimes with $T^2$ symmetry on $T^3$, under general constitutive equations satisfying hyperbolicity and mild asymptotic conditions at vacuum and large mass-energy density. First, using the area of the symmetry orbits as a time function, we introduce the JKL formulation of Einstein areal flows}, a first-order evolution-constraint system coupling a wave-map structure for the geometry to hyperbolic matter balance laws and weighted transport equations for the twists and the momentum tangent to the symmetry orbits. Second, we also define two classes of hyperbolic Einstein-Navier-Stokes models, constructed from (as we call them) a Navier-Stokes potential and a relaxation rate map. The proposed particle-production model has divergence-free matter stress and non-negative particle-number production, while the proposed dissipated-energy model conserves particle number and dissipates fluid mass-energy, while an auxiliary stress restores the total stress-energy conservation required by the contracted Bianchi identity. For regular finite-energy (Einstein, Euler, Navier-Stokes) flows, we establish maximum and invariant-domain principles, geometric and energy monotonicity formulas, spacelike and timelike energy estimates, and total-variation estimates. Third, together, these estimates yield finite-energy Cauchy stability in the future expanding regime and, in the contracting regime, until the spacelike volume collapses. They are independent of the viscosity (or relaxation) mechanisms and cover vacuum, unbounded mass-energy density, and arbitrary finite rapidity. They also extend to weakly regular Einstein-Euler areal flows satisfying a reference mathematical entropy inequality.
Read the full abstract
Computation and Language
Context-Aware Interleaved Batching for WhisperX
While WhisperX accelerates speech transcription via intra-audio batching, it isolates audio segments, losing the historical context needed for coherent punctuation and terminology transcription. Conversely, standard Whisper retains context sequentially but suffers from slow inference and hallucination loops. To achieve the best of both worlds, we propose Context-Aware Interleaved Batching. By using VAD-derived segment boundaries, our algorithm stabilizes Whisper's text conditioning, allowing us to safely maintain continuous historical context across batched audio segments. As demonstrated on long-form audio benchmarks, this approach reduces Word Error Rate (WER) and improves proper noun transcription, all while maintaining high-throughput inference speeds.
Read the full abstract
Materials Science
Strain-Tunable Spin Relaxation in Germanium from First Principles
Germanium is a leading platform for semiconductor spin qubits and spintronics. Yet its electron and hole spin dynamics remain understood primarily through phenomenological models. Here, we predict electronic transport and spin relaxation in bulk Ge entirely from first principles, combining hybrid-functional band structures with fully relativistic electron-phonon ($e$-ph) interactions. Without empirical parameters, we predict carrier mobilities, velocity-field curves, and electron and hole spin relaxation times in close agreement with experiments over 100$-$400 K. By resolving spin-flip scattering by valley and phonon mode, we identify the microscopic mechanisms governing spin relaxation and show that spin and momentum relaxation, although both mediated by $e$-ph scattering, are controlled by distinct processes. We further show that compressive biaxial strain enhances the hole spin lifetime by up to two orders of magnitude at 5% strain, through strain-induced valence-band splitting and suppressed spin mixing. This mechanism is directly relevant to Ge-on-Si devices, where strain provides a practical route to engineering long-lived hole spins for quantum technologies.
Read the full abstract
Differential Geometry
The anisotropic Michael-Simon inequality for surfaces in every codimension
We prove a Michael-Simon inequality for $2$-varifolds in $\mathbb{R}^N$, in arbitrary codimension, for anisotropies sufficiently close to the area functional. Building on the ideas of Almgren and De Philippis-Pigati, we introduce a projection method for anisotropic stress measures yielding geometric inequalities that apply in arbitrary dimension and codimension.
Read the full abstract
Robotics
SUN: Agentic Robot Policy Learning with Persistent Task Programs
Model-based control can directly execute specified objectives, while learning can amortize such behaviors into reactive policies, making their combination a natural solution to multi-stage manipulation. We introduce Semantically UNified (SUN) Programs, typed executables that compile grounded relations into aligned optimal control objectives, satisfaction predicates, and learning rewards. Our harness, Kuafu, equips a foundation model as a task-level agent to orchestrate scene preparation, verification, residual RL, and data production. The agent uses program feedback to repair candidate programs and training diagnostics to calibrate relative reward weights, retaining accepted task semantics across tool calls. Across nine multi-stage manipulation tasks, Kuafu achieves 82.03% average success rate, significantly outperforming all learned baselines. Its learned controllers generate demonstrations at 10.57x the human-teleoperation rate, yielding data that improve visualpolicy success by 23.6 percentage points over the strongest baseline. The policies transfer zero-shot to physical Franka and Kinova robots, demonstrating sim-to-real generalization.
Read the full abstract
Machine Learning
Constant Individual Regret in General Games
Uncoupled no-regret dynamics provide a decentralized route to equilibrium, but prior guarantees for individual regret retain a polylogarithmic dependence on the horizon. We remove this dependence for every finite $N$-player normal-form game under full-information feedback. We introduce ECHO-OFTRL: optimistic follow-the-regularized-leader (OFTRL) equipped with an EMA cascade for high-order optimism (ECHO), where EMA denotes exponential moving average. The algorithm is deterministic and fully uncoupled. If $m_{\max}$ denotes the largest action-set size, then, simultaneously for every horizon $T\geq1$, it guarantees that each of the $N$ players in the game incurs regret upper bounded by $O(\textrm{poly}(N, \log m_{\max}))$. Our algorithm leverages a new form of optimism inspired by modern filter design.
Read the full abstract
Quantum Physics
Efficient search for excitable zero-modes in constrained systems
Kinetically constrained systems, such as those representing Rydberg atom arrays in the blockade regime, have gathered considerable attention due to the presence of atypical eigenstates in their spectrum. The latter manifests itself through the presence of quantum many-body scars as well as unusually large zero-mode (ZM) subspaces which contain analytically tractable eigenstates with various entanglement scalings. In particular, some of the latter are excitable zero-modes (EZMs), meaning that they can be promoted to a non-zero energy for open boundary conditions. In this work, I present an efficient protocol for finding analytical expressions for translation-invariant EZMs in constrained systems, based on the eigendecomposition of the local unconstrained Hamiltonian. I demonstrate the power of this method on a decorated Rydberg chain. In that model, my protocol directly produces a continuous matrix-product-state manifold located entirely in the zero-energy eigenspace for periodic boundary conditions. The span of that manifold grows exponentially with the system, and for odd system sizes it covers the entire zero-momentum eigenspace with zero energy. I then show how the physical structure of the manifold, which is tied to the local eigenbasis, also allows one to derive analytical expressions for ZMs at non-zero momentum and for a polynomial number of exact scars at $E=\pm\sqrt{3}$.
Read the full abstract
Differential Geometry
The anisotropic Michael-Simon inequality
We prove a Michael-Simon inequality for varifolds of every dimension and codimension with respect to anisotropic energies. In particular, this resolves the problem for every convex even hypersurface anisotropy and, using work of Allard, yields the regularity of hypersurfaces with bounded anisotropic mean curvature in every dimension. By the results of De Philippis and Pigati, it also implies density bounds and compactness properties for rectifiable varifolds with uniformly bounded anisotropic first variation. The proof relies on a projection method for anisotropic stress measures as well as the recent resolution of the vanishing mass conjecture by Gennaioli and Rindler.
Read the full abstract
General Relativity and Quantum Cosmology
Evolution of Cosmic String Loops under Gravitational Backreaction
Nambu-Goto cosmic string loops generically develop cusps, points where the string momentarily reaches the speed of light. These cusps produce strong gravitational wave bursts with a characteristic strain spectrum $\tilde{h}(\omega)\propto (G\mu)\,\omega^{-4/3}$, making them prime targets for gravitational wave searches, where $\mu$ is the string mass per unit length. However, this picture is modified when one accounts for gravitational backreaction. Using a convenient gauge, we reformulate the Nambu-Goto equations of motion for a loop moving in its own dynamically sourced gravitational field, enabling the first continuous numerical evolution of loops under this backreaction. A key finding is that locally cusps survive backreaction. Nevertheless, the gravitational waveform calculated in this formalism is significantly modified, weakening the cusp burst and introducing a high-frequency cutoff at $f_c\propto(G\mu)^{-3/2}$. This suppression above $f_c$ reduces the expected signal-to-noise ratio in current and near-future detectors relative to unperturbed waveform predictions.
Read the full abstract
Commutative Algebra
Trinomial containment in polynomial ideals is undecidable
We prove that deciding whether an ideal in a polynomial ring contains a trinomial is impossible on a Turing machine. More precisely, from an integer polynomial $P$ we compute generators of an ideal $I_P$ in a polynomial ring over $\mathbb{Q}$ such that $I_P$ contains a trinomial if and only if $P$ has an integral zero. By the MRDP theorem this problem is undecidable. A universal halting polynomial gives a computable family of ideals in one fixed polynomial ring, with uniform bounds on colength, generator count, and generator degree, for which the containment of a trinomial encodes the halting problem.
Read the full abstract
Instrumentation and Methods for Astrophysics
Agentic research is oxymoronic
The use of agentic large language models obviates human interpretation of scientific results, and will lead to substantial distrust in the literature.
Instrumentation and Methods for Astrophysics
Ad Astra White Paper: A Pitch for the Next 25 Years of NASA's Physics of the Cosmos Program
Astrophysical observations of our universe have been key to our understanding of how the universe works. Shortly after the turn of the millennium, the National Research Council delivered Connecting Quarks with the Cosmos: Eleven Science Questions for the New Century. In the subsequent quarter-century, we have made substantial progress in answering each question. These advancements have, in part, arisen because of the success of major US facilities across several domains of physics, guided by long-term planning documents which still largely focus on these questions. This report seeks to provide a status update on each question, and to outline what space-based facilities are crucial for future progress, intended to guide NASA's preparatory work for the Astro2030 Decadal.
Read the full abstract
Computer Vision
BRF-GS: Hyperspectral Bidirectional Reflectance Factor Modeling and Image Generation Based on 3D Gaussian Splatting
The bidirectional reflectance factor (BRF) characterizes the directional radiative properties of terrestrial surfaces. However, existing three-dimensional (3D) radiative transfer models require complex scene construction and computationally intensive radiative transfer solvers, limiting efficient generation of multi-angle hyperspectral reflectance imagery. 3D Gaussian Splatting (3DGS) offers an efficient framework for neural scene representation and novel view synthesis, but its low-order spherical harmonics representation is insufficient for complex directional reflectance, while the high dimensionality and inter-band quality differences of hyperspectral data introduce additional challenges. To address these challenges, we propose BRF-GS, a 3DGS-based framework for BRF modeling and hyperspectral reflectance image generation. BRF-GS introduces a hybrid BRDF-driven kernel to represent complex directional reflectance, selects geometry-reliable spectral bands for robust 3D scene initialization, and adopts a two-stage training strategy that decouples geometry optimization from spectral modeling. We further construct the AIR-BRF dataset, a multi-angle hyperspectral directional reflectance dataset comprising three scenes with diverse natural and artificial targets. Experiments demonstrate that BRF-GS achieves superior spatial and spectral fidelity and accurately reproduces characteristic view-dependent BRF responses. The proposed framework provides an efficient data-driven approach for BRF modeling and multi-angle hyperspectral reflectance image generation in remote sensing scenes.
Read the full abstract
Analysis of PDEs
Stationary kinetic Krylov-Safonov estimates in space dimension one
We prove interior Hölder regularity for solutions of the stationary kinetic Fokker-Planck equation in non-divergence form in space dimension one. The estimate is independent of any small-oscillation condition on the diffusion coefficient.
Machine Learning
Sharp Approximation Rates for Neural Networks with Affine Latent Parameterizations
Many parameter-efficient methods generate the parameters of a large neural network from a low-dimensional latent representation. Given an architecture $\Phi$ with $P_\Phi$ parameter slots, we write $\boldsymbol{\theta}_f=\mathcal{G}(\boldsymbol{\xi}_f)$, where $\mathcal{G}\colon\mathbb{R}^M\to\mathbb{R}^{P_\Phi}$ is a parameter generator and $\boldsymbol{\xi}_f\in\mathbb{R}^M$ is a latent representation of the target function $f$. The architecture $\Phi$ and the generator $\mathcal{G}$ are shared across the entire target class, while each target $f$ is represented by its own latent vector $\boldsymbol{\xi}_f$, with $\Phi_{\mathcal{G}(\boldsymbol{\xi}_f)}$ approximating $f$. This framework encompasses hypernetworks, low-dimensional parameterizations, parameter-efficient adaptation, and model compression. Understanding the tradeoff between the latent dimension $M$ and the network budget $P$ is therefore fundamental to characterizing the expressive efficiency of these methods. We study this tradeoff for affine generators and fully connected ReLU architectures. More precisely, optimizing jointly over architectures $\Phi$ satisfying $P_\Phi\leq P$ and affine generators $\mathcal{G}:\mathbb{R}^M\to \mathbb{R}^{P_\Phi}$, we prove that the optimal worst-case uniform approximation error over the unit ball of $\alpha$-Hölder functions on $[0,1]^d$, where $0<\alpha\leq1$, has the sharp order $ \bigl(P\min\{M,P\}\bigr)^{-\alpha/d}. $ In particular, our result shows that even a fixed-dimensional latent space suffices to achieve vanishing approximation error as the network budget increases.
Read the full abstract
Quantum Physics
Bosonic codes from compact phase spaces
We present the algebraic structure of bosonic quantum error-correcting codes on genus-two Riemann surfaces. We explicitly construct the code words as automorphic forms and analytically generate the full tower of code spaces at all weights. We prove a fundamental no-go theorem: for any genus greater than one, the stabilizer group is non-amenable, forcing a strictly positive spectral gap in the stabilizer Hamiltonian. Consequently, no normalizable quantum state can satisfy all stabilizer conditions. This sharply contrasts with standard Gottesman-Kitaev-Preskill (GKP) codes, where the amenability of the stabilizer group $\mathbb{Z}^2$ permits approximate code words with arbitrary precision.
Read the full abstract
Commutative Algebra
The symbolic and divisorial analytic spreads are finite
Let $R$ be a ring that is essentially of finite type over a field and $I\subseteq R$ be an ideal. In this article it is shown that the minimal number of generators of the symbolic powers $I^{(n)}$ is bounded above by a polynomial in $n$. Furthermore, if $R$ is assumed to be a domain and $\mathcal I=\{I_n\}_{n\ge 0}$ is an $\mathbb{R}$-divisorial filtration, then the minimal number of generators of the ideals $I_n$ is again bounded above by a polynomial in $n$.
Read the full abstract
Quantum Physics
Engineering multi-photon dissipation with a dc-voltage-biased Josephson junction
Multi-photon dissipation – a key resource for bosonic qubits – is usually realized by parametrically pumping a Josephson coupler at the cost of spurious nonlinear terms. Here we instead engineer it using a dc-voltage-biased SQUID, such that these parasitic terms average out. We activate the conversion of one, two, or four photons of a high-Q mode into a single photon of a lossy mode. We characterize the two-photon dissipation by Wigner tomography, establishing dc-biased junctions as a resource for reservoir engineering and a viable route to cat-qubit stabilization.
Read the full abstract
Instrumentation and Methods for Astrophysics
Slysh haloes: the waste heat of cold computing as a submillimetre technosignature
Searches for Dysonian waste heat have operated almost exclusively in the mid-infrared and are therefore sensitive primarily to technology radiating at 100-600K. We argue that mature, computation-dominated civilisations may instead dissipate much of their energy at far lower temperatures. The Landauer cost of irreversible computation scales linearly with temperature, while ambient temperatures at large circumstellar radii approach the 2.7K cosmic microwave background floor. Cold computation is therefore thermodynamically attractive and, because the required radiating area scales as T**-4, potentially conspicuous. These considerations predict a new object class, which we term the SLYSH HALO after the first advocate of cold Dysonian searches. A Slysh halo is a physically motivated partial Dyson swarm producing grey, line-free thermal emission from the cold outer regions of planetary systems. We show that such structures are energetically and materially plausible, and that M dwarfs provide especially favourable search targets. Archival far-infrared and submillimetre surveys of nearby stars (DEBRIS, DUNES and SONS) can in principle be reinterpreted to constrain cold circumstellar dissipation at approximately the 10**20 Watt level, several orders of magnitude below the waste-heat luminosities targeted by previous infrared searches. Additional opportunities are provided by archival observations from Planck and the JCMT, together with the reprocessing of interferometric data from facilities such as ALMA and NOEMA. We assemble six observational discriminants that separate engineered radiators from natural cold sources and outline a three-tier search programme. Even a null result would provide the first temperature-complete assessment of Dysonian technosignatures.
Read the full abstract
High Energy Physics (Theory)
Coarse-grained models for loop quantum gravity and their renormalization
We introduce a family of effective theories and use them to define a specific type of coarse-grained models for canonical loop quantum gravity. Each effective theory is characterized by two parameters and it consists mainly of a Hilbert space of coarse states and an effective Hamiltonian operator. The construction of the coarse Hilbert spaces relies on a systematic coarse-graining procedure for spin network states. The effective Hamiltonians are then obtained from an analysis of the interplay between this coarse-graining procedure and the action of various Hamiltonian operators defined in loop quantum gravity. Finally, we provide a prescription for implementing the Hamiltonian non-perturbative renormalization framework for the coarse-grained models, and we explicitly write down the renormalization flow equations. The aim of this work is to build an arena for studying the emergence of the continuum limit and the derivation of phenomenological models in the context of canonical loop quantum gravity.