arXiv subjects

Search papers

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

At least 451 records · Page 25Linked to original sources

arXiv2026

Bell-inequality violation in light transmitted through disordered emitter ensembles

We show that light transmitted through a disordered ensemble of weakly coupled two-level emitters can violate a Bell inequality in a continuous-wave Franson-type measurement. The Bell signal is determined by two steady-state output-field correlations, the equal-time intensity correlation $g^{(2)}(0)$ and the phase-sensitive two-photon coherence $R$. We compute these quantities for bidirectional propagation through disordered emitter ensembles using a fourth-order cumulant expansion of the many-body master equation. The resulting Bell inequality violation appears in two distinct regimes, an antibunched regime where equal-time coincidences are suppressed and a bunched regime where photon pairs remain phase coherent. Extrapolating the numerics to a representative weak single-emitter coupling $β=0.01$ predicts violation in the antibunched regime for atom numbers $N\simeq75$-$220$, and in the bunched regime for $N\gtrsim250$.

quant-ph↗

arXiv2026

Conditional-Moment Estimation and Inference in the BLP Model

The random-coefficient demand model of Berry, Levinsohn, and Pakes (1995) is commonly estimated by the generalized method of moments (GMM), using an unconditional moment restriction with a fixed set of instruments. Identification of the model, however, rests on a conditional moment restriction. The two are not equivalent: the unconditional restriction may admit additional parameter values. We construct a counterexample in which the model is identified by the conditional restriction yet standard GMM is not, even with the optimal instrument. Building directly on the identifying restriction, we propose a two-step estimator, following Ai and Chen (2003), that first estimates the relevant conditional expectations nonparametrically and then selects the structural parameters by a conditional-variance-weighted minimum-distance criterion; standard GMM is recovered as the special case of a linear projection onto finitely many instruments. We establish root-T asymptotic normality for the proposed estimator, and we develop the theory for both kernel and series implementations of the first stage. The two implementations share a common limiting distribution, attaining the semiparametric efficiency bound. Simulation evidence illustrates the consequences of the identification gap and demonstrates that the proposed estimator outperforms standard GMM in finite samples.

econ.EM↗

arXiv2026

Hyperbolic color codes with constant rate and polynomial distance

Recent advances in quantum hardware relax the strict geometric-locality constraints traditionally imposed on quantum error-correcting codes, motivating interest in high-rate quantum low-density parity-check (qLDPC) codes. At the same time, color codes provide a particularly rich setting for fault-tolerant quantum computation, underlying protocols such as single-shot error correction and self-correcting quantum computation. Hyperbolic color codes provide a class of high-rate qLDPC codes that also retain the structural features of color codes relevant to fault-tolerant quantum computation. However, previous constructions of hyperbolic color codes have achieved at most logarithmic code distance. In this work, we construct hyperbolic color codes with both constant rate and polynomial distance by building on arithmetic hyperbolic manifolds that support polynomial-distance hyperbolic toric codes. Our construction applies in arbitrary dimension $D\geq 4$. In even dimensions, the resulting type-$D/2$ color codes have constant encoding rate and polynomial distance, while in other cases the number of logical qubits and the code distance both exhibit polynomial scaling. We further derive explicit exponents for polynomial lower bounds as functions of the dimension and code type. These results establish a family of hyperbolic color codes simultaneously achieving constant rate and polynomial distance and providing a testbed to explore fault-tolerant quantum computation protocols that combine high-rate quantum codes with the structural advantages of color codes.

quant-ph↗

arXiv2026

Tendon-Driven Continuum Robot with Modular Stiffness and In-Situ Self Pose Estimation

Continuum robots enable smooth shape morphing and safe interaction in confined environments. However, most existing systems are task-specific and depend on external sensing infrastructure, limiting their adaptability and real-world deployment. This paper presents a self-contained modular continuum robotic platform that combines mechanical reconfigurability with onboard pose estimation. The robot is constructed from interchangeable continuum joints with analytically precomputed stiffness, allowing rapid assembly and direct programming of the robot shape. Proprioceptive sensing is achieved using magnetic sensors and a modular learning-based framework, where a single model is trained per joint and reused across configurations. The system is experimentally validated in real world, demonstrating self-sensing capabilities and adaptation without external tracking.

cs.RO↗

arXiv2026

Self-Distilled Pronunciation and Accent Control for Neural Text-to-Speech

Text-to-speech that reads raw text has no lexicon: a rare word is read as guessed, and a native Japanese listener accepts a word only if its reading and pitch accent are both right. A known remedy installs a reading-and-accent channel into a released model, but it needs many recordings. This paper removes the recordings: the frozen backbone reads a sentence containing a common word it already says correctly, and that output serves as the teacher for the same sentence with the word replaced by an annotated reading with its pitch accent. Screened raters judged the tag right on 0.80 to 0.93 of unseen difficult words on four backbones spanning autoregressive, diffusion, and encoder-decoder synthesis; plain kana, which cannot express an accent, got 0.38 to 0.60. On words needing no edit, naturalness is non-inferior on one backbone; on the other three, listeners prefer the unedited rendition by 0.19 to 0.26.

cs.SD↗

arXiv2026

Functions on Nilpotent Orbit Covers and Birational Geometry

We use an analogue of the Springer resolution to describe the $G$-module structure on the ring of regular functions on the universal cover $\widetilde{\mathcal{O}}$ of any nilpotent orbit for $G = SL_n$. Building on previous work on the extended Springer resolution, we construct a variety $\widetilde{\mathcal{M}}$ that is finite over the cotangent bundle of a partial flag variety $G/P$, and proper and birational over the affinization $\mathcal{M}$ of $\widetilde{\mathcal{O}}$. We use techniques in birational geometry to show that $\widetilde{\mathcal{M}}$ has rational singularities, which provides the cohomology vanishing needed to describe the ring of functions on $\widetilde{\mathcal{O}}$ as an induced representation from a Levi subgroup of $G$. Our results also yield a description of the structure of $R(\widetilde{\mathcal{O}})$ as a graded $G$-module. We describe the minimal embedding of $\mathcal{M}$, study the lifting of characters of the component group of $\widetilde{\mathcal{O}}$ to parabolics and Levi subgroups, and make a more general vanishing conjecture.

math.RT↗

arXiv2026

Imprints of the nuclear liquid-gas phase transition on net-baryon number fluctuations

We investigate net-baryon number fluctuations in the high-density, low-temperature region of the QCD phase diagram using the parity-doublet model (PDM) under the mean-field approximation. We compute the fluctuation ratios up to sixth order around the nuclear liquid-gas (LG) phase transition, where the high-order ratios are particularly sensitive. To connect the results with heavy-ion experiments, we test several different scenarios of chemical freeze-out. We find that near the LG transition the extracted fluctuations depend strongly on the choice of freeze-out curve. We self-consistently determine four freeze-out points from preliminary results of the STAR Collaboration. Comparing the experimental data with the PDM results along these four points, we find that the model describes the low energy ($\sqrt{s_{NN}}\lesssim$ 4 GeV) data well. This suggests that nucleon interactions and the LG phase transition may contribute significantly to the fluctuations in low energy heavy-ion collisions.

nucl-th↗

arXiv2026

Same Words, Different Actions: Paired Turn-Taking Evaluation under Rewritten Dialogue Contexts

Real-time spoken dialogue systems must distinguish interruptions that require yielding the floor from backchannels that permit continued speaking. Existing benchmarks typically score events independently and may therefore assign high scores to systems with fixed action preferences rather than context-sensitive decision policies. We introduce ECHO, a paired diagnostic benchmark for Chinese turn-taking evaluation. ECHO pairs examples with the same overlap transcript but contrasting preceding multi-turn dialogue contexts, with one requiring Yield and the other Keep. It additionally includes off-talk examples for diagnosing unnecessary yielding. We introduce pair accuracy, which requires correct decisions on both members of a pair and assigns no credit to constant-action policies. Experiments on four speech systems show that three exhibit a severe over-yielding bias: they correctly keep the floor on fewer than 13% of backchannels, resulting in near-zero pairwise success rates equal or less than 4%. While the remaining system remains comparatively balanced across contexts, these findings broadly demonstrate that interruption-only evaluation can severely overestimate practical turn-taking reliability.

cs.CL↗

arXiv2026

Chern bounds and tangent geometry of polarized Calabi-Yau threefolds

We study the numerical geography and tangent geometry of very amply polarized Calabi--Yau threefolds $(X,H)$ through the positivity of the first jet bundle $J^1(H)$. Writing $d=\int_X H^3$, $c=\int_Xc_2(X) H$, and $e=\int_X c_3(X)$, we exploit two different positivity properties of this single bundle. Mixed intersections on $\mathbb{P}(J^1(H)^*)$ give $e\ge-5d-c-c^2/(4d)$, while a volume estimate for a perturbed tautological class gives $e\ge40d\left[(1-\frac{c}{10d})^{3/2}-1\right]$; in particular $e+6c\ge0$, improving Sun's inequality $e+10c\ge0$. As consequences, we obtain the uniform Hodge bounds $-4d-80\le h^{1,1}(X)-h^{2,1}(X)\le173d/66$, the lower bound $\mathrm{deg}X^\vee\ge78$ for the dual hypersurface, and, in the critical case $X\subset\mathbb{P}^6$, the upper bound $d\le34$. We also prove that, for every $m\ge2$, the tangent-incidence morphism associated with $|mH|$ is the normalization of the tangent variety, conjecture tangent birationality for complete embeddings $X\subset\mathbb{P}^N$ with $N\ge7$, and verify it for several families.

math.AG↗

arXiv2026

Diagnosing and Restoring the Degraded Fault Distance of Magic State Cultivation

T-state cultivation is a resource-efficient protocol producing logical T states but recent benchmarks show that its logical error rate is considerably higher than intended i.e. than S-state cultivation, which is the analogous protocol for producing logical S states. In this paper, we explain this T-S discrepancy by analytically showing, under circuit-level depolarising noise, that distance-3 (-5) T-state cultivation has fault distance 2 (3) due to Pauli hook errors that propagate to coherent Clifford errors after its final double-check circuit; such errors remain Pauli in S-state cultivation, which consequently retains fault distance 3 (5). As part of our analysis we derive a general formula, and an $\mathcal O(n^3)$-time algorithm for fixed logical-qubit count, for the acceptance probability of a logical mixed state afflicted with a Clifford error, where $n$ is the physical qubit count. We then design flags that detect the malignant hook errors in cultivation, improving the pre-escape logical error rate from $Θ(p^3)$ to $Θ(p^5)$. At noise level $p =10^{-3}$, this is a 4.9$\times$ improvement, costing a 1.36$\times$ increase in attempts per accepted shot.

quant-ph↗

arXiv2026

Central charge and black hole entropy for regular extremal black-bounce spacetimes

The Bekenstein-Hawking entropy, proportional to one quarter of the horizon area, is fundamental in black hole thermodynamics and can also be understood via the AdS/CFT correspondence, such as the 3D BTZ black hole and 2D CFT. In this work, we adopt the Kerr/CFT approach to analyze the central charge and black hole entropy for regular extremal black-bounce spacetimes, including the counterparts of the Kerr, Kerr-Newman, and Reissner-Nordström black holes. These spacetimes are free of curvature singularities at $r=0$. We derive the near horizon geometries of these spacetimes and find that they exhibit enhanced symmetry, namely SL$(2,\mathbb{R})\times \mathrm{U}(1)$ or SL$(2,\mathbb{R}) \times \mathrm{SO}(3)$. By imposing appropriate boundary conditions, we analyze their asymptotic symmetry groups, which contain diffeomorphisms as well as the $\mathrm{U}(1)_{\rm gauge}$ symmetry arising from the electromagnetic field. We then extract the central charge from the charge algebra and evaluate the left-moving temperature of the Frolov-Thorne vacuum. It is worth emphasizing that in the black-bounce Kerr-Newman case, the central charge from the electromagnetic contribution vanishes. Furthermore, in the black-bounce Reissner-Nordström case, we uplift the 4D geometry to a 5D configuration by incorporating a $\mathrm{U}(1)$ gauge fiber. Our results show that the microscopic entropy calculated from the Cardy formula is consistent with the Bekenstein-Hawking entropy. This agreement suggests that the Kerr/CFT approach remains valid for certain regular spacetimes without curvature singularities, thereby providing a microscopic statistical understanding of black hole entropy.

hep-th↗

arXiv2026

On fluctuations of the drift in hyperbolic groups

Let Gamma be a convex-cocompact group of isometries of a CAT(-1) space X and let Y to X/Gamma be a Galois cover with a word-hyperbolic group of deck transformations. We show that, for almost every geodesic xi with respect to the Bowen-Margulis-Sullivan measure on the lift of X/Gamma, there exist m,sigma > 0 and a standard Brownian motion B(s) such that, for any lambda > 1/4, d(p(g(s,xi)), o) = ms + sigma B(s) + o(s^lambda), where g(s,xi) denotes the geodesic flow acting on the geodesics of Y and p the canonical projection to Y. The result is a consequence of an almost sure invariance principle for random walks on hyperbolic groups with dependent increments. Its proof makes use of a new Ruelle operator theorem for skew products and Martin boundary techniques for random walks with dependent increments.

math.DS↗

arXiv2026

Bad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific Shortcuts

Reliable agent evaluation is complicated by automatic harness optimization, which repeatedly uses a released benchmark $B_{\mathrm{rel}}$ to guide a Proposer that edits prompts, memory, retrieval, tools, and control code around a fixed foundation model. Task holdout is commonly used to guard against harness overfitting. It varies semantic tasks but leaves the benchmark protocol fixed, so a bad genius Proposer can produce a cheating harness whose improvement over the initial harness on $B_{\mathrm{rel}}$ depends on a benchmark-wide shortcut. We introduce Counterfactual Harness Search and Evolution (CHASE), which casts harness evolution as constraint generation over valid counterfactual benchmarks. After each Proposer update, a Challenger searches for an executable protocol transformation with large gain destruction. A validity firewall checks that task semantics are preserved, while a held-out confirmation set determines whether the counterfactual enters a finite archive. We formalize an ideal shortcut-neutralized benchmark $B_0$ and establish theoretical guarantees linking finite counterfactual archives to $B_0$ and characterizing sequential Challenger search. We evaluate CHASE on Syn-Ledger and OfficeQA, where CHASE retains strong released-benchmark gains while substantially reducing gain destruction under valid protocol transformations.

cs.AI↗

arXiv2026

TERN: A Delta-rule Memory with a Seasonal Reference and Online Adaptation for Epidemic Forecasting

Weekly influenza surveillance counts guide vaccine distribution and public-health alerts, yet they are hard to forecast. Each region offers only a few seasons, waves shift in timing and height every year, and information that helps while a wave grows misleads after its peak, whereas last season's shape stays informative for a year. Existing epidemic graph models and general forecasters read a short fixed window and treat all past information alike, so they neither exploit earlier seasons nor discard stale associations when the epidemic phase changes. To address these limitations, we propose TERN, a forecaster built around a delta-rule fast-weight memory that decays channel-wise and erases along a learned address under gates driven by local epidemic-phase features, combined with an explicit seasonal reference and online adaptation. On three Cola-GNN influenza benchmarks, TERN outperformed epidemic graph models and general forecasters, matched or exceeded seasonal references, and a controlled comparison confirmed the contribution of the memory itself.

cs.LG↗

arXiv2026

Extreme values of Euler-Kronecker constants of abelian cubic fields

Euler-Kronecker constants are analogues of the Euler-Mascheroni constant for number fields. Assuming the Generalized Riemann Hypothesis for Hecke $L$-functions, we obtain extreme values of Euler-Kronecker constants of abelian cubic fields. We also prove a similar result for quadratic fields.

math.NT↗

arXiv2026

Carrollian axion electrodynamics

We construct theories of Carrollian electromagnetism coupled to an axion field. Obtained by performing a $c \to 0$ expansion of axion electrodynamics, these are of two types: electric and magnetic. We derive the Lagrangians and work out the general classical solutions for both. While the electric theory has the axion effectively decoupled from the electromagnetic fields, the magnetic theory is endowed with a nontrivial axion coupling that leads to interesting phenomenology. In particular, a Carrollian analogue of the Witten effect, wherein a magnetic monopole in the presence of a constant non-vanishing axion acquires an electric charge and becomes a dyon, is present in the magnetic theory. At the same time, the linear magnetoelectric effect vanishes entirely, a conclusion we establish by performing a thorough Dirac-Bergmann analysis of the constraint structure of the magnetic theory and a proper identification of its physical phase space.

hep-th↗

arXiv2026

Entanglement swapping across a five-node relay in a multiplexed quantum-classical network

Quantum networks are resources for scaling quantum computers and distributed sensing technologies while offering post-quantum security benefits. Teleporting non-classical resources like entanglement, via so called entanglement swapping, is essential for networks in particular overcoming rate-loss limits via quantum repeaters. Deploying these systems on real infrastructure will likely require multiplexing photonic qubits into fibers carrying 'classical' light encoding standard Internet communications and control plane signals for multi-node quantum protocols. Here, we report the first demonstration of entanglement swapping and conventional communications operating over the same fibers. Entanglement is swapped across a five-node quantum relay topology connected by four long-distance fibers, each populated with classical data signals. Time-bin entangled photons in the C-band are multiplexed alongside C-band classical signals using dense-wavelength division multiplexing, introducing noise photons generated by high-power classical light. We experimentally and theoretically characterize the trade-off between quantum fidelity and Raman noise photons. Entanglement swapping is demonstrated over a maximum fiber length of 40 km (four 10-km fibers) while simultaneously transmitting 10-Gbps classical data through all fibers. These results represent a significant advancement in the demonstrated complexity of coexisting quantum and classical networks and provide a roadmap for achieving the widespread deployment of advanced quantum technologies.

quant-ph↗

arXiv2026

Exact logical error rates for magic state cultivation

We compute exactly the acceptance and logical error rates for the distance $d=3$ and $d=5$ magic state cultivation circuits from Clifft [arXiv:2604.27058] and SOFT [arXiv:2512.23037] using Pauli propagation and binary tensor contraction. Actual $T$-gates are studied, not the $S$-gate proxy used for sampling. The calculation includes every fault order at several circuit-level noise strengths ($p$). We provide a series expansion form to the logical error rates, through order $(p/(1-p))^{10}$. The analytical results recover the numerical values from Clifft and SOFT at both $d=3$ and $d=5$ to within their sampling uncertainty. Then, we show that the $d=3$ and $d=5$ circuits actually have fault distances of $d_{\text{fault}}=2$ and $d_{\text{fault}}=3$ respectively, explaining the similar distance degrading effects from the companion code of [Quantum 10, 2134 (2026)].

quant-ph↗