arXivDaily arXiv每日学术速递 周一至周五更新
重置
全部学科分类 1942
2605.21270 2026-05-21 cs.NI

Enhanced-BLE: A Hybrid BLE-ESB Framework for Dynamically Reconfigurable and Energy-Efficient 2.4 GHz IoT Communication

增强型BLE:一种混合BLE-ESB框架,用于动态可重构和节能的2.4 GHz物联网通信

Ziyao Zhou, Chen Shen, Tiancheng Cao, Hen-Wei Huang

AI总结 本文提出了一种混合BLE-ESB框架,通过结合BLE和ESB协议,提高了2.4 GHz物联网通信的低延迟、高吞吐量、节能和可靠性。

详情
AI中文摘要

蓝牙低功耗(BLE)因其低功耗、互操作性和可靠的双向通信而在物联网系统中得到广泛应用。然而,其面向连接的架构在唤醒延迟、吞吐量和能耗之间引入了权衡,限制了其在突发模式和按需传感应用中的适用性。增强型冲击突发(ESB)是一种轻量级的无连接协议,由相同的2.4 GHz Nordic Semiconductor硬件支持,能够实现快速唤醒和高效的数据显示传输,但不提供BLE级别的鲁棒性以支持持续的双向通信。本文系统地在统一的Nordic nRF54L15平台上对BLE和ESB进行了基准测试,并提出了增强型BLE,一种将两种协议结合的混合框架,以扩展传统BLE操作。实验结果表明,与BLE相比,ESB几乎将数据包传输时间和能耗减少了一半,将可实现的前向吞吐量翻倍,并在间歇性操作中将唤醒延迟和能耗减少了约二十倍。然而,ESB的反向传输可能会出现数据包丢失,而BLE则维持可靠的双向通信。增强型BLE通过自适应无线电调度和共存感知的连接管理来解决这一权衡,结合基于ESB的高吞吐量前向传输和基于BLE的可靠反向通信。该框架使BLE到ESB的切换在约18毫秒内完成,并从待机模式恢复BLE操作需要49毫秒。增强型BLE还实现了比BLE大约两倍的前向吞吐量,同时降低了唤醒延迟。这些结果展示了一种实用且硬件兼容的策略,用于低延迟、高吞吐量、节能和可靠的2.4 GHz物联网通信。

英文摘要

Bluetooth Low Energy (BLE) is widely used in IoT systems because of its low power consumption, interoperability, and reliable bidirectional communication. However, its connection-oriented architecture introduces trade-offs among wake-up latency, throughput, and energy efficiency, limiting its suitability for burst-mode and on-demand sensing applications. Enhanced ShockBurst (ESB), a lightweight connectionless protocol supported by the same 2.4 GHz Nordic Semiconductor hardware, enables fast wake-up and efficient data transmission, but does not provide BLE-level robustness for sustained bidirectional communication. This work systematically benchmarks BLE and ESB on a unified Nordic nRF54L15 platform and proposes Enhanced-BLE, a hybrid framework that integrates the two protocols to extend conventional BLE operation. Experimental results show that ESB nearly halves packet transmission time and energy compared with BLE, doubles the achievable forward throughput, and reduces wake-up latency and energy by nearly twentyfold during intermittent operation. However, ESB reverse transmission may suffer packet loss, whereas BLE maintains reliable bidirectional communication. Enhanced-BLE addresses this trade-off through adaptive radio scheduling and coexistence-aware connection management, combining ESB-based high-throughput forward transmission with BLE-based reliable reverse communication. The framework enables BLE-to-ESB handover within approximately 18 ms and restores BLE operation within 49 ms from standby mode. Enhanced-BLE also achieves approximately twofold higher forward throughput than BLE while reducing wake-up latency. These results demonstrate a practical and hardware-compatible strategy for low-latency, high-throughput, energy-efficient, and reliable 2.4 GHz IoT communication.

2605.21267 2026-05-21 cs.CC

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming

朝向单指数时间的时序与空间推理:通过冗余性和动态规划的研究

Victor Lagerkvist, Johanna Groven, Leif Eriksson

AI总结 本文研究了时序与空间推理问题,探讨了通过冗余性和动态规划方法实现单指数时间复杂度的可能性,提出了针对RCC和IA问题的两种算法,分别在不同条件下达到了接近已知时间复杂度的性能。

Comments 14 Pages, 2 Figures, 2 Tables, 3 Algorithms

详情
Journal ref
Proceedings of the AAAI Conference on Artificial Intelligence. 40, 17 (Mar. 2026), 14287-14294
AI中文摘要

区域连接演算(RCC)和艾伦区间代数(IA)是两个著名的NP难的空间-时间定性推理问题。它们可以在$2^{O(n \log n)}$时间内解决,其中$n$是变量的数量,而IA还已知可以在$o(n)^n$时间内解决。然而,对于RCC而言,尚未有优于穷举搜索的改进,且若能以单指数时间$2^{O(n)}$解决仍未知。我们通过多个途径探讨达到此类界限的可能性。首先,我们证明分支法不足,因为存在过多非冗余约束。具体而言,我们分类了RCC和IA中最大数量的非冗余约束。算法上,我们基于动态规划(DP)做出了两项重要贡献。第一个算法在$4^n$时间内运行,适用于一个非平凡的NP难IA片段,其中包括Golumbic和Shamir(1993)提出的区间图sandwich问题。对于包含8种基本关系的更丰富的RCC问题,我们采用更复杂的办法,其渐近性能与IA的$o(n)^n$界限相匹配。

英文摘要

The region connection calculus ($RCC$) and Allen's interval algebra ($IA$) are two well-known NP-hard spatial-temporal qualitative reasoning problems. They are solvable in $2^{O(n \log n)}$ time, where $n$ is the number of variables, and $IA$ is additionally known to be solvable in $o(n)^n$ time. However, no improvement over exhaustive search is known for $RCC$, and if they are also solvable in single exponential time $2^{O(n)}$ is unknown. We investigate multiple avenues towards reaching such bounds. First, we show that branching is insufficient since there are too many non-redundant constraints. Concretely, we classify the maximum number of non-redundant constraints in $RCC$ and $IA$. Algorithmically, we make two significant contributions based on dynamic programming (DP). The first algorithm runs in $4^n$ time and is applicable to a non-trivial, NP-hard fragment of $IA$, which includes the well-known interval graph sandwich problem of Golumbic and Shamir (1993). For the richer $RCC$ problem with 8 basic relations we use a more sophisticated approach which asymptotically matches the $o(n)^n$ bound for $IA$.

2605.21265 2026-05-21 math.PR

The non-Hermitian minor process

非厄米特minor过程

Giorgio Cipolloni, László Erdős, Oleksii Kolupaiev

AI总结 研究非厄米特随机矩阵的大leading principal minors的log-determinant收敛于2+1维高斯场,揭示了logarithmically correlated的parabolic距离特性,属于Edwards-Wilkinson universality类。

Comments 29 pages, 1 figure

详情
AI中文摘要

我们证明大非厄米特随机矩阵的leading principal minors的log-determinant在分布上收敛于2+1维高斯场,该场在抛物距离下呈现logarithmically correlated特性,类似于Edwards-Wilkinson universality类。

英文摘要

We show that the log-determinant of leading principal minors of large non-Hermitian random matrices converges in distribution to a 2+1 dimensional Gaussian field, which is logarithmically correlated for the parabolic distance, reminiscent to the Edwards-Wilkinson universality class.

2605.19961 2026-05-21 math.OC cs.SY eess.SY

Data-driven approximation of regions of attraction via an LP-based selection of PWA Lyapunov functions

基于线性规划选择的PWA李雅普诺夫函数用于数据驱动的吸引区近似

Oumayma Khattabi, Matteo Tacchi-Bénard, Martin Gulan, Sorin Olaru

AI总结 本文提出了一种方法,通过数据近似未知非线性动力系统吸引区。假设向量场的点评和已知利普希茨界,构造了多面体不确定性集。该描述使能通过线性规划合成连续分段仿射李雅普诺夫函数,强制所有允许的向量场的鲁棒递减条件。该方法允许认证与可用数据一致的吸引区。数值例子展示了所提方法在稀疏数据中提取认证吸引区的有效性。

详情
AI中文摘要

本文提出了一种方法,通过数据近似未知非线性动力系统吸引区。假设向量场的点评和已知利普希茨界,构造了多面体不确定性集。该不确定性描述使能通过线性规划合成连续分段仿射李雅普诺夫候选函数,强制所有允许的向量场的鲁棒递减条件。该方法允许认证与可用数据一致的吸引区。数值例子展示了所提方法在稀疏数据中提取认证吸引区的有效性。

英文摘要

This paper presents a method to approximate regions of attraction of unknown nonlinear dynamical systems from data. Assuming point-wise evaluations of the vector field and known Lipschitz bounds, a polyhedral uncertainty set of admissible dynamics is constructed. This uncertainty description enables the synthesis of a continuous piece-wise affine Lyapunov candidate via a linear program, enforcing a robust decrease condition for all admissible vector fields. The approach allows certification of a region of attraction consistent with the available data. Numerical examples illustrate the effectiveness of the proposed method in extracting certified regions of attraction from sparse data.

2605.19913 2026-05-21 cond-mat.other

Self-Decelerating Bright Exciton-Polariton Solitons in Bound-State-in-Continuum Microcavities

自减速的明亮极子-激子孤子在束缚态-连续微腔中

Xingran Xu, Chunyu Jia

AI总结 本文研究了在支持束缚态-连续的微腔系统中明亮极子-激子孤子的形成与动力学,通过驱动耗散的格雷-皮塔耶夫斯基方程与激子库的速率方程,证明BICs为稳定凝聚态免于辐射衰减提供了稳健平台,并利用拉格朗日变分法推导出描述这些明亮孤子轨迹和速度的解析表达式,发现这些BIC工程孤子具有独特的自减速现象,最终在初始条件和系统参数决定的位置停止,进一步分析了这些孤子的动力学稳定性,为非厄密系统中极子流的操控提供了有价值的见解。

详情
AI中文摘要

我们理论上研究了在支持束缚态连续的系统中明亮极子-激子孤子的形成和动力学。通过使用驱动耗散的格雷-皮塔耶夫斯基方程与激子库的速率方程,我们证明BICs为稳定凝聚态免于辐射衰减提供了稳健平台。利用拉格朗日变分法,我们推导出描述这些明亮孤子轨迹和速度的解析表达式。值得注意的是,我们发现这些BIC工程孤子的传播表现出明显的自减速,最终在由初始条件和系统内在参数决定的位置停止。此外,我们分析了这些孤子的动力学稳定性。我们的发现为非厄密系统中极子流的操控提供了有价值的见解。

英文摘要

We theoretically investigate the formation and dynamics of bright exciton-polariton solitons within systems engineered to support Bound States in the Continuum. By employing a driven-dissipative Gross-Pitaevskii equation coupled with a rate equation for the excitonic reservoir, we demonstrate that BICs provide a robust platform for stabilizing the condensate against radiative decay. Utilizing a Lagrangian variational approach, we derive analytical expressions describing the trajectory and velocity of these bright solitonic excitations. Notably, we find that the propagation of these BIC-engineered solitons exhibits a distinct self-deceleration, eventually bringing them to a halt at a final position dictated by the initial conditions and intrinsic system parameters. Furthermore, we analyze the dynamical stability of these solitons. Our findings offer valuable insights into the manipulation of polaritonic flows in non-Hermitian systems.

2605.19893 2026-05-21 cs.OS

SSV: Sparse Speculative Verification for Efficient LLM Inference

SSV:用于高效LLM推理的稀疏推测验证

Zhibin Wang, Ziyu Zhong, Nuo Shen, Yuhang Zhou, Rong Gu, Sheng Zhong

AI总结 本文提出SSV框架,通过结合重叠感知的分组查询执行、基于刷新/重用的NSA内核融合和基于性能配置文件的提示自适应调度,提升跨查询重用率,减少所选索引和分支融合开销,并在用户指定的精度类别下选择有效的草稿验证策略。

详情
AI中文摘要

推测解码和动态稀疏注意力是两种互补的方法,用于加速长上下文LLM推理:前者在多个验证查询中摊销目标模型执行,后者减少每个查询的KV缓存工作集。直接结合它们却暴露出结构性不匹配:推测验证依赖于跨查询的共同性,而动态稀疏注意力则为每个查询分配特定的稀疏布局。这种不匹配限制了KV块的重用,放大了NSA的分支开销,并使验证策略的选择依赖于输入和运行环境。我们提出了SSV,一种稀疏推测验证框架,将动态稀疏注意力转化为以验证为导向的工作负载。SSV结合了重叠感知的分组查询执行、基于刷新/重用的NSA内核融合和基于性能配置文件的提示自适应调度,以提升跨查询重用率,减少所选索引和分支融合开销,并在用户指定的精度类别下选择有效的草稿验证策略。在NVIDIA H100 GPU上的实验表明,SSV在端到端吞吐量上比自回归NSA解码提高了多达3.49倍,在稀疏推测验证的内核速度提升上达到了6.86倍。

英文摘要

Speculative decoding and dynamic sparse attention are two complementary approaches for accelerating long-context LLM inference: the former amortizes target-model execution across multiple verifier queries, while the latter reduces each query's KV-cache working set. Directly combining them, however, exposes a structural mismatch: speculative verification relies on cross-query commonality, whereas dynamic sparse attention assigns query-specific sparse layouts. This mismatch limits KV-block reuse, amplifies NSA's branch-wise overheads, and makes verification strategy selection input- and regime-dependent. We present SSV, a sparse speculative-verification framework that turns dynamic sparse attention into a verification-oriented workload. SSV combines overlap-aware grouped-query execution, refresh/reuse-based NSA kernel fusion, and profile-guided prompt-adaptive orchestration to improve cross-query reuse, reduce selected-index and branch-fusion overheads, and select effective draft-verification strategies under user-specified precision classes. Experiments on NVIDIA H100 GPUs show that SSV achieves up to 3.49x end-to-end throughput over autoregressive NSA decoding and up to 6.86x kernel speedups for sparse speculative verification.

2605.16002 2026-05-21 math.OC

Towards A Goldfarb-Idnani Variant for Strongly Monotone Linear-Quadratic Games

针对强单调线性二次博弈的Goldfarb-Idnani变种

Alberto Bemporad

AI总结 本文分析了Goldfarb-Idnani对偶主动集方法的一个简单变种,用于计算具有凸二次成本和共享仿射不等式和等式约束的强单调N玩家博弈的变分广义纳什均衡。尽管联合KKT系统的伪梯度矩阵可能非对称,该方法仍保持了GI算法的一些性质,但无法保证收敛到现有均衡。数值结果表明,该方法在计算博弈论线性模型预测控制解时可能与现有最先进算法竞争。

Comments 15 pages, 2 figures

详情
AI中文摘要

我们分析了Goldfarb-Idnani(GI)对偶主动集方法的一个简单变种,用于计算具有凸二次成本和共享仿射不等式和等式约束的强单调N玩家博弈的变分广义纳什均衡。我们证明,尽管联合KKT系统的伪梯度矩阵可能非对称,GI算法的某些性质仍得以保持,尽管与原始算法相比,无法保证收敛到现有均衡。我们的数值结果表明,该方法在计算博弈论线性模型预测控制解时可能与现有最先进算法竞争。

英文摘要

We analyze a simple variant of the Goldfarb-Idnani (GI) dual active-set method for computing variational generalized Nash equilibria of strongly monotone N-player games with convex quadratic costs and shared affine inequality and equality constraints. We show that several properties of the GI algorithm are maintained in spite of having a possibly non-symmetric pseudogradient matrix in the joint KKT system of the game, although convergence to an existing equilibrium is not guaranteed as in the original algorithm. Our numerical results show that the method is potentially competitive with alternative state-of-the-art algorithms, including for computing solutions of game-theoretic linear model predictive control laws.

2605.12057 2026-05-21 hep-ph hep-th

Explicit Conditions for Diagnosing Tree-Level Unitarity

树级单位性的显式条件

Jaehoon Jeong, Pyungwon Ko, Yu-Hui Zheng

AI总结 本文提出了一种基于粒子内容的树级单位性诊断方法,通过显式给出所有耦合条件,无需重构完整拉格朗日量即可判断系统是否满足树级单位性,并展示了如何通过递归构造四点幅来推导树级单位性条件。

Comments 62 pages, 3 tables

详情
AI中文摘要

我们明确地给出了所有用于树级单位性(树单位性)的耦合条件,这些条件适用于具有有限数量的自旋不超过1的重子和轻子的理论。这些条件允许我们仅通过质量基的粒子内容来诊断系统的树级单位性,而无需重构完整的拉格朗日量。我们证明了所有高能增长被树级单位性条件抵消的四点幅都是可构造的,从而促使四点幅的递归构造。通过研究它们的高能增长,我们推导出四点幅的树级单位性条件。通过将这些条件简化拉格朗日量结构,我们使用Stückelberg形式法推导出所有高点幅产生的树级单位性条件。我们证明所有树级单位性条件在五点幅范围内完全被捕捉,确保无需研究更高点幅。我们还将结果应用于系统地检查包含重暗光子和自旋不超过1的暗物质粒子的暗部门的树级单位性条件,并提取出重暗光子情况下的质量生成本质特征。此外,我们还表明我们的结果允许我们得出没有标量场的理论需要无限塔的向量和费米子才能满足树级单位性。最后简要讨论了希格斯通路VDM中的单位性和相关问题。

英文摘要

We explicitly present all coupling conditions required for tree-level unitarity (tree unitarity) in theories with a finite number of massive and massless particles of spin up to 1. They allow us to diagnose tree unitarity of a system using only its particle content in the mass basis, without reconstructing the full Lagrangian. We show that all four-point amplitudes whose high-energy growth is canceled by tree unitarity conditions are on-shell constructible, thereby motivating the recursive construction of four-point amplitudes. By examining their high-energy growth, we derive tree unitarity conditions for four-point amplitudes. Imposing these conditions to simplify the Lagrangian structure, we use the Stückelberg formulation to derive the tree unitarity conditions arising from all higher-point amplitudes. We show that all tree unitarity conditions are fully captured up to five-point amplitudes, ensuring no necessity of examining higher-point ones. We apply our results to systematically examine tree unitarity conditions in the dark sector with a massive dark photon and dark matter particles of spin up to 1, and extract the essential features for mass generation in the massive dark photon case. In addition, we show that our results allow us to conclude that theories without scalars require an infinite tower of vectors and fermions for tree unitarity. Finally unitarity and related issues in the Higgs portal VDM are discussed in brief.

2605.10733 2026-05-21 math.KT

Equivariant Hochschild cohomology of group algebras and relative $\operatorname{Ext}$

群代数的等变Hochschild上同调与相对Ext

Andrada Pojar, Constantin-Cosmin Todea

AI总结 本文研究了有限群作用下群代数的等变Hochschild上同调非平凡条件,并展示了Γ-代数的Γ-等变双模系数下的Hochschild上同调与相对Ext的同构关系。

详情
AI中文摘要

对于有限群Γ作用于有限群G,我们找到使得群代数kG的首个Γ₀-等变Hochschild上同调非平凡的必要条件,其中k是特征p整除G阶的域,Γ₀是Γ中某个G元素的稳定子群。对于任意域k,我们证明了Γ-代数的Γ-等变双模系数下的Hochschild上同调在相对同调代数背景下与某些kΓ-相对Ext同构。

英文摘要

For a finite group $Γ$, acting on a finite group $G,$ we find necessary conditions for which the first $Γ_0$-equivariant Hochschild cohomology of the group algebra $kG$ is non-trivial, where $k$ is a field of characteristic $p$ dividing the order of $G$ and $Γ_0$ is the stabilizer subgroup in $Γ$ of some element in $G.$ For any field $k$ we show that the $Γ$-equivariant Hochschild cohomology of $Γ$-algebras with coefficients in a $Γ$-equivariant bimodule (Jensen, 1996) is isomorphic with some $kΓ$-relative $\operatorname{Ext},$ in the context of relative homological algebra.

2605.07122 2026-05-21 cs.SE

RepoZero: Can LLMs Generate a Code Repository from Scratch?

RepoZero: LLMs能否从零开始生成代码仓库?

Zhaoxi Zhang, Yiming Xu, Jiahui Liang, Weikang Li, Xiaoshuai Chen, Liwei Qian, Xin Pei, Jizhou Huang, Run Sun, Yunfang Wu

AI总结 本文提出RepoZero基准测试,通过自动化执行验证实现从零开始生成代码仓库的严格评估,展示了Agentic Code-Test Evolution框架在多模型上的实验结果,揭示了当前LLM在代码生成能力与实际需求之间的差距。

详情
AI中文摘要

大型语言模型(LLMs)近年来在代码生成方面取得了显著进展,但其从零开始构建完整软件仓库的能力仍缺乏深入理解。关键瓶颈在于缺乏可验证且可扩展的评估方法:现有基准要么专注于基于补丁的编辑,要么依赖人类或LLM的判断,导致偏差并限制了可重复性。本文提出了RepoZero,第一个能够实现从零开始的仓库生成的全自动、基于执行的验证基准。我们的核心思想是将生成过程重新表述为仓库复现:仅给定API规范,代理必须重新实现整个仓库,使其行为与原始实现一致。这种设计允许通过输出等价性进行严格黑盒验证,同时自然支持大规模构建,通过重用现有开源仓库。为进一步减少数据泄露和捷径解决方案,我们引入了跨语言约束和沙箱评估协议。基于此基准,我们提出了Agentic Code-Test Evolution(ACE)框架,通过迭代测试生成和错误驱动的优化,实现了仓库级生成的有效测试时间扩展。在多个最先进的LLM和代理框架上的广泛实验表明,即使最强的LLM代理也仅能达到有限的通过率(30%-55%),揭示了当前能力与实际软件开发需求之间的巨大差距。我们的结果确立了RepoZero作为端到端代码生成的挑战性、可扩展且可靠的测试平台,并突显了通过测试生成实现自我验证作为推进基于LLM的编码代理的关键方向。

英文摘要

Large Language Models (LLMs) have recently shown remarkable progress in code generation, yet their ability to construct complete software repositories from scratch remains poorly understood. A fundamental bottleneck is the lack of verifiable and scalable evaluation: existing benchmarks either focus on patch-based editing or rely on human or LLM-based judgments, which introduce bias and limit reproducibility. In this work, we present RepoZero, the first benchmark that enables fully automated, execution-based verification of repository-level generation from scratch. Our key idea is to reformulate generation as repository reproduction: given only API specifications, an agent must re-implement an entire repository such that its behavior matches the original implementation. This design allows for strict black-box validation via output equivalence, while naturally supporting large-scale construction by reusing existing open-source repositories. To further mitigate data leakage and shortcut solutions, we introduce cross-language constraints and a sandboxed evaluation protocol. Building on this benchmark, we propose an Agentic Code-Test Evolution (ACE) framework that performs iterative test generation and error-driven refinement, enabling effective test-time scaling for repository-level synthesis. Extensive experiments across multiple state-of-the-art LLMs and agent frameworks reveal that even the strongest LLM agents achieve only limited pass rates (30\% - 55\%), exposing a substantial gap between current capabilities and real-world software development requirements. Our results establish RepoZero as a challenging, scalable, and reliable testbed for end-to-end code generation, and highlight self-verification via test generation as a critical direction for advancing LLM-based coding agents.

2605.06488 2026-05-21 math.PR

Continuous-state branching processes with Lévy-Khintchine drift-interaction: Laplace duality and Fellerian extensions

具有Lévy-Khintchine漂移-相互作用的连续状态分支过程:拉普拉斯对偶性与Feller扩展

Clément Foucart, Félix Rebotier

AI总结 本文研究了一类由Lévy-Khintchine型漂移驱动的连续状态分支过程(CBDI),通过拉普拉斯对偶性和Feller扩展分析了其边界行为和分支与漂移-相互作用机制的交换特性。

Comments 72 pages, 1 figure

详情
AI中文摘要

我们研究了一类由Lévy-Khintchine型漂移驱动的连续状态分支过程(CBDI)。这些取值为[0,∞)的过程捕捉了分支动力学和密度依赖性,允许在低种群规模时合作,在高密度时竞争。尽管相互作用破坏了分支性质,但Lévy-Khintchine形式的漂移诱导出拉普拉斯对偶性。这种对偶性将CBDI过程的拉普拉斯变换表示为另一个CBDI过程的拉普拉斯变换,其中分支和漂移-相互作用机制被交换。当过程在边界0或∞处停止时,这些机制唯一地由其在法律上确定。当漂移非Lipschitz且在边界处足够强时,构造了Feller扩展,允许过程连续离开并可能重新进入该边界。我们确定了参数,这些参数由机制及其关联的尺度函数和势测度定义,决定了在0和∞处的边界行为(入口、出口或规则)。当机制假设为正则变化时,出现所有制度,包括自身规则和非粘性边界。我们的方法结合了拉普拉斯对偶性和比较原理。对偶性促进了半群的分析和尖锐的Lyapunov函数的构造。比较确保了首次通过时间的单调性和收敛性。

英文摘要

We investigate the class of continuous-state branching processes with interaction driven by a Lévy-Khintchine type drift (CBDI). These $[0,\infty]$-valued processes capture both dynamics of branching and density-dependence, allowing for cooperation at low population sizes and competition at high densities. Although the interaction breaks the branching property, the Lévy--Khintchine form of the drift induces a Laplace duality. This duality expresses the Laplace transform of a CBDI process in terms of that of another CBDI process, in which the branching and drift-interaction mechanisms are exchanged. The process, stopped upon hitting either boundary $0$ or $\infty$, is uniquely characterized in law by these mechanisms. A Fellerian extension is constructed when the drift is non-Lipschitz and sufficiently strong at a boundary, allowing the process to leave this boundary continuously and possibly re-enter it. We identify parameters, defined in terms of the mechanisms and their associated scale function and potential measure, that determine the boundary behavior at $0$ and $\infty$ (entrance, exit or regular). Settings exhibiting all regimes, including regular-for-itself and non-sticky boundaries, arise when the mechanisms are assumed to be regularly varying. Our approach combines Laplace duality and comparison principles. The duality facilitates the analysis of semigroups and the construction of sharp Lyapunov functions. Comparisons ensure monotonicity and convergence properties of first-passage times.

2605.00255 2026-05-21 cs.IT math.IT

Sequential Automorphism Ensemble Decoding with Early Stopping

顺序自同构集合解码与早停

Charles Pillet, Pascal Giard, Bassant Selim, François Leduc-Primeau

AI总结 本文提出了一种低复杂度的自同构集合解码器(AED)方法,利用逐次取消(SC)作为构成解码器,通过顺序激活子解码器并在预优化参数下终止解码过程,以减少平均解码复杂度并满足块错误率(BLER)约束。

Comments 5 pages, 5 figures, 1 table, submitted to IEEE Communications Letters

详情
AI中文摘要

本文提出了一种低复杂度的自同构集合解码器(AED)方法,利用逐次取消(SC)作为构成解码器。该方法依次激活子解码器,并基于解码结果与SC路径度量之间的强相关性所推导出的预优化参数终止解码过程。提出了一种算法以找到一组早停阈值,以在满足块错误率(BLER)约束的情况下最小化平均解码复杂度。对于各种码参数和BLER低于$10^{-3}$的情况,仿真结果表明,与原始AED复杂度相比,平均解码复杂度可减少至少$6 imes$,最高可达$22 imes$,且BLER的退化可以忽略。

英文摘要

In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$, simulation results show that average decoding complexity is reduced by a factor of at least $6 \times$, and up to $22 \times$, compared to the original AED complexity, with a negligible degradation in BLER.

2604.26792 2026-05-21 quant-ph

Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators

量子比特与量子态编码在对角二次算符中的容错资源比较

Samuel Godwood, Doğa Murat Kürkçüoğlu, Gabriel N. Perdue, Marina Maneyro, Alessandro Roggero

AI总结 本文比较了量子态编码和量子比特编码在实现对角二次演化的非克莱因门成本,探讨了量子态编码在容错性能上的优势,并通过有限维度分析确定了量子态编码在特定情况下能提供恒定因子节省的区域。

详情
AI中文摘要

有限局部希尔伯特空间截断在格点场论的量子模拟中自然出现,推动了量子态编码的发展,但其在容错性能上相对于量子比特编码的优势仍不明确。我们比较了使用单一逻辑d级量子态或n_b=⌈log₂d⌉个逻辑量子比特实现二次对角演化(以U=e^{-itϕ_x²}为例,在均匀场振幅离散化实标量场中)的非克莱因门成本。我们分析了两种标准设置:积公式模拟和LCU/块编码,将资源度量设为合成离散逻辑门集后的非克莱因门数量。由于一般单量子态旋转的紧合成界尚不明确,我们将量子态构造表示为嵌入的双级SU(2)旋转,并推导出显式的有限d破平衡条件,用于指导何时量子态编码能优于量子比特基线。在所研究的构造模型中,积公式实现需要量子态在渐近情况下具有指数级更强的合成优势才能获胜,而在LCU设置中,量子比特编码在d趋于无穷时是渐近更便宜的。然而,有限d阈值分析确定了低维区域,在这些区域中量子态能提供有意义的恒定因子节省,尤其是在基于LCU的实现中。作为LCU构造的二次分析,我们使用一个理想化的低开销量子比特-量子态编码切换模型,给出绝对的T计数比较,并重新解释节省作为允许的每次切换开销预算。

英文摘要

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by $U=e^{-itϕ_x^2}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=\lceil \log_2 d\rceil$ logical qubits. We analyze two standard settings: product-formula simulation and LCU/block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level $SU(2)$ rotations and derive explicit finite-$d$ break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in $d$. Nevertheless, the finite-$d$ threshold analysis identifies low dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute $T$-count comparison, and reinterpret the savings as an allowable per-switch overhead budget.

2604.23084 2026-05-21 astro-ph.SR

Multi-Viewpoint Observation of a Failed Prominence Eruption on the Sun

太阳上一次失败的日冕喷射的多视角观测

Tingyu Gou, Katharine K. Reeves, Peter R. Young, Astrid M. Veronig, Xingyao Chen, Sijie Yu, Bin Chen, Bin Zhuang

AI总结 本文通过多视角和多信使成像技术对一次失败的日冕喷射进行了全面观测,揭示了日冕喷射过程中磁重联过程的不同发生地点,并探讨了磁重联对日冕喷射加速和磁场变化的影响。

详情
Journal ref
Nat Astron (2026)
AI中文摘要

日冕喷射是太阳上突然的等离子体和磁场喷射,伴随强烈的能量释放。喷射结构并不总是成功喷射,有时在启动后无法逃离太阳。然而,喷射的失败为理解喷射的复杂机制提供了宝贵的机会。本文报道了对太阳上一次失败的日冕喷射的全面观测,利用多视角和多信使成像技术。同时进行的离太阳边缘和盘面观测提供了证据,证明在喷射过程中不同地点发生了磁重联过程。特别是,除了喷射后方的常规磁重联外,还在喷射的磁通绳上发生了强烈的外部磁重联,这通过多波长成像和光谱学得到了大量证据。这两种重联过程可能在磁通绳的加速中扮演对立的角色,并在改变磁通绳中的磁通量方面竞争。随着外部磁重联的高率进行,磁通绳和嵌入的日冕喷射明显减速,并在上层磁场的强磁约束下未能喷射到日球层。我们的结果为太阳喷射活动提供了清晰的物理图景,并为其他太阳型恒星中发现的缺乏日冕质抛射现象提供了见解。

英文摘要

Solar eruptions are sudden ejections of coronal mass and magnetic fields accompanied by intense energy release. The eruptive structure does not always erupt successfully, but sometimes fails to escape the Sun after initiation. The failure of an eruption, however, provides an invaluable opportunity for understanding the intricate mechanism of eruptions. We present a comprehensive observation of a failed prominence eruption on the Sun, taking advantage of multi-viewpoint and multi-messenger imaging. Simultaneous off-limb and on-disk observation gives evidence of magnetic reconnection processes occurring at different sites during the flare. Particularly, in addition to the standard flare reconnection behind the eruption, strong external reconnection occurs on the erupting flux rope, evidenced by a wealth of signatures via multi-wavelength imaging and spectroscopy. The two reconnection processes may play contrasting roles in the flux rope's acceleration and compete in altering the magnetic flux in the rope. As the high rate of external reconnection proceeds, the flux rope and embedded prominence decelerate noticeably and fail to erupt into the heliosphere, under strong magnetic confinement of overlying fields. Our results illustrate a well-defined physical picture for solar eruptive activities and provide insight into the lack of coronal mass ejections found in other solar-type stars.

2604.22650 2026-05-21 cond-mat.mes-hall

Strain engineering of Andreev spin qubits in Germanium

锗中Andreev自旋量子比特的应变工程

Vittorio Coppini, Patrick Del Vecchio, Antonio L. R. Manesco, Anton Akhmerov, Valla Fatemi, Bernard van Heck, Stefano Bosco

AI总结 本文研究了应变对锗中Andreev自旋量子比特的影响,提出通过无应变和拉应变异质结构增强自旋轨道效应,从而实现更高频率的自旋分裂和更快的量子门操作。

Comments 20 pages, 10 figures

详情
AI中文摘要

平面锗异质结构因其与超导体的兼容性、低材料散射和宽松的制备约束,成为混合量子设备的有前景的宿主。此外,锗潜在的低核自旋密度和强自旋轨道相互作用使其成为相干自旋物理的有吸引力材料。然而,最近的微波光谱实验未能解析锗结节 Josephson 结构中束缚态的自旋分裂,这是定义和控制Andreev自旋量子比特的前提。本文认为压缩应变是当前设备中抑制自旋分裂的关键机制。此外,我们提出与现有生长技术完全兼容的无应变和拉应变异质结构,显著增强了相关的自旋轨道效应。通过数值模拟球形Josephson结,我们预测自旋分裂在GHz范围内,比压缩应变情况大两个数量级,并且所有电量子门在百纳秒内。我们的结果确立了应变工程作为在基于锗的设备中实现Andreev自旋量子比特的关键设计原则。

英文摘要

Planar germanium heterostructures are promising hosts for hybrid quantum devices due to their compatibility with superconductors, low material disorder, and relaxed fabrication constraints. Also, the potentially low density of nuclear spins and strong spin-orbit interaction make germanium attractive for coherent spin physics. However, recent microwave spectroscopy experiments were unable to resolve a spin-splitting of bound states in germanium Josephson junctions, the prerequisite for defining and controlling Andreev spin qubits. Here, we argue that compressive strain is the key mechanism suppressing spin splitting in current devices. Furthermore, we propose unstrained and tensile-strained heterostructures, fully compatible with state-of-the-art growth technology, that significantly enhance the relevant spin-orbit effect. By numerically simulating ballistic Josephson junctions, we predict spin splittings comfortably in the GHz range, more than 2 orders of magnitude larger than compressively strained cases, and all-electric quantum gates in a hundred nanoseconds. Our results establish strain engineering as a key design principle for realizing Andreev spin qubits in germanium-based devices.

2604.20695 2026-05-21 math.DG

On $q$-convex hypersurfaces in Riemannian manifolds

关于Riemann流形中q-凸超曲面

Giulio Colombo, Christos-Raent Onti

AI总结 本文研究了Riemann流形中闭合凸超曲面的拓扑性质,证明在满足一定曲率条件时,此类超曲面是有限根本群的有理同调球体,同时给出了q-凸超曲面在平均曲率条件下的类似结论。

Comments 15 pages

详情
AI中文摘要

我们证明了任何在(n+1)维Riemann流形中闭合且凸的超曲面,若其曲率算子满足ceil(n/2)-正曲率条件,则其为具有有限根本群的有理同调球体。同样地,对于任何ceil(n/2)-凸超曲面,只要平均曲率满足尖锐的偏心条件,也得出相同结论。这两个结果均源于更一般的关于闭合q-凸浸入超曲面的Betti数消失和估计定理,这些定理在曲率算子最小(n-p)特征值的平均下界条件下成立。

英文摘要

We prove that any closed, convex hypersurface in an $(n+1)$-dimensional Riemannian manifold with $\lceil \frac{n}{2} \rceil$-positive curvature operator is a rational homology sphere with finite fundamental group. The same conclusion holds for any $\lceil \frac{n}{2} \rceil$-convex hypersurface, provided that the mean curvature satisfies a sharp pinching condition. Both results follow from more general vanishing and estimation theorems for the Betti numbers of closed $q$-convex immersed hypersurfaces in $(n+1)$-dimensional Riemannian manifolds, under a lower bound on the average of the smallest $(n-p)$ eigenvalues of the curvature operator.

2604.19169 2026-05-21 stat.ME

A Finite Mixture Failure-rate based Heterogeneous Step-stress Accelerated Life Testing (h-SSALT) Model

基于有限混合失败率的异质步应力加速寿命测试(h-SSALT)模型

Pranoy Palit, Ayan Pal, Kiran Prajapat

AI总结 本文提出一种基于有限混合失败率的异质步应力加速寿命测试模型,通过Weibull分布的II型截尾失效时间,允许在第二应力水平上通过有限混合的m个潜在子组产生异质性,利用期望最大化算法进行最大似然估计,并通过模拟研究验证了忽略异质性对寿命预测的系统性偏差。

Comments 44 pages, 7 figures, 12 tables. Version 2: we have added interval estimation using Louis' missing information method with transformation-based confidence intervals, and an additional real data analysis example

详情
AI中文摘要

传统步应力加速寿命测试模型假设测试单元来自同质群体。最近,Lu和Kateri(2025)提出了一种基于累积暴露的异质步应力加速寿命测试(SSALT)模型,以考虑同一生产批次中测试单元的非同质老化模式。本文引入了一种替代但灵活的基于失败率的异质简单步应力加速寿命测试(h-SSALT)模型,采用Weibull分布的II型截尾失效时间,允许通过m个潜在子组的有限混合在第二应力水平上产生异质性。开发了期望最大化算法用于模型参数的最大似然估计,利用来自未知群体成员资格和II型截尾的不完整数据结构。通过Louis(1982)的缺失信息身份进行区间估计,使用基于转换的置信区间尊重参数约束。广泛的模拟研究评估了所提出估计器的有限样本性能,并通过基于分位数的比较证明,忽略群体异质性会导致整个分位数范围内的寿命预测系统性偏差,最严重的后果出现在早期失效分位数上,这直接相关于保修期设计。通过特殊情形比较确认,所提出的Weibull失败率基于公式当形状参数等于1时退化为Lu和Kateri(2025)现有的模型,验证了所提出的框架作为适当推广的正确性。通过模拟和实际数据分析示例进一步展示了该模型的实际应用。

英文摘要

Traditional step-stress accelerated life testing models assume that test units originate from a homogeneous population. Recently, Lu and Kateri (2025) proposed a heterogeneous cumulative exposure based SSALT model to account for the inhomogeneous aging patterns among test units belonging to the same production batch. This paper introduces an alternative yet flexible failure-rate based heterogeneous simple SSALT (h-SSALT) model with Weibull-distributed Type-II censored failure times, allowing heterogeneity to emerge at the second stress level through a finite mixture of m latent subgroups, each characterized by its own failure behavior. The expectation-maximization algorithm is developed for maximum likelihood estimation of the model parameters, exploiting the incomplete data structure arising from both unknown group membership and Type-II censoring. Interval estimation is performed using the missing information identity of Louis (1982) with transformation-based confidence intervals respecting parameter constraints. An extensive simulation study evaluates the finite-sample performance of the proposed estimators and demonstrates, through a quantile-based comparison, that ignoring population heterogeneity leads to systematic bias in lifetime predictions across the entire quantile range, with the most severe consequences at early failure quantiles of direct relevance to warranty period design. A special case comparison confirms that the proposed Weibull failure-rate based formulation reduces to the existing model of Lu and Kateri (2025) when the shape parameter equals unity, validating the proposed framework as a proper generalization. The practical application of the model is further illustrated through simulated and real data analysis examples.

2604.18346 2026-05-21 math.CT math.GR

Implementing the biset category of finite groups

有限群的biset范畴的实现

Mohamed Barakat, Marc Talleux, Fabian Zickgraf

AI总结 本文提出了一种通过标准范畴构造的塔结构来实现有限群的biset范畴,并展示了该实现如何利用Kleisli范畴中的biadjunction monad来描述biset的复合,从而为Schreier-Sims轨道算法提供了优雅的范畴解释。

Comments Generalized content of Section 4.2, fixed typos, and polished several sentences

详情
AI中文摘要

我们描述了有限群的biset范畴作为标准范畴构造的塔的实现,所有这些构造都在算法范畴论软件项目CAP中实现。特别是,我们描述了biset的复合作为Kleisli范畴中某些biadjunction monad的复合。这种复合依赖于将群视为单对象群oid的余等化完成的普遍性质。表达这种普遍性质为Schreier-Sims轨道算法提供了优雅的范畴解释。事实上,该实现依赖于算法的每一个方面。

英文摘要

We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software projec t CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Expressing this universal property offers an elegant categorical interpretation of the Schreier-Sims orbit algorithm. Indeed, the implementation relies on every aspect of the algorithm.

2604.16191 2026-05-21 astro-ph.HE

High-Frequency Gravitational Waves from the Galactic Pulsar Population

银河脉冲星人口的高频引力波

Anne S. Freise, Jamie I. McDonald, Kirill Riabtsev, Samuel J. Witte

AI总结 研究通过考虑脉冲星极帽作为高频引力波源,探讨了由紧凑近表面等离子体间隙重复放电产生的引力波,提出了基于银河正常脉冲星人口的群体级信号,考虑了粒子-网格模拟和磁场波动的影响,发现高频带中的天体物理前景可能与早期宇宙等离子体信号重叠。

Comments This manuscript was submitted without knowledge or consent of ASF, JIM, or SJW

详情
AI中文摘要

高频引力波带通常主要在新物理的背景下讨论,但标准模型前景仍未完全描述。我们研究脉冲星极帽作为天体物理高频引力波源,由紧凑近表面等离子体间隙的重复放电产生。我们的基线结果是群体级的:我们从银河正常脉冲星人口构建信号,而非单个特别有利的对象。为此,我们通过粒子-网格模拟校准源动态,将物理脉冲星参数直接映射到数值尺度,并将解析的纵向放电提升为帽尺度发射模型。引力波信号在完整的傅里叶空间框架中计算,保留有限源、几何和极化效应。在此处理中,主导贡献不是某些早期简化方法强调的纯电通道,而是一个涉及大背景磁场和放电引起的磁场横向波动的源通道。在正常脉冲星人口中整合此描述,我们发现MHz尺度高频带中的天体物理前景可能与早期宇宙等离子体源的热引力波信号重叠。同时,归一化仍对建模假设敏感。尽管预测的应变远低于当前实验灵敏度,但脉冲星极帽在通常被视为近背景自由的频带中提供了标准模型前景的基准。其他源配置进一步拓宽了该基线周围的可能信号范围。

英文摘要

The high-frequency gravitational-wave band is often discussed primarily in the context of new physics, but realistic Standard-Model foregrounds remain incompletely characterized. We investigate pulsar polar caps as a physically motivated astrophysical source of high-frequency gravitational waves, generated by repeated discharge cycles in compact near-surface plasma gaps. Our baseline result is population-level: we construct the signal from the Galactic normal-pulsar population rather than from a single especially favorable object. To do so, we calibrate the source dynamics with particle-in-cell simulations performed at real physical scales, with physical pulsar parameters mapped directly onto numerical scales, and then lift the resolved longitudinal discharge to a cap-scale emission model. The gravitational-wave signal is computed in a full Fourier-space framework, retaining finite-source, geometric, and polarization effects explicitly. Within this treatment, the dominant contribution is not the purely electric channel emphasized in some earlier simplified approaches, but a source channel involving the large background magnetic field and discharge-induced transverse fluctuations of magnetic field. Integrating this description over a normal-pulsar population, we find an astrophysical foreground in the MHz-scale high-frequency band that can overlap with and partially obscure the thermal gravitational-wave signal sourced by the plasma of the early Universe. At the same time, the normalization remains sensitive to the modeled assumptions. Although the predicted strain remains far below current experimental sensitivity, pulsar polar caps provide a concrete Standard-Model foreground benchmark in a band often treated as nearly background-free. Alternative source configurations further broaden the plausible signal range around this baseline.

2604.11474 2026-05-21 hep-th gr-qc

`Seeing' the quantum ripples of spacetime

看见时空的量子涟漪

Soham Sen, Vlatko Vedral

AI总结 本文提出了一种通过量子谐振子阵列发射光子来检测引力子的新方法,并展示了如何通过泵浦低频光子增强探测器的跃迁概率,从而可视化引力子的影响,并推翻了Dyson关于引力子不可探测性的论点。

Comments 8 pages LATEX, Comments are welcome. Om Thakur Ma

详情
AI中文摘要

我们提出了一种新颖的检测引力子的方法,即通过在腔体中放置一个带电的量子谐振子阵列,利用低频光子泵浦腔体时发射的光子来检测引力子。我们观察到,当探测器处于基态时,单个引力子被探测器吸收,同时探测器跃迁一个能级并发射一个光子。我们还发现,当探测器从高能级退激时,它会自发发射高频引力子,通过吸收单个光子。这一分析结果促使我们提出一个非常简单的台式引力子探测器模型,因为通过在系统初始态中泵浦光子可以显著增强跃迁概率。这种机制为我们提供了一种物理方法来“可视化”引力子对相对论系统的影响。我们还展示了通过我们提出的引力子探测器可以完全推翻Dyson关于引力子不可探测性的原始论点。

英文摘要

We propose a novel way of detecting gravitons using emission of photons from charged array of quantum harmonic oscillators placed inside of a cavity while the cavity is being pumped with low frequency photons. We observe that when the detector is in its ground state, a single graviton is absorbed by the detector while it jumps a single energy level by simultaneously emitting a photon. We also observe that while the detector de-excites from an higher energy level, it spontaneously emits a high frequency graviton, by absorbing a single photon. This analytical outcome encourages us to propose a very simple tabletop graviton detector model as the transition probabilities can be significantly enhanced by pumping photons in the initial state of the system. This mechanism gives us a physical way to `visualize' the effect of gravitons with a relativistic system. We also show that Dyson's original argument on the non-detectability of gravitons can be completely circumvented using our proposed graviton detector.

2604.05783 2026-05-21 quant-ph physics.atom-ph physics.optics

Nonlinear atomic tunnelling boosted by bright squeezed vacuum

非线性原子隧穿效应通过明亮压缩真空增强

Zhejun Jiang, Shengzhe Pan, Jianqi Chen, Mingyu Zhu, Chenhao Zhao, Yiwen Wang, Ru Zhang, Jianshi Lu, Lulu Han, Suwen Xiong, Dian Wu, Wenxue Li, Shicheng Jiang, Hongcheng Ni, Jian Wu

AI总结 该研究通过量子光——明亮压缩真空(BSV)增强了孤立原子的非线性隧穿电离,展示了通过量子统计而非经典强度缩放来调控非线性过程的方法。

详情
Journal ref
Nature (2026)
AI中文摘要

非线性光学过程,通过多光子相互作用而非单光子响应来介导,通常被用于在设备和应用中实现各种基于光的功能。非线性效应通过更高强度的场增强,但这是由于潜在的辐射损伤而成为限制策略。另一种策略依赖于量子光中典型的波动重新分布,但实验在最根本层面的演示受到限制。在这里,我们报告了通过量子光——明亮压缩真空(BSV)增强的孤立原子的非线性隧穿电离,这是驱动高谐波生成并构成阿秒科学基础的关键非线性过程。具有平均脉冲能量300 nJ的BSV光实现了等效于7.1 μJ相干光的强度,证明了BSV光比相干光在非线性效应上提高了超过20倍的量子增强。这种增强通过匹配由BSV和相干光产生的光电子动量谱的峰值,利用角 streaking 技术揭示。此外,我们通过调节相关函数在固定平均脉冲能量下调节BSV的有效强度,建立了一种通过量子统计而非经典强度缩放来调节非线性过程的稳健方法。这些发现可能促进利用定制量子光源开发量子控制的强场动力学。

英文摘要

Nonlinear optical processes, mediated by multiphoton interactions rather than single-photon response, are routinely exploited to enable a range of light-based functionalities in devices and applications. Nonlinear effects are enhanced through higher intensity fields, which is a limiting strategy owing to potential radiation damage. An alternative strategy relies on the fluctuation redistribution typical of quantum light, but experimental demonstrations at the most fundamental level have been limited. Here we report experimental nonlinear tunnelling ionization of isolated atoms, a pivotal nonlinear process that drives high-harmonic generation and forms the basis of attosecond science, boosted by quantum light -- bright squeezed vacuum (BSV). A BSV light with an average pulse energy of 300 nJ achieves an effective intensity equivalent to that of a coherent light with 7.1 {\textmu}J, demonstrating a more than 20-fold quantum boost in nonlinear effect from BSV light. This boost is revealed by matching the peaks of the photoelectron momentum spectra produced by the BSV and coherent light using angular streaking. Furthermore, we demonstrate control of the effective intensity of the BSV by tuning the correlation function at fixed average pulse energy, establishing a robust method to tailor nonlinear processes via quantum statistics rather than classical intensity scaling. These findings may facilitate the development of quantum-controlled strong-field dynamics using tailored quantum light sources.

2603.21202 2026-05-21 physics.atom-ph

$T^{-3}$-shift in a short-baseline atomic interferometer-gravimeter

短基线原子干涉仪重力仪中的$T^{-3}$位移

D. N. Kapusta, A. E. Bonert, A. N. Goncharov, V. I. Yudin, K. N. Adamov, A. V. Taichenachev, M. Yu. Basalaev, M. D. Radchenko, O. N. Prudnikov

AI总结 该研究首次实验观测并分析了短基线原子干涉仪重力仪中由线形不对称性引起的位移,发现该位移与自由演化时间的立方成反比,可能导致重力加速度g的测量值出现0.1-1 mGal的系统误差,结果与之前的理论研究一致,强调了在紧凑型原子重力仪中考虑该位移的重要性。

Comments 5 pages, 3 figures

详情
Journal ref
JETP Letters 123, 388 (2026)
AI中文摘要

本文首次实验观测并研究了短基线原子干涉仪重力仪中由线形不对称性引起的位移(LACS)。研究表明,该位移与自由演化时间的立方成反比($\propto T^{-3}$),并在毫秒级的自由演化时间下可能引起重力加速度g的测量值出现0.1至1 mGal的显著系统误差。获得的结果与我们之前的理论研究结果一致,强调了在高精度绝对g测量中考虑LACS的重要性。

英文摘要

This paper presents the first experimental observation and investigation of a lineshape-asymmetry-caused shift (LACS) in a short-baseline atomic interferometer-gravimeter. It is shown that this shift scales inversely with the cube of the free evolution time, $\propto T^{-3}$, and can lead to a noticeable systematic error in the measured value of the gravitational acceleration g at the level of 0.1-1 mGal ($T\approx$ milliseconds). The obtained results are in good agreement with our previous theoretical studies and highlight the importance of accounting for LACS in high-precision absolute measurements of g in compact atomic gravimeters.

2603.17091 2026-05-21 math.DS

On quantization and the classical variational principle for the metric mean dimension

关于度量均维的度量与经典变分原理

Maria Carvalho, Gustavo Pessil

AI总结 本文研究了测度量化与拓扑动力系统度量均维之间的关系,提出了不变概率测度的均量化维度概念,并建立了经典变分原理:动力系统的度量均维等于所有不变测度中最大均量化维度。该方法有效表征了具有无限熵系统的复杂性,并通过识别一个能捕捉所有尺度信息的测度,实现了Lindenstrauss-Tsukamoto变分原理中极限与上确界的交换,这一特性大多数已知的熵类映射无法实现。然而,本文证明Katok和Shapira熵满足这一性质,因此建立了度量均维的经典变分原理,其中最大测度始终存在。

详情
AI中文摘要

本文研究了测度量化与拓扑动力系统度量均维之间的关系。我们引入了不变概率测度的均量化维度概念,并建立了经典变分原理:动力系统的度量均维等于所有不变测度中最大均量化维度。该方法有效表征了具有无限熵系统的复杂性,通过识别一个能捕捉所有尺度信息的测度;并且获得了一个基本性质,允许在Lindenstrauss-Tsukamoto变分原理中交换极限与上确界,这一特性大多数已知的熵类映射无法实现,因为存在凸性限制。然而,我们证明Katok和Shapira熵确实满足这一性质,因此建立了度量均维的经典变分原理,其中最大化测度始终存在。

英文摘要

This paper investigates the relationship between quantization of measures and metric mean dimension of topological dynamical systems. We introduce the concept of mean quantization dimension for invariant probability measures and establish a classical variational principle: the metric mean dimension of a dynamical system is equal to the maximum mean quantization dimension among all invariant measures. This approach effectively characterizes the complexity of systems with infinite entropy by identifying a measure that captures information across all scales; and yields a fundamental property that allows for the exchange of limits and suprema in the Lindenstrauss-Tsukamoto variational principles, a feat that most known entropy-like maps fail to achieve due to convexity. Nevertheless, we show that the Katok and Shapira entropies do satisfy this property and, therefore, a classical variational principle for the metric mean dimension, for which maximizing measures always exist.

2603.12203 2026-05-21 quant-ph

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

稀疏相位假设用于通过SNAP位移协议实现资源高效的量子态制备

Maurizio Ferrari Dacrema, Doga Murat Kurkcuoglu, Andy C. Y. Li, Tanay Roy, Silvia Zorzetti

AI总结 本文研究了利用SNAP位移协议在玻色子量子比特系统中实现资源高效的量子态制备,提出三种逐步更一般的稀疏假设,通过标量多目标优化在保真度与相位数量或假设持续时间之间进行权衡,展示了在理想和噪声环境下稀疏假设相较于完全参数化SD协议的优势。

Comments Source code available at: https://github.com/qcpolimi/SparseSDAnsatz

详情
AI中文摘要

高效制备非经典玻色子态是量子计算、模拟和精密计量的核心要求。我们研究了利用SNAP位移(SD)协议在玻色子量子比特系统中实现资源高效的量子态制备。现有的SD基方法通常需要大量的门和SNAP相位,导致复杂的控制脉冲,具有更长的假设持续时间和放大光子损失和控制误差的影响。在本工作中,我们关注近中期的 regime,其中嘈杂的量子设备对能实现的保真度施加了权衡,必须予以考虑。具体而言,我们提出仅优化SNAP相位的一部分,并引入三种逐步更一般的稀疏假设。为了提供细粒度控制并识别最适合给定目标保真度的假设,我们进一步采用标量化的多目标优化,在保真度与相位数量或假设持续时间之间进行权衡。对多个目标态和量子比特维度高达d=64的数值结果,通过Pareto前沿的超体积进行了评估,显示这些稀疏假设在理想和嘈杂环境下均在SD协议完全参数化的情况下实现了有利的权衡。当最小化相位数量时,优势最强且最一致,而假设持续时间的改进较小且更依赖于目标态族和噪声水平,表明了一条通往更高效近中期玻色子态制备的实用路线。

英文摘要

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

2603.10673 2026-05-21 cs.IR

Breaking User-Centric Agency: A Tri-Party Framework for Agent-Based Recommendation

打破以用户为中心的代理:一个三方框架用于基于代理的推荐

Yaxin Gong, Chongming Gao, Chenxiao Fan, Haoyan Liu, Wenjie Wang, Jianshan Sun, Yangyang Li, Fuli Feng, Xiangnan He

AI总结 本文提出一个三方框架TriRec,用于基于代理的推荐系统,旨在协调用户效用、物品曝光和平台层面的公平性,从而提高推荐系统的准确性和公平性。

详情
AI中文摘要

近年来,大语言模型(LLMs)的进展激发了对基于代理的推荐系统日益增长的兴趣,使语言驱动的交互和推理成为可能,从而实现更丰富的偏好建模。然而,大多数现有的代理方法仍然主要以用户为中心,将物品视为被动实体,并忽视了其他关键利益相关者的利益。这种限制加剧了曝光集中和长尾不足代表,威胁着长期系统的可持续性。在本文中,我们识别了这一基本限制,并提出了第一个三方LLM代理推荐框架(TriRec),该框架明确协调用户效用、物品曝光和平台层面的公平性。该框架采用两阶段架构:阶段1赋予物品代理以个性化自我推广,以提高匹配质量并缓解冷启动障碍,而阶段2则进行平台层面的顺序多目标重新排序,平衡用户相关性、物品效用和曝光公平性。实验表明,在准确性、公平性和物品层面效用方面均获得一致提升。此外,我们发现物品自我推广可以同时提高公平性和有效性,挑战了传统相关性与公平性之间的传统权衡假设。我们的代码可在https://github.com/Marfekey/TriRec上获得。

英文摘要

Recent advances in large language models (LLMs) have stimulated growing interest in agent-based recommender systems, enabling language-driven interaction and reasoning for more expressive preference modeling. However, most existing agentic approaches remain predominantly user-centric, treating items as passive entities and neglecting the interests of other critical stakeholders. This limitation exacerbates exposure concentration and long-tail under-representation, threatening long-term system sustainability. In this work, we identify this fundamental limitation and propose the first Tri-party LLM-agent Recommendation framework (TriRec) that explicitly coordinates user utility, item exposure, and platform-level fairness. The framework employs a two-stage architecture: Stage 1 empowers item agents with personalized self-promotion to improve matching quality and alleviate cold-start barriers, while Stage 2 performs platform-level sequential multi-objective re-ranking, balancing user relevance, item utility, and exposure fairness. Experiments show consistent gains in accuracy, fairness, and item-level utility. Moreover, we find that item self-promotion can simultaneously enhance fairness and effectiveness, challenging the conventional trade-off assumption between relevance and fairness. Our code is available at https://github.com/Marfekey/TriRec.

2603.10015 2026-05-21 cs.CY econ.GN q-fin.EC

The coordination gap in frontier AI safety policies

前沿人工智能安全政策中的协调缺口

Isaak Mengesha

AI总结 本文探讨了前沿人工智能安全政策在预防措施之外的协调能力不足问题,提出通过借鉴核安全、疫情准备和关键基础设施中的机制来改进人工智能治理。

详情
AI中文摘要

前沿人工智能安全政策集中于预防:能力评估、部署门禁和使用限制,而忽视了在预防失败时协调响应的能力。我们认为这种协调缺口是结构性的:生态系统韧性投资带来的利益分散但成本集中,导致系统性投资不足。借鉴核安全、疫情准备和关键基础设施中的风险制度,我们提出类似的机制(预承诺、共享协议、常设协调场所)可以应用于前沿人工智能治理。弥合这一缺口需要跨主体的'事先信息交换',分享事先的'如果-那么'响应逻辑,不仅暴露触发条件,还暴露将信号转化为行动的决策过程。没有这种架构,机构无法以相关性速度从失败中学习。

英文摘要

Frontier AI Safety Policies concentrate on prevention: capability evaluations, deployment gates, and usage constraints, while neglecting the capacity to coordinate responses when prevention fails. We argue this coordination gap is structural: investments in ecosystem robustness yield diffuse benefits but concentrated costs, generating systematic underinvestment. Drawing on risk regimes in nuclear safety, pandemic preparedness, and critical infrastructure, we propose that similar mechanisms (precommitment, shared protocols, standing coordination venues) could be adapted to frontier AI governance. Closing the gap requires cross-actor "note-exchange" of ex ante if-then response logic, exposing not only triggers but the decision processes that convert signals into actions. Without such architecture, institutions cannot learn from failures at the pace of relevance.

2603.08710 2026-05-21 cond-mat.str-el

Thermal and quantum fluctuations in extended Kitaev-Yao-Lee spin-orbital model

扩展的Kitaev-Yao-Lee自旋-轨道模型中的热力学和量子涨落

Jiefu Cen, Hae-Young Kee

AI总结 本文研究了扩展的Kitaev-Yao-Lee自旋-轨道模型中弹性和稳定性问题,通过热力学和量子涨落分析揭示了nematic相的起源和稳定性。

Comments 10 pages, 5 figures

详情
Journal ref
Phys. Rev. B 113, 174430 (2026)
AI中文摘要

在蜂窝晶格上的自旋-1/2 Kitaev模型基础上,Yao-Lee自旋-轨道模型提供了可解的量子自旋液体,由于额外的自由度,其可能更稳定地抵抗扰动。最近,蜂窝材料中Yao-Lee相互作用的微观机制已被揭示,当包含著名的Kugel-Khomskii相互作用时,形成了扩展的Kitaev-Yao-Lee自旋-轨道模型。对该模型的数值研究确定了各种无序相,包括一个宽广的具有类似自旋-轨道液体特征的nematic相。本文通过经典蒙特卡罗模拟和适用于自旋-轨道模型的广义自旋波理论,研究了该nematic相的起源和稳定性。我们证明了额外的自旋-轨道自由度在自旋-轨道模型中导致强烈的热力学和量子涨落,为无序相的出现提供了见解。

英文摘要

Building upon the spin-1/2 Kitaev model on a honeycomb lattice, the Yao-Lee spin-orbital model provides exactly solvable quantum spin liquids with potentially better stability against perturbations due to the additional degree of freedom. Recently, the microscopic mechanism underlying the Yao-Lee interaction in honeycomb materials has been uncovered, leading to an extended Kitaev-Yao-Lee spin-orbital model when the celebrated Kugel-Khomskii interaction is included. Numerical studies of this model have identified various disordered phases, including a broad region of the nematic phase that is reminiscent of a spin-orbital liquid. Here, we investigate the origin and stability of this nematic phase via thermal and quantum fluctuations using classical Monte Carlo simulations and a generalized spin wave theory appropriate for the spin-orbital model. We demonstrate that the additional spin-orbital degree of freedom gives rise to strong thermal and quantum fluctuations in spin-orbital models, providing insight into the emergence of disordered phases.

2603.07732 2026-05-21 physics.optics cond-mat.mes-hall physics.app-ph quant-ph

Geometry-Controlled Exciton Selectivity in Monolayer MoS2 Using Plasmonic Hollow Nanocavities

利用等离子体空心纳米腔体调控单层MoS2的激子选择性

Abdullah Efe Yildiz, Emre Ozan Polat

AI总结 本文研究了通过等离子体空心纳米腔体调控单层MoS2中激子选择性的方法,通过优化腔体参数实现了对A和B激子的增强发射和电荷生成控制,展示了其在原子级薄半导体中的应用潜力。

Comments 21 Pages of main text, 4 Main Figures, 4 pages of Supplementary Information, 4 Supplementary Figures

详情
AI中文摘要

近场调控紧密间隔的激子跃迁对于谷光子学、纳米尺度光源和波长编码传感至关重要。在单层二硫化钼(MoS2)中,A和B激子仅相差几十毫电子伏,使得选择性激子发射控制在基础研究和技术应用上都具有重要性。本文通过数值研究单层MoS2与垂直取向的空心金纳米圆柱腔体通过介电间隔耦合的等离子体增强激子发射。有限差分时域模拟结合光致发光速率框架能够分别评估激发增强、辐射衰减修改、非辐射淬灭和激子电荷生成。通过调节腔体长宽比,可将局域表面等离子体共振选择性地对准A或B激子跃迁,而间隔厚度和折射率调节近场耦合和局部光子密度。在优化条件下,激发率可提高4.34倍,辐射衰减率可提高40倍以上,分别产生143.85和87.27的A和B激子光致发光增强。腔体还重新分布了相对激子峰值强度,产生激子选择性峰值比,比裸MoS2高2.4倍。这些结果确立了空心等离子体纳米腔体作为可调几何平台,用于原子级薄半导体中激子选择性发射和电荷生成控制。

英文摘要

Spectral control of closely spaced excitonic transitions is central to valleytronic photonics, nanoscale light sources, and wavelength-encoded sensing. In monolayer molybdenum disulfide (MoS2), the A and B excitons are separated by only tens of meV, making selective excitonic emission control both fundamentally important and technologically challenging. Here, we numerically investigate plasmon-enhanced excitonic emission from monolayer MoS2 coupled to vertically oriented hollow gold nanocylindrical cavities through a dielectric spacer. Finite-difference time-domain simulations combined with a photoluminescence-rate framework enable separate evaluation of excitation enhancement, radiative decay modification, nonradiative quenching, and excitonic charge generation. By tuning the cavity aspect ratio, the localized surface plasmon resonance is selectively aligned with either the A- or B-exciton transition, while the spacer thickness and refractive index regulate near-field coupling and the local density of optical states. Under optimized conditions, the excitation rate is enhanced by up to 4.34-fold and the radiative decay rate by more than 40-fold, yielding photoluminescence enhancements of 143.85 and 87.27 for the A and B excitons, respectively. The cavity also redistributes the relative excitonic peak intensities, producing exciton-selective peak ratios up to 2.4 times higher than those of bare MoS2. These results establish hollow plasmonic nanocavities as geometry-tunable platforms for exciton-selective emission and charge-generation control in atomically thin semiconductors.

2603.06871 2026-05-21 stat.ME stat.AP stat.CO stat.OT

Adaptive Bi-Level Variable Selection of Conditional Main Effects for Generalized Linear Models

适应性双层条件主效应变量选择用于广义线性模型

Kexin Xie, Xinwei Deng

AI总结 本文提出了一种适应性cmenet方法,用于在广义线性模型框架下进行条件主效应变量选择,通过自适应权重的惩罚似然方法改进了双层变量选择,同时开发了高效的参数估计算法,并通过模拟研究和基因关联分析的实证研究评估了方法性能。

详情
AI中文摘要

理解变量间的交互效应对于各种应用中的回归建模至关重要。传统的将交互效应量化为变量乘积的方法往往缺乏清晰的可解释性,尤其是在复杂系统中。条件主效应(CME)的概念提供了一个更直观和可解释的框架,通过量化一个变量在另一个变量水平下的效应来捕捉交互效应。最近提出的一种称为cmenet的方法进一步考虑了CME的双层选择,通过利用其自然分组结构(例如兄弟和堂兄弟组)通过惩罚来实现。然而,cmenet方法存在一些局限性,包括组内CME的惩罚耦合能力、组间惩罚的缺乏适应性以及仅限于具有连续响应的线性模型。为克服这些限制,我们提出了一种适应性cmenet方法,用于在广义线性模型(GLM)框架下进行CME选择。所提出的方法考虑了一种带有自适应权重的惩罚似然方法,以实现有效的双层变量选择,提高组间和组内选择的效果。还开发了通过迭代加权最小二乘法进行参数估计的高效算法。所提出方法的性能通过模拟研究和基因关联分析的实证研究进行了评估。

英文摘要

Understanding interaction effects among variables is important for regression modeling in various applications. The conventional approach of quantifying interactions as the product of variables often lacks clear interpretability, especially in complex systems. The concept of conditional main effects (CME) provides a more intuitive and interpretable framework for capturing interaction effects by quantifying the effect of one variable conditional on the level of another. A recent method called cmenet further considered the bi-level selection of CMEs by leveraging their natural grouping structure (e.g., sibling and cousin groups) through penalization. However, there are several limitations in the cmenet method, including the coupling ability of penalties for within-group CMEs, lack of adaptiveness for between-group penalties, and restriction to linear models with continuous responses. To overcome these limitations, we propose an adaptive cmenet method for CME selection under the generalized linear model (GLM) framework. The proposed method considers a penalized likelihood approach with adaptive weights to enable effective bi-level variable selection, improving both between-group and within-group selection. An efficient algorithm for parameter estimation is also developed by employing an iteratively reweighted least squares procedure. The performance of the proposed method is evaluated by both simulation studies and real-data studies in gene association analysis.

2603.04970 2026-05-21 quant-ph

Uniform process tensor approach for the calculation of multi-time correlation functions of non-Markovian open systems

均匀时间演化矩阵积算符方法用于非马尔可夫开放系统的多时间关联函数计算

Matteo Garbellini, Konrad Mickiewicz, Valentin Link, Alexander Eisfeld, Walter T. Strunz

AI总结 本文提出了一种基于均匀时间演化矩阵积算符方法的均匀过程张量方法,用于高效计算非马尔可夫开放系统的多时间关联函数,通过矩阵积算符压缩表示提高了多维谱的数值计算效率。

详情
AI中文摘要

过程张量框架为开放量子系统提供了多时间关联函数在非马尔可夫量子动力学中最一般的描述。通过矩阵积算符(MPO)对过程张量进行压缩表示,可以用于强耦合非马尔可夫热库系统的多时间关联函数的精确数值计算。本文展示,使用从均匀时间演化矩阵积算符(uniTEMPO)方法获得的具有时间平移不变性的MPO表示,可以显著提高多维谱的数值计算效率。特别是,这种方法提供了非马尔可夫动力学的谱表示,可以直接在傅里叶空间访问关联函数,避免了显式实时演化。我们计算了一个示例系统的线性和二维电子谱,并讨论了我们模拟的性能和数值标度。

英文摘要

The process tensor framework to open quantum systems provides the most general description of multi-time correlations in non-Markovian quantum dynamics. A compressed representation of a process tensor in terms of matrix product operators (MPO) can be used for numerically exact calculations of multi-time correlation functions in systems strongly coupled to a non-Markovian reservoir. We show here that the numerical scaling for computing multi-dimensional spectra can be significantly improved using a time-translation invariant MPO representation of the process tensor obtained from the uniform time-evolving matrix product operator (uniTEMPO) method. In particular, this approach provides a spectral representation of the non-Markovian dynamics that gives direct access to correlation functions in Fourier-space, avoiding explicit real-time evolution. We calculate linear and 2D electronic spectra for an example system and discuss the performance and numerical scaling of our simulations.