arXiv preprints from January 1, 2026 through September 11, 2026 — 22:45:48 EST
To achieve large-scale fault-tolerant quantum computation, it may be easier to combine many small sets of qubits than to construct a single large set. For example via quantum error correction with block codes, or distributed quantum processors utilizing shared entanglement. In these regimes, the time or error budget of the overall...
Quasi-hydrodynamics describes systems with quasi-conserved degrees of freedom, namely observables that relax on timescales that are finite but parametrically longer than microscopic relaxation times. Examples include kinetic chemistry and linear viscoelasticity. Here, we develop a rigorous effective-field-theory framework for linear...
Part-aware 3D generation aims to create digital assets that are coherent as complete objects while exposing structural parts for editing, material assignment, animation, and reuse. Existing methods impose this structure outside the native generation loop: segmentation-based methods partition an already generated shape, while additive...
We report simulations of the dissolution and diffusion of Nb's surface oxide layer in vacuum. While this chemical doping process is important for the surface preparation of Nb superconducting radio frequency (SRF) cavities - common components of particle accelerators - quantitatively linking the resulting oxygen distributions to...
We build on the recent breakthrough of Faulhuber, Petersen, van Velthoven, and Voigtlaender that disproved the HRT conjecture with a Schwartz function and a $12$-point configuration. We give a human-readable treatment of their mechanism and find HRT counterexample functions with exponential (or faster) decay. By a result of Bownik and...
Sparse autoencoders (SAEs) are proposed to extract numerous features from large language model (LLM) representations, yet explaining these features still relies primarily on external observation. This reliance leads to superficial explanations inferred from observed model behavior and computational inefficiency from collecting such...
The nucleon-triggered vector-boson scenario $V_{\mathcal B}$ was motivated by a statistically significant discrepancy between the KLOE measurement, $\mathrm{BR}^{η\rightarrowπ^{0}γγ}_{\text{KLOE}} = \left(0.98\pm0.11_{\text{stat}}\pm0.14_{\text{syst}}\right)\times10^{-4}$, and the current world average,...
Banach asked in 1932 whether a real Banach space $X$ whose $n$-dimensional subspaces, for some fixed $1<n<\dim X$, are all isometric must be a Hilbert space.Gromov proved the conjecture for even $n$, and subsequent work settled several odd-dimensional cases. We prove the conjecture for every odd $n$, including all previously...
In this paper, we formalize a joint communication-control strategy optimization (JCCO) problem in multi-agent linear systems with quadratic costs, under the common-information-based (CIB) framework from decentralized stochastic control. For computational tractability, we focus on such JCCO problems with partially nested (PN)...
We study weakly hyperbolic magnetic (or twisted geodesic) flows of negatively curved surfaces (with nonpositive ''magnetic curvature") with a view to topological dynamics and ergodic theory, using their large-scale geometry on the universal cover.
Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian...
People with disabilities (PWD) increasingly use avatars to express disability identities in social virtual reality (VR), but greater visibility also invites targeted harassment. Existing safety features are often insufficient, overlooking PWD's experiences and needs. To address this gap, we co-designed protection mechanisms with 11...
We prove the existence of a genuinely time-dependent Brakke flow starting from $Γ_0 \subset \mathbb{R}^{n+1}$ whose associated multiplicity-one varifold is stationary, provided that, at some singular point, the scale-invariant $L^2$ distance of $Γ_0$ from an $n$-dimensional plane has sufficiently small limsup as the scale tends to...
The spin of a quasiparticle trapped in a quantum dot Josephson junction forms the basis of an Andreev spin qubit (ASQ): a semiconductor-superconductor device where the interplay between a localized spin degree of freedom and superconductivity leads to a spin-resolved Josephson potential. In this work, we show that shunting an ASQ with...
We study transverse vector perturbations in ghost-free extended quasidilaton massive gravity without a quasidilaton kinetic term, in the presence of minimal matter. In vacuum, we recover the known result that the kinetic coefficient $K_V$ of the gravitational vector modes vanishes on the self-accelerating branch $J=0$, so those modes...
Characterising the efficiency with which designs over various subsets of the unitary group may be constructed is an important goal of quantum information theory. While it is now known that approximate unitary designs can be realised in depth logarithmic in the system size, it has recently been shown that ensembles of local...
High resolution imaging with optical speckle interferometry has revealed that many transiting exoplanet host stars possess close-in stellar companions. The objective of this study is to quantify how the presence of these companions impacts the ability of TESS to detect the transits of small planets. We accomplish this by examining...
In this article, we give a characterization of when two pseudo-Anosov flows obtained via gluings of pieces of pseudo-Anosov flows are orbit equivalent. As an application of this work, and the description of pseudo-Anosov flows in Seifert pieces due to Barbot and Fenley, we prove a ``virtual'' version of the Finiteness Conjecture for...
Hadronic molecules are commonly viewed as products of near-threshold two-body dynamics. We investigate whether an experimentally established molecule can also serve as a building block for a more complex exotic hadron by studying pion scattering off $T^+_{cc}(3875)$. Treating $T_{cc}$ as a correlated isoscalar $D D^*$ molecular...
Speculative decoding losslessly accelerates autoregressive language models by verifying multiple draft tokens in parallel. Diffusion-based drafters further reduce proposal latency by predicting an entire token block in parallel, but their position-wise distributions are marginal rather than conditioned on tokens selected along each...
Let $X$ be a Polish space and let $\mathcal K(X)$ be its Vietoris hyperspace. A family $\mathcal I\subseteq\mathcal K(X)$ is hereditary if it is downward closed under inclusion. Matheron and Zelený asked whether every comeager hereditary family in $\mathcal K(X)$ contains a dense hereditary $G_δ$ subfamily. We give an affirmative...
AI agents are increasingly used for programming, but do not provide any guarantee on the correctness of generated code. Verified code generation, in which an agent produces both an implementation and a machine-checked proof of its specification, offers a stronger path toward trustworthy AI-generated software. Existing benchmarks in...
Quantum technology has the potential to transform scientific discovery, but quantum advantages often require processing capabilities well beyond the reach of experimental platforms. We show that coupling a single controllable qubit to an otherwise conventional sensor can exponentially reduce the number of measurements required to...
We study masking diffusion for discrete sampling and introduce a path-resolved measure of data geometry called the \emph{unmasking growth complexity} ({\textsf{UGC}\xspace}). Its local increments directly control Kullback--Leibler (KL) discretization error, yielding a unified analysis of Bernoulli-subset and fixed-cardinality...
A graph $G$ is \emph{perfectly weight divisible} if, for every positive integral weight function on $V(G)$ and every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A$ and $B$ such that $H[A]$ is perfect and the maximum weight of a clique in $H[B]$ is smaller than the maximum...