Enhanced Mid-Infrared Single-Photon Detection with Antenna-Coupled Superconducting Nanowires Authors Dip Joti Paul, Stewart Koppell, Gregor G. Taylor, Boris Korzh, Sahil R. Patel, Andrew D. Beyer, Emma E. Wollman, Matthew D. Shaw, Phillip D. Keathley, Karl K. Berggren Published: 04.20.2026 Updated: 04.20.2026 Summary Scaling the photon-detection area of superconducting nanowire single-photon detectors (SNSPDs) has traditionally been achieved by nanowire meandering. However, material inhomogeneities and fabrication-induced defects, such as line-edge roughness, increase with nanowire length, leading to reduced internal photon-detection efficiency and elevated dark-count rates. This trade-off becomes increasingly pronounced as nanowires are scaled to sub-100 nm widths and sub-5 nm thicknesses required for mid- to far-infrared sensitivity. Here, we demonstrate an antenna-coupled SNSPD architecture that enhances the effective photon-detection area without increasing nanowire length. A crossed bowtie antenna integrated with an 80 nm-wide, 3 nm-thick WSi nanowire yields 15.7$times$ increase in effective detection area at 7.4 $μ$m compared to a bare nanowire of identical geometric footprint, while maintaining the same internal detection efficiency and dark-count rate. Antenna coupling improves noise-equivalent power and provides a more scalable route to increasing photon-detection area than conventional meander geometries, offering performance benefits for applications in astronomy, biological imaging, and molecular spectroscopy. Source arXiv: 2604.18155v1
Resource-Efficient Quantum-Enhanced Compressive Imaging via Quantum Classical co-Design Authors Haowei Shi, Visuttha Manthamkarn, Christopher M. Jones, Zheshen Zhang, Quntao Zhuang Published: 04.17.2026 Updated: 04.17.2026 Summary Quantum sensing can enhance imaging performance by reducing measurement noise below the classical limit, thereby improving the signal-to-noise ratio (SNR) of acquired data. In conventional quantum imaging schemes, squeezing is applied independently to each pixel or spatial mode, leading to a quantum resource cost that scales linearly with image dimension. This approach implicitly separates quantum enhancement from classical post-processing, treating them as independent layers. In this work, we demonstrate that integrating quantum resource allocation with the guidance from classical compressive imaging, via co-design between the quantum hardware layer and the classical software layer, substantially reduces the required quantum resources. We employ principal component analysis (PCA) to identify a low-dimensional principal component subspace for measurement and apply squeezing selectively to the most informative spatial modes corresponding to these principal components. Our numerical experiments show that high-accuracy image classification and high-fidelity image reconstruction can be achieved with significantly fewer squeezed modes compared to pixel-wise squeezing. Our results establish a joint quantum classical co-design framework for resource-efficient quantum-enhanced imaging. Source arXiv: 2604.16662v1
Noise factor of Brillouin amplifiers Authors John H. Dallyn, Nils T. Otterstrom, Matt Eichenfield, Peter T. Rakich, Ryan O. Behunin Published: 04.14.2026 Updated: 04.14.2026 Summary Stimulated Brillouin scattering (SBS), an optical nonlinearity arising from photon-phonon interactions, has formed the basis for a large class of optical signal processing devices, including Brillouin amplifiers. A limiting factor of such amplifiers is the noise due to thermal-mechanical fluctuations that the phonons imprint on the optical signal. Prior work has either inferred or experimentally observed a noise factor ($F$) that depends only on the thermal occupation of the phonons ($Fapprox 1+n_{th}$). We show that this noise factor results naturally from a Hamiltonian-based spatio-temporal coupled mode treatment in the limit of large Brillouin amplification and when phonon propagation is neglected. Moreover, this theoretical framework allows us to extend our treatment to a much larger and more representative parameter space for emerging SBS systems; specifically, this analysis accounts for the forward or backward nature of the scattering process and the effects of phonon propagation, optical loss, and small Brillouin gains. Our results demonstrate that the noise factor can deviate radically from $Fapprox 1+n_{th}$ for a host of modern SBS devices, especially those in which phonon propagation significantly changes the coupled mode dynamics. Source arXiv: 2604.12906v1
Three-body interactions in Rydberg lattices Authors Rhine Samajdar, Mikhail D. Lukin, Valentin Walther Published: 04.13.2026 Updated: 04.13.2026 Summary Programmable arrays of neutral Rydberg atoms are one of the leading platforms today for scalable quantum simulation and computation. In these systems, the dipole-dipole interactions between the individual atoms, or qubits, typically result in binary — i.e., two-body — couplings. In this work, we develop an experimentally accessible scheme for engineering three-body interactions in Rydberg lattices. Such strong three-body couplings can fundamentally modify the underlying physics compared to systems with only two-body interactions: we demonstrate this, in particular, by systematically investigating the effective many-body Hamiltonian and its emergent quantum phases. This capability paves the way for the quantum simulation of a broader class of correlated models of condensed matter and high-energy physics. Source arXiv: 2604.11870v1
Scalable Neural Decoders for Practical Fault-Tolerant Quantum Computation Authors Andi Gu, J. Pablo Bonilla Ataides, Mikhail D. Lukin, Susanne F. Yelin Published: 04.09.2026 Updated: 04.09.2026 Summary Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have recently emerged as a promising route to efficient fault tolerance, current decoding algorithms do not allow one to realize the full potential of these codes in practical settings. Here, we introduce a convolutional neural network decoder that exploits the geometric structure of QEC codes, and use it to probe a novel “waterfall” regime of error suppression, demonstrating that the logical error rates required for large-scale fault-tolerant algorithms are attainable with modest code sizes at current physical error rates, and with latencies within the real-time budgets of several leading hardware platforms. For example, for the $[144, 12, 12]$ Gross code, the decoder achieves logical error rates up to $sim 17$x below existing decoders – reaching logical error rates $sim 10^{-10}$ at physical error $p=0.1%$ – with 3-5 orders of magnitude higher throughput. This decoder also produces well-calibrated confidence estimates that can significantly reduce the time overhead of repeat-until-success protocols. Taken together, these results suggest that the space-time costs associated with fault-tolerant quantum computation may be significantly lower than previously anticipated. Source arXiv: 2604.08358v1
A Family of Open Time-Series Foundation Models for the Radio Access Network Authors Ioannis Panitsas, Leandros Tassiulas Published: 04.05.2026 Updated: 04.05.2026 Summary The Radio Access Network (RAN) is evolving into a programmable and disaggregated infrastructure that increasingly relies on AI-native algorithms for optimization and closed-loop control. However, current RAN intelligence is still largely built from task-specific models tailored to individual functions, resulting in model fragmentation, limited knowledge sharing across tasks, poor generalization, and increased system complexity. To address these limitations, we introduce TimeRAN, a unified multi-task learning framework for time-series modeling in the RAN. TimeRAN leverages a lightweight time-series foundation model with few task-specific heads to learn transferable representations that can be efficiently adapted across diverse tasks with limited supervision. To enable large-scale pretraining, we further curate and open-source TimeRAN DataPile, the largest time-series corpus for RAN analytics to date, comprising over 355K time series and 0.56B measurements across diverse telemetry sources, protocol layers, and deployment scenarios. We evaluate TimeRAN across a comprehensive set of RAN analytics tasks, including anomaly detection, classification, forecasting, and imputation, and show that it achieves state-of-the-art performance with minimal or no task-specific fine-tuning. Finally, we integrate TimeRAN into a proof-of-concept 5G testbed and demonstrate that it operates efficiently with limited resource requirements in real-world scenarios. Source arXiv: 2604.04271v1
Understanding Intrinsic Loss in Thin-Film Lithium Niobate Ring Resonators via Adiabatic Coupling Authors Xinrui Zhu, Hana K. Warner, Yunxiang Song, Donald Witt, Marko Loncar Published: 04.02.2026 Updated: 04.02.2026 Summary Thin-film lithium niobate (TFLN) has emerged as a versatile integrated photonics platform, combining strong electro-optic and nonlinear effects. Among TFLN devices, ring resonators play a central role in filtering, modulation, and nonlinear optical processes. However, intrinsic loss, which ultimately limits ring performance, is most often summarized by single-valued metrics, and its statistical variability across resonances has received limited attention. Here, we show that intrinsic loss rates in monolithic TFLN ring resonators follow a statistical distribution, comprising a baseline loss and a tail arising from discrete loss events. This behavior is revealed by characterizing 2233 resonances, using an adiabatic waveguide-ring coupling architecture that selectively excites the fundamental mode and yields clean spectra in the ultra-high-Qi regime. We find the most probable intrinsic loss rate ki = 2 pi x 10.4 MHz, indicating operation in a low-loss regime comparable to state-of-the-art thick silicon nitride platforms. Source arXiv: 2604.01922v1
Unlocking Open-Player-Modeling-enhanced Game-Based Learning: The Open Player Socially Analytical Intelligence Architecture Authors Zhiyu Lin, Boyd Fox, Devon Mckee, Sai Siddartha Maram, Jiahong Li, Tyler Sorensen, Brian K. Smith, Roger Azevedo, Jichen Zhu, Magy Seif El-Nasr Published: 03.27.2026 Updated: 03.27.2026 Summary Game-Based Learning (GBL) is a learner-engaging pedagogical methodology, yet adapting games to heterogeneous learners requires transparent, real-time Open Player Models (OPMs). We contribute to the community Open Player Socially Analytical Intelligence (OPSAI), an architecture implementing OPM beyond conceptual frameworks and validated in a GBL application. It decouples gameplay telemetry and analysis from the game engine and automatically derives pedagogically actionable insights, supporting the transparency of computational player models while making them accessible to players. OPSAI comprises three logical layers: a Frontend that both provides the GBL experience and collects information needed for analytics; a stateless Backend that hosts transparent analytics services producing reflective prompts, recommendations, and visualization guides; and a two-tier Log Storage that balances heavy raw gameplay data with lightweight reference indices for low-latency queries. By feeding analytics outputs back into the game interface, OPSAI closes the feedback loop between play and learning, empowering teachers, researchers, and learners alike. We further showcase OPSAI with a full deployment on the Parallel GBL environment, featuring live play traces, peer comparisons, and personalized suggestions, demonstrating a reusable blueprint for future educational games. Source arXiv: 2603.26915v1
T Count as a Numerically Solvable Minimization Problem Authors Marc Grau Davis, Ed Younis, Mathias Weiden, Hyeongrak Choi, Dirk Englund Published: 03.26.2026 Updated: 03.26.2026 Summary We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically solvable in practice. We reproduce best-known results for synthesis of circuits with a small number of qubits, and push the bounds of the largest circuits that can be solved for in this way. Additionally, we show that circuit partitioning can be used to adapt this technique to be used to optimize the T -Count of circuits with large numbers of qubits by breaking the circuit into a series of smaller sub-circuits that can be optimized independently. Source arXiv: 2603.25101v1
Visible Spectral-Domain Optical Coherence Tomography for Photonic Integrated Circuits Characterization Authors Yin Min Goh, Chao Li, Yunchan Hwang, Helaman Flores, Mahmoud Jalali Mehrabad, James G. Fujimoto, Dirk R. Englund Published: 03.25.2026 Updated: 03.25.2026 Summary Visible photonic integrated circuits underpin applications ranging from AR/VR to quantum control, yet lack a high-resolution, nondestructive diagnostic comparable to the optical frequency-domain reflectometry used in infrared silicon photonics. Here we adapt spectral-domain optical coherence tomography to measure guided-mode back-reflections in visible PICs. Broadband visible light injected into a circuit generates back-reflections that interfere with a depth-referencing local oscillator, and the resulting spectral fringes are recorded on a spectrometer. We validate the approach by resolving multiple round-trip echoes in a waveguide-coupled ring resonator using only single-port access. We then extend it to circuits integrated with diamond quantum micro-chiplets, clearly resolving input and output facets as well as PIC–QMC transition regions. The system achieves shot-noise-limited sensitivity, 50 dB dynamic range, 8 um axial resolution in silicon nitride, and a 2 mm imaging depth at 6 dB roll-off. SD-OCT therefore provides a practical, high-resolution diagnostic for visible PICs that uses a broadband probe source and requires only single-port optical access, enabling rapid characterization of propagation loss, backscattering, and dispersion. Source arXiv: 2603.23815v1
Rethinking Quantum Networking with Advances in Fiber Technology Authors Prateek Mantri, Michael S. Bullock, Aditya Tripathi, Robert Kwolek, Rajveer Nehra, Don Towsley Published: 03.24.2026 Updated: 03.24.2026 Summary Recent comparisons of quantum repeater protocols have highlighted the strong near-term potential of multiplexed two-way architectures for long-distance quantum communication. At the same time, advances in hollow-core fiber (HCF) technology motivate a re-examination of the physical transmission medium as an architectural lever in quantum network design. In this work, we compare emerging anti-resonant HCFs against conventional silica single-mode fibers (SMFs) in multiplexed two-way quantum repeater networks. We evaluate their performance under both telecom and memory-native transmission, accounting for frequency-conversion overheads, coupling efficiencies, memory decoherence, and operational noise. We find that HCF significantly outperforms SMF across a wide range of regimes. With memory-native transmission, HCF yields up to an order of magnitude improvement in secret-key rate per channel use under realistic conversion efficiencies. Even at telecom wavelengths, HCF enables larger optimal repeater spacing, improving rate–cost tradeoffs and reducing repeater requirements. We further quantify the role of memory quality, hardware efficiency, detector and conversion losses, and two-qubit gate noise in shaping these gains. These results show that recent advances in HCF materially expand the design space of practical terrestrial quantum repeater networks. Source arXiv: 2603.23718v1
Observation of microscopic domain effects in the metal-insulator transition of thin-film NdNiO$_3$ Authors Lucy S. Nathwani, Anne Ruperto, Ashvini Vallipuram, Abigail Y. Jiang, Grace A. Pan, Dan Ferenc Segedin, Ari B. Turkiewicz, Charles M. Brooks, Jarad A. Mason, Qichen Song, Julia A. Mundy Published: 03.22.2026 Updated: 03.22.2026 Summary Perovskite oxides display correlated electrical, magnetic, and thermal properties that can be further tuned in the thin-film limit, making them contenders for next-generation electronics. Measuring thermal transport in thin films is challenging, because traditional techniques are dominated by the substrate. Here, frequency-domain thermoreflectance (FDTR) of an epitaxial NdNiO$_3$ thin film reveals a sharp change in out-of-plane thermal conductivity across the metal-insulator transition. Complementary frequency-domain photoreflectance (FDPR) reveals a large change in ambipolar diffusivity of photoexcited carriers. While the in-plane electrical resistance shows large hysteresis, out-of-plane thermal and charge transport shows negligible hysteresis. We attribute this discrepancy to anisotropy in the percolation of nanoscale domains across the transition as the film thickness approaches the domain length scale. We establish FDTR and FDPR as sensitive probes of quantum material phase transitions and highlight NdNiO$_3$ for thermal control and memory applications. Source arXiv: 2603.21405v1
Fast Real-Axis Eliashberg Calculations: Full-bandwidth solutions beyond the constant density of states approximation Authors Alejandro Simon, James Shi, Dominik Spath, Eva Kogler, Reed Foster, Emma Batson, Pedro N. Ferreira, Mihir Sahoo, Phillip D. Keathley, Warren E. Pickett, Rohit Prasankumar, Karl K. Berggren, Christoph Heil Published: 03.18.2026 Updated: 03.18.2026 Summary Experimentally relevant signatures of superconductivity require access to real-frequency quantities, such as the spectral functions, optical response, and transport properties, yet Migdal-Eliashberg calculations are commonly performed on the imaginary axis and then analytically continued, a step that is numerically delicate and can obscure physically relevant spectral features. Here we present a practical route to solving the finite-temperature Migdal-Eliashberg equations directly on the real-frequency axis, while retaining the effects from the full-bandwidth electronic structure. Our formulation accounts for particle-hole asymmetry through an energy-dependent electronic density of states, avoiding the constant density of states approximation often used in real-axis calculations, and includes a static screened Coulomb contribution. We introduce an efficient numerical technique to solve the Migdal-Eliashberg integrals whose computational cost scales linearly with the real-frequency grid, making high-resolution, full-bandwidth real-axis calculations feasible and providing direct access to the interacting Green’s function and derived observables without analytic continuation. As an illustration, we apply the method to H$_{3}$S, where a van-Hove singularity near the Fermi level produces strong particle-hole asymmetry. The full-bandwidth solution yields noticeably different spectra than the constant density of states approximation and brings the superconducting gap and lineshapes into closer agreement with experiment, highlighting when band-structure details are essential. Furthermore, the methods presented here open the door to time-dependent, nonequilibrium simulations within Eliashberg theory. Source arXiv: 2603.18199v1
Ultrafast dynamics and light-induced superconductivity from first principles Authors Alejandro Simon, James Shi, Eva Kogler, Reed Foster, Dominik Spath, Emma Batson, Pedro N. Ferreira, Mihir Sahoo, Rohit Prasankumar, Phillip D. Keathley, Karl K. Berggren, Christoph Heil Published: 03.18.2026 Updated: 03.18.2026 Summary Experiments on superconducting materials have unveiled unique emergent properties when they are driven far from equilibrium. However, a quantitative first-principles treatment that describes experimental observations is lacking. In this work, we develop an ab-initio model for the nonequilibrium response of optically irradiated superconducting films within the framework of conventional electron-phonon-mediated superconductivity, leveraging new numerical techniques to solve the Migdal-Eliashberg equations directly on the real-frequency axis. This enables us to quantitatively reproduce the optical response of superconducting films in pump-probe experiments and validate our approach on measurements of the differential reflectance of Pb and LaH$_{10}$ in response to a pump excitation. Similar calculations performed on the alkali-doped fulleride K$_3$C$_{60}$ reveal that a photo-induced superconducting state is generated after irradiation by an ultrafast mid-infrared pulse of sufficient intensity, as reported in prior experimental work. The enhancement in this framework is attributed to the excitation of quasiparticles to energies resonant with the strongest electron-phonon coupling in K$_3$C$_{60}$, in close analogy to the mechanism for enhancement of superconductivity under microwave irradiation, explaining the nature of the photo-induced superconducting state and elucidating the subsequent quasiparticle and phonon dynamics. Our results suggest that photo-induced superconductivity is accessible in more materials than previously recognized. We demonstrate this by performing calculations on calcium-intercalated graphite, CaC$_6$, and predict a similar photo-induced superconducting gap. Source arXiv: 2603.18182v1
Boosted linear-optical measurements on single-rail qubits with unentangled ancillas Authors Aqil Sajjad, Isack Padilla, Saikat Guha Published: 03.17.2026 Updated: 03.17.2026 Summary Any quantum state of the radiation field, sliced in small non-overlapping space-time bins is a collection of single-rail qubits, each spanning the vacuum and single-photon Fock state of a mode. Quantum logic on these qubits would enable arbitrary measurements on information-bearing light, but is hard due to the lack of strong nonlinearities. With unentangled ancilla single-rail qubits, an $8$-port interferometer and photon detection, we show any single-rail qubit measurement in the $XY$ Bloch plane is realizable with success probability $147/256$, which beats the prior-known $1/2$ limit. Source arXiv: 2603.16795v1
Programmable pixel-mode linear interferometers using multi-plane light conversion Authors Mushkan Sureka, Itay Ozer, Wenhua He, Michael R. Grace, Chaohan Cui, Saikat Guha Published: 03.16.2026 Updated: 03.16.2026 Summary Programmable linear optical interferometers are a core primitive in optical signal processing, quantum information processing, and photonic computing. Existing photonic-integrated implementations realize arbitrary $M$-mode unitaries using Mach–Zehnder-interferometer meshes whose footprint and accumulated loss scale with $O(M^2)$ optical components. Here we analyze and experimentally demonstrate a programmable architecture for implementing linear optical transformations directly on spatially tiled free-space pixel modes using multi-plane light conversion (MPLC). In this architecture, $M$ spatial modes arranged on a transverse lattice undergo a unitary transformation and are mapped to $M$ output modes of identical geometry through a sequence of programmable phase masks separated by free-space propagation segments. Numerical simulations show that arbitrary $M$-mode unitaries can be compiled to a desired high fidelity using a number of phase planes that scales approximately linearly with $M$. Using a spatial-light-modulator-based MPLC, we experimentally demonstrate programmable interferometers acting on up to $16$ spatial pixel modes, including tunable beamsplitters, Hadamard unitaries, spatial permutations, boosted-Bell-measurement unitaries, and partial unitaries on select subsets of modes. These results establish MPLC-based pixel-mode interferometers as a promising architecture for programmable linear optics with applications in classical and quantum optical interconnects, photonic switching, and quantum information processing. Source arXiv: 2603.15836v1
Noise and dynamics in acoustoelectric waveguides Authors Ryan O. Behunin, Andrew Shepherd, Ruoyu Yuan, Taylor Ray, Matthew J. Storey, Peter T. Rakich, Nils T. Otterstrom, Matt Eichenfield Published: 03.16.2026 Updated: 03.16.2026 Summary We present a quantum field theoretic formulation of acoustoelectric interactions in waveguide-like systems of arbitrary cross-section. Building on an open quantum systems approach, we derive a unified description of plasmon-phonon coupling that incorporates dissipation, noise, and the influence of drift currents. Our analysis captures both bulk and surface plasmon modes, highlighting how drift currents Doppler-shift plasmonic resonances and reshape the phonon noise spectrum. The resulting Heisenberg-Langevin equations yield closed-form expressions for frequency shifts, gain, and noise power spectra, enabling direct evaluation of performance metrics such as the noise factor in acoustoelectric amplifiers and oscillators. In the appropriate limits, this framework reproduces known results while extending them to complex geometries. Source arXiv: 2603.15482v1
Microwave spin resonance in epitaxial thin films of spin liquid candidate TbInO3 Authors Sandesh S. Kalantre, Johanna Nordlander, Margaret A. Anderson, Julia A. Mundy, David Goldhaber-Gordon Published: 03.15.2026 Updated: 03.15.2026 Summary Minimizing the energy of a many body system tends to favor order, but classical frustration and quantum fluctuations destabilize that order. The tension between these effects can produce exotic quantum states of matter. Quantum spin liquid (QSL) states emerge in models of localized magnetic moments where the crystal lattice connectivity frustrates ordering, and the exchange interaction of neighboring spins strengthens quantum fluctuations. Experimentally identifying a QSL in a real material is challenging from the lack of an order parameter. Piecing together evidence from varied techniques is necessary for diagnosing the nature of the ground state — QSL or otherwise — of a frustrated spin system. In this work, we use coplanar superconducting resonators to probe magnetic excitations in epitaxially grown thin films of a spin liquid candidate TbInO3. Adapting microwave techniques from the field of circuit quantum electrodynamics, we measure responses of these thin films whose volume is too low for applying conventional bulk techniques. In-plane susceptibility extracted from the spin resonance signal indicates extreme frustration of magnetic order down to 20 mK, over two orders of magnitude lower than the Curie-Weiss energy scale. Through a crystal field analysis, we identify the doublet eigenstates comprising the ground state. As a consequence of improper ferroelectricity, Tb moments split into two flavors with distinct g-factors reflecting the local crystal field environment of each site. Spin-orbit coupling, crystal fields, magnetic frustration and improper ferroelectricity distinctively combine to shape the magnetic ground state of TbInO3. This work establishes a measurement technique using superconducting resonators to probe thin films of frustrated magnets, and applies this technique towards building a coherent understanding of the magnetic properties of TbInO3. Source arXiv: 2603.14545v1
Digital dissipative state preparation for frustration-free gapless quantum systems Authors Johannes Feldmeier, Yu-Jie Liu, Mikhail D. Lukin, Soonwon Choi Published: 03.10.2026 Updated: 03.10.2026 Summary Preparing algebraically correlated ground states of quantum many-body systems is an important, yet challenging task for quantum simulation. We introduce a protocol that employs local projective measurements and unitary feedback for frustration-free gapless systems. Our approach prepares a priori unknown ground states in time that scales polynomially with system size. We analytically show the performance our protocol for the dynamics of a single-particle; we argue the same mechanism generalizes to many-body systems based on the physics of quasiparticles. Our theory predicts that a transient cooling dynamics directly reveals the system’s universal critical properties. In particular, the state preparation time is linear in the inverse of the finite-size gap (up to log correction) when the system’s dynamical critical exponent is larger or equal the effective spatial dimension explored by the quasiparticles. We verify these predictions in numerical simulations of ferromagnetic Heisenberg models in one- and two dimensions, a Fredkin spin chain, and a two-dimensional model of resonating valence bond states. Our protocol stabilizes gapless many-body ground states fully digitally without requiring analog rotations, enabling access to high-fidelity states beyond conventional adiabatic approaches in near-term experiments. Source arXiv: 2603.10119v1
Heterogeneously Integrated Diamond-on-Lithium Niobate Quantum Photonic Platform Authors Sophie W. Ding, Chang Jin, Zixi Li, Nicholas Achuthan, Kazuhiro Kuruma, Xinghan Guo, Brandon Grinkemeyer, David D. Awschalom, Nazar Delegan, F. Joseph Heremans, Alexander A. High, Marko Loncar Published: 03.09.2026 Updated: 03.09.2026 Summary Diamond photonics has enabled efficient interfaces for quantum memories and is predicted to be a critical component of quantum networks. However, scalable network architectures require spatial, temporal, and spectral control of photons, which relies on nonlinear and electro-optic functionalities that diamond alone cannot provide. Here, we demonstrate heterogeneous integration of a thin-film lithium niobate (TFLN) platform, which has strong chi-2 nonlinearity and electro-optic effects, with thin diamond films. We demonstrate high-Q diamond photonic crystal cavities (Q factors exceeding 5×10^4 at 735 nm) that are lithographically aligned with TFLN photonic backbone and critically coupled to it. This allows us to realize low-loss diamond-TFLN “escalators” (loss ~1 dB/coupler) that support efficient light transfer between them. At cryogenic temperatures (5K), we can collect photons emitted from silicon vacancies (SiVs) embedded within the diamond structure via the TFLN photonic circuit. This approach establishes a scalable route toward integrated photonic circuits for practical quantum networking and other technologies. Source arXiv: 2603.08609v1
Benchmark for Assessing Olfactory Perception of Large Language Models Authors Eftychia Makri, Nikolaos Nakis, Laura Sisson, Gigi Minsky, Leandros Tassiulas, Vahid Satarifard, Nicholas A. Christakis Published: 03.08.2026 Updated: 03.08.2026 Summary Here we introduce the Olfactory Perception (OP) benchmark, designed to assess the capability of large language models (LLMs) to reason about smell. The benchmark contains 1,010 questions across eight task categories spanning odor classification, odor primary descriptor identification, intensity and pleasantness judgments, multi-descriptor prediction, mixture similarity, olfactory receptor activation, and smell identification from real-world odor sources. Each question is presented in two prompt formats, compound names and isomeric SMILES, to evaluate the effect of molecular representations. Evaluating 21 model configurations across major model families, we find that compound-name prompts consistently outperform isomeric SMILES, with gains ranging from +2.4 to +18.9 percentage points (mean approx +7 points), suggesting current LLMs access olfactory knowledge primarily through lexical associations rather than structural molecular reasoning. The best-performing model reaches 64.4% overall accuracy, which highlights both emerging capabilities and substantial remaining gaps in olfactory reasoning. We further evaluate a subset of the OP across 21 languages and find that aggregating predictions across languages improves olfactory prediction, with AUROC = 0.86 for the best performing language ensemble model. LLMs should be able to handle olfactory and not just visual or aural information. Source arXiv: 2604.00002v1
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States Authors Anthony Micciche, Naphan Benchasattabuse, Andrew McGregor, Michal Hajdušek, Rodney Van Meter, Stefan Krastanov Published: 03.06.2026 Updated: 03.06.2026 Summary We investigate the problem of compiling the generation of graph states to arbitrarily many distributed homogeneous quantum processing units (QPUs), providing a scalable partitioning algorithm and graph state generation protocol to minimize the number of Bell pairs required. To this goal, we consider the problem of balanced k graph partitioning with the objective of minimizing the sizes of the maximum matchings between partitions, a more natural measure of entanglement compared to the naive but common metric of cut edges. We show that our heuristic algorithm, BURY, partitions graph states to require fewer Bell pairs for generation than state-of-the-art k partition algorithms. Furthermore, we show that BURY reduces the cut-rank of the partitions, demonstrating that the partitioning found by our algorithm is likely to minimize the Bell pair utilization of any future improved distributed graph state generation protocol. Additionally, we discuss how one could straightforwardly apply our methods to the dynamic case where the graph state generation and measurement are performed concurrently. Our study of the balanced minimum maximum matching k partition problem and the heuristic algorithm we design provides a scalable foundation for reducing quantum network overhead for distributed measurement-based quantum computation (MBQC), as well as any scheme where distributed graph state generation is desired. Source arXiv: 2603.06387v1
Challenges in Synchronous & Remote Collaboration Around Visualization Authors Matthew Brehmer, Maxime Cordeil, Christophe Hurter, Takayuki Itoh, Wolfgang Büschel, Mahmood Jasim, Arnaud Prouzeau, David Saffo, Lyn Bartram, Sheelagh Carpendale, Chen Zhu-Tian, Andrew Cunningham, Tim Dwyer, Samuel Huron, Masahiko Itoh, Alark Joshi, Kiyoshi Kiyokawa, Hideaki Kuzuoka, Bongshin Lee, Gabriela Molina León, Harald Reiterer, Bektur Ryskeldiev, Jonathan Schwabish, Brian A. Smith, Yasuyuki Sumi, Ryo Suzuki, Anthony Tang, Yalong Yang, Jian Zhao Published: 03.06.2026 Updated: 03.06.2026 Summary We characterize 16 challenges faced by those investigating and developing remote and synchronous collaborative experiences around visualization. Our work reflects the perspectives and prior research efforts of an international group of 29 experts from across human-computer interaction and visualization sub-communities. The challenges are anchored around five collaborative activities that exhibit a centrality of visualization and multimodal communication. These activities include exploratory data analysis, creative ideation, visualization-rich presentations, joint decision making grounded in data, and real-time data monitoring. The challenges also reflect the changing dynamics of these activities in the face of recent advances in extended reality (XR) and artificial intelligence (AI). As an organizing scheme for future research at the intersection of visualization and computer-supported cooperative work, we align the challenges with a sequence of four sets of research and development activities: technological choices, social factors, AI assistance, and evaluation. Source arXiv: 2603.05871v1
An Optimization Framework for Monitor Placement in Quantum Network Tomography Authors Athira Kalavampara Raghunadhan, Matheus Guedes De Andrade, Don Towsley, Indrakshi Dey, Daniel Kilper, Nicola Marchetti Published: 03.06.2026 Updated: 03.06.2026 Summary Quantum Network Tomography (QNT) offers a framework for end-to-end quantum channel characterization by strategically placing monitor nodes within the network. Building upon prior work on single-monitor placement, we study optimal monitor placement and measurement assignments for channel parameter estimation in arbitrary quantum networks. Using an n-node star network as a baseline, we analyze multi-monitor configurations and show that distributing monitors across end nodes can achieve estimation performance comparable to a monitor placed at the hub. Estimation precision is quantified using the Quantum Fisher Information Matrix (QFIM), with channel parameters inferred via Maximum Likelihood Estimation (MLE) and benchmarked against the Quantum Cramer-Rao Bound (QCRB). To generalize, we develop two Integer Linear Program (ILP) formulations: one maximizing estimation accuracy (QF), and another jointly optimizing accuracy and monitoring overhead (QMF). Unlike QF, QMF prevents monitor overloading, enabling scalability and parallelism. We prove optimality for star and analyze applicability to tree-structured quantum networks. Source arXiv: 2603.05777v1
The Evolution of Magnetism in a Thin Film Pyrochlore Ferromagnetic Insulator Authors Margaret A. Anderson, Megan E. Goh, Yang Zhang, Kyeong-Yoon Baek, Michael Schulze, Mario Brutzam, Christoph Liebald, Chris Lygouras, Dan Ferenc Segedin, Aaron M. Day, Zubia Hasan, Donald A. Walko, Hua Zhou, Peter Bencok, Alpha T. N'Diaye, Charles M. Brooks, Ismail El Baggari, John T. Heron, S. M. Koopayeh, Daniel Rytz, Christo Guguschev, Julia A. Mundy Published: 03.05.2026 Updated: 03.05.2026 Summary The pyrochlore vanadates are compelling candidates for next-generation dissipationless devices. Lu2V2O7 and Y2V2O7 are ferromagnetic insulators (Tc ~ 70 K) that are believed to exhibit the magnon Hall effect and are expected to host topological magnons. Their completely dissipationless magnon edge states could be harnessed to realize low-power information transport in spintronic or magnonic devices. As a crucial step in the realization of devices, we synthesize the first thin films of pyrochlore Y2V2O7 on isostructural Y2Ti2O7 substrates and explore the evolution of their magnetic properties down to the ultrathin limit. All films are insulating ferromagnets with transition temperatures of up to the bulk value (Tc ~ 68 K) that decrease with thickness according to finite-size effects. Our films also exhibit a change in anisotropy from in-plane to out-of-plane easy axis coincident with the development of partial strain relaxation and nonzero magnetic hysteresis in an applied field. This evolution demonstrates the impact of strain on magnetic anisotropy and paves the way to tunable magnon topology. Source arXiv: 2603.05717v1
Quantum advantages for syndrome-aware noisy logical observable estimation Authors Kento Tsubouchi, Hyukgun Kwon, Liang Jiang, Nobuyuki Yoshioka Published: 03.05.2026 Updated: 03.05.2026 Summary Recent progress in fault-tolerant quantum computing suggests that leveraging error-syndrome information at the logical layer can substantially improve performance, including the estimation of logical observables from noisy states. In this work, based on quantum estimation theory, we develop an information-theoretic framework to quantify the utility of error syndromes for noisy logical observable estimation. We distinguish two operational regimes of such syndrome-aware protocols: classical protocols, in which the logical measurement basis is fixed and syndrome information is used only in classical post-processing, and quantum protocols, in which the logical quantum control can be tailored to depend on the observed error syndrome. For classical syndrome-aware protocols, we prove a universal limitation: on average, syndrome information can improve the effective logical error rate by at most a factor of two, implying at most a quadratic reduction in sampling overhead. In contrast, once syndrome-conditioned quantum control is permitted, we exhibit settings in which the effective logical error rate decays exponentially with the number of logical qubits. These findings provide fundamental guidance for designing future fault-tolerant architectures that actively exploit syndrome records rather than discarding them after decoding. Source arXiv: 2603.05145v1
Variational Quantum Transduction Authors Pengcheng Liao, Haowei Shi, Quntao Zhuang Published: 03.04.2026 Updated: 03.04.2026 Summary Quantum transducers are critical for quantum interconnect, enabling coherent signal transfer across disparate frequency domains. Beyond material and device advances, protocol design has become a powerful means to improve transduction. We introduce a variational quantum transduction (VQT) framework that employs variational tools from near-term quantum computing to systematically optimize protocol performance. As a variational quantum circuit framework, VQT is not plagued by known training issues such as barren plateau, because a small-scale problem is sufficient for substantial advantage and training only needs to be done once to configure a VQT system. Maximizing the quantum information rate within this framework yields protocols that surpass all known schemes in their respective classes. For non-adaptive protocols, VQT exceeds the performance envelopes of Gottesman-Kitaev-Preskill (GKP)-based and entanglement-assisted approaches. In the adaptive setting, VQT provides only a marginal improvement over Gaussian feedforward strategies, indicating that Gaussian adaptive transduction is already close to optimal. With increasingly universal quantum control, VQT provides a systematic path toward optimal quantum transduction. Source arXiv: 2603.03642v1
Rate-Fidelity Tradeoffs in All-Photonic and Memory-Equipped Quantum Switches Authors Panagiotis Promponas, Leonardo Bacciottini, Paul Polakos, Gayane Vardoyan, Don Towsley, Leandros Tassiulas Published: 03.03.2026 Updated: 03.03.2026 Summary Quantum entanglement switches are a key building block for early quantum networks, and a central design question is whether near-term devices should use only flying photons or also incorporate quantum memories. We compare two architectures: an all-photonic entanglement generation switch (EGS) that repeatedly attempts Bell-state measurements (BSM) without storing qubits, and a quantum memory-equipped switch that buffers entanglement and triggers measurements only when heralded connectivity is available (herald-then-swap control). These two designs trade off simple, memoryless operation that avoids decoherence and memory-induced latency against heralding-based control that buffers entanglement to use BSMs more efficiently. We formalize both models under a common hardware abstraction and characterize their achievable rate-fidelity regions, yielding a benchmarking methodology that translates hardware and protocol parameters into network-level performance. Numerical evaluation quantifies the rate-fidelity tradeoffs of both models, identifies operating regions in which each architecture dominates, and shows how hardware and protocol knobs can be tuned to meet application-specific targets. Source arXiv: 2603.02610v1
Ultra-low loss piezo-optomechanical low-confinement silicon nitride platform for visible wavelength quantum photonic circuits Authors Mayank Mishra, Gwangho Choi, Wenhua He, Gina M. Talcott, Katherine Kearney, Michael Gehl, Andrew Leenheer, Daniel Dominguez, Nils T. Otterstrom, Matt Eichenfield Published: 03.03.2026 Updated: 03.04.2026 Summary The stringent demands of photonic quantum computing protocols motivate photonic integrated circuit (PIC) platforms with passive optical properties such as extremely low losses and correspondingly large circuit depths, as well as active optical properties such as high reconfiguration rates, low power dissipation, and minimal crosstalk. At the same time, many quantum photonic resource state generators, such as single-photon sources and quantum memories, require operation in the visible wavelength range. These requirements make the passive optical properties of CMOS-fabricated, ultralow-loss, low-confinement silicon nitride waveguides especially attractive. However, the conventional active properties of these systems based on thermo-optic modulation are plagued by high levels of crosstalk, slow modulation rates, and high power dissipation. Although there have been recent demonstrations of CMOS-fabricated, visible wavelength, piezo-optomechanical PICs that solve the above challenges associated with implementing active functionality, these have made use of high-confinement waveguides with currently demonstrated losses of order $0.3$-$1~mathrm{dB/cm}$, precluding circuit depths required for scalable quantum algorithms. Here, we demonstrate that combining piezo-optomechanical actuation with a low-confinement, ultra-low loss silicon nitride platform addresses the scalability challenge while enabling high-performance active functionality at visible wavelengths. This platform achieves a propagation loss $0.026~mathrm{dB/cm}$ at $780~mathrm{nm}$, modulation bandwidths in the MHz range, and a phase shifter voltage-length product ($V_πL$) of approximately $2.8~mathrm{mathrm{V}cdotmathrm{m}}$ and negligible hysteresis. We further demonstrate reconfigurable Mach-Zehnder interferometers based on spiral phase shifters with 0.63 dB loss per phase shifter. Source arXiv: 2603.02584v2
Ultra-low loss piezo-optomechanical low-confinement silicon nitride platform for visible wavelength quantum photonic circuits Authors Mayank Mishra, Gwangho Choi, Wenhua He, Gina M. Talcott, Katherine Kearney, Michael Gehl, Andrew Leenheer, Daniel Dominguez, Nils T. Otterstrom, Matt Eichenfield Published: 03.03.2026 Updated: 03.08.2026 Summary The stringent demands of photonic quantum computing protocols motivate photonic integrated circuit (PIC) platforms with passive optical properties such as extremely low losses and correspondingly large circuit depths, as well as active optical properties such as high reconfiguration rates, low power dissipation, and minimal crosstalk. At the same time, many quantum photonic resource state generators, such as single-photon sources and quantum memories, require operation in the visible wavelength range. These requirements make the passive optical properties of CMOS-fabricated, ultralow-loss, low-confinement silicon nitride waveguides especially attractive. However, the conventional active properties of these systems based on thermo-optic modulation are plagued by high levels of crosstalk, slow modulation rates, and high power dissipation. Although there have been recent demonstrations of CMOS-fabricated, visible wavelength, piezo-optomechanical PICs that solve the above challenges associated with implementing active functionality, these have made use of high-confinement waveguides with currently demonstrated losses of order $0.3$-$1~mathrm{dB/cm}$, precluding circuit depths required for scalable quantum algorithms. Here, we demonstrate that combining piezo-optomechanical actuation with a low-confinement, ultra-low loss silicon nitride platform addresses the scalability challenge while enabling high-performance active functionality at visible wavelengths. This platform achieves a propagation loss $0.026~mathrm{dB/cm}$ at $780~mathrm{nm}$, modulation bandwidths in the MHz range, and a phase shifter voltage-length product ($V_πL$) of approximately $2.8~mathrm{mathrm{V}cdotmathrm{m}}$ and negligible hysteresis. We further demonstrate reconfigurable Mach-Zehnder interferometers based on spiral phase shifters with 0.63 dB loss per phase shifter. Source arXiv: 2603.02584v3
Optimizing Orbital Parameters of Satellites for a Global Quantum Network Authors Athul Ashok, Owen DePoint, Jackson MacDonald, Albert Williams, Don Towsley Published: 03.03.2026 Updated: 03.03.2026 Summary Due to fundamental limitations on terrestrial quantum links, satellites have received considerable attention for their potential as entanglement generation sources in a global quantum internet. In this work, we focus on the problem of designing a constellation of satellites for such a quantum network. We find satellite inclination angles and satellite cluster allocations to achieve maximal entanglement generation rates to fixed sets of globally distributed ground stations. Exploring two black-box optimization frameworks: a Bayesian Optimization (BO) approach and a Genetic Algorithm (GA) approach, we find comparable results, indicating their effectiveness for this optimization task. While GA and BO often perform remarkably similar, BO often converges more efficiently, while later growth noted in GAs is indicative of less susceptibility towards local maxima. In either case, they offer substantial improvements over naive approaches that maximize coverage with respect to ground station placement. Source arXiv: 2603.02480v1
Quantum squeezing in an all-resonant periodically poled lithium niobate microresonator Authors Xinyi Ren, Reshma Kopparapu, Tushar Sanjay Karnik, Chun-Ho Lee, Kiwon Kwon, Clayton Cheung, Yue Yu, Shi-Yuan Ma, Bo-Han Wu, Ran Yin, Lian Zhou, Quntao Zhuang, Dirk Englund, Zaijun Chen, Mengjie Yu Published: 02.26.2026 Updated: 02.26.2026 Summary Quantum noise limits the sensitivity of optical measurements, but squeezed states of light enable quantum-enhanced metrology, sensing, and information processing. Most on-chip squeezed-light sources rely on Kerr ($χ^{(3)}$) nonlinearities, remain limited by pump power and excess loss constraints. Quadratic ($χ^{(2)}$) platforms instead provide stronger parametric interactions, lower pump power requirements, and greater spectral engineering flexibility. Here, we demonstrate strong, broadband squeezed-light generation on a thin-film lithium niobate (TFLN) photonic chip using a dual-resonant optical parametric amplifier implemented in a single periodically poled LN (PPLN) microresonator. Near-full-depth domain inversion is achieved simultaneously with highly over-coupled resonances, exhibiting escape efficiencies exceeding 90% and intrinsic quality factors above 2.5 million in a 0.6 mm$^2$ X-cut TF-PPLN resonator, enabling efficient squeezing at 1587 nm when pumped at 793.5 nm. Operating in the continuous-wave regime, we directly measure -0.81 dB of squeezing below the shot-noise limit with a pump power of 27 mW, together with +4.29 dB of anti-squeezing. From these measurements, we infer an on-chip squeezing level of -7.52 dB $pm$ 0.22 dB (95% confidence interval: [-7.96,-7.10] dB), and an on-chip anti-squeezing level of +9.62 dB $pm$ 0.25 dB. We demonstrate single-mode squeezing at degeneracy with a squeezed-light spectrum exceeding 10.3 THz. This work reports the highest squeezing ratio among integrated $χ^{(2)}$ cavity platforms and the first quasi-phase matched, fully resonant $χ^{(2)}$ cavity squeezer on chip, establishing a scalable route to fully integrated power-efficient squeezed-light sources for quantum-enhanced sensing and metrology. Source arXiv: 2602.22693v1
Passive Environment-Assisted Quantum Communication Authors Evelyn Voss, Bikun Li, Zhaoyou Wang, Liang Jiang Published: 02.25.2026 Updated: 02.25.2026 Summary As quantum information systems mature, efficient and coherent transfer of quantum information through noisy channels becomes increasingly important. We examine how passive environment-assisted quantum communication enhances direct quantum information transfer efficiency. A bosonic pure-loss channel, modeled as transmission through a beam splitter with a vacuum input state at the dark port, has zero quantum capacity when transmissivity is below 50%. Quantum communication through the channel can be enhanced by passive environment assistance, achieved via the selection of an appropriate input state for the ancilla port. Although ideal Gottesman-Kitaev-Preskill (GKP) states enable perfect quantum information transmission at arbitrarily small transmissivity, they are challenging to realize experimentally. We therefore explore more experimentally accessible non-Gaussian ancilla states, such as Fock, cat, and squeezed cat states, and numerically determine the optimal encoding and decoding strategies. We also construct analytical schemes that yield high-fidelity transmission and good information rates. Source arXiv: 2602.21549v1
Passive Environment-Assisted Quantum Communication Authors Evelyn Voss, Bikun Li, Zhaoyou Wang, Liang Jiang Published: 02.25.2026 Updated: 02.27.2026 Summary As quantum information systems mature, efficient and coherent transfer of quantum information through noisy channels becomes increasingly important. We examine how passive environment-assisted quantum communication enhances direct quantum information transfer efficiency. A bosonic pure-loss channel, modeled as transmission through a beam splitter with a vacuum input state at the dark port, has zero quantum capacity when transmissivity is below 50%. Quantum communication through the channel can be enhanced by passive environment assistance, achieved via the selection of an appropriate input state for the ancilla port. Although ideal Gottesman-Kitaev-Preskill (GKP) states enable perfect quantum information transmission at arbitrarily small transmissivity, they are challenging to realize experimentally. We therefore explore more experimentally accessible non-Gaussian ancilla states, such as Fock, cat, and squeezed cat states, and numerically determine the optimal encoding and decoding strategies. We also construct analytical schemes that yield high-fidelity transmission and good information rates. Source arXiv: 2602.21549v2
Universal Sample Complexity Bounds in Quantum Learning Theory via Fisher Information matrix Authors Hyukgun Kwon, Seok Hyung Lie, Liang Jiang Published: 02.25.2026 Updated: 02.25.2026 Summary In this work, we show that the sample complexity (equivalently, the number of measurements) required in quantum learning theory within a general parametric framework, is fundamentally governed by the inverse Fisher information matrix. More specifically, we derive upper and lower bounds on the number of samples required to estimate the parameters of a quantum system within a prescribed small additive error and with high success probability under maximum likelihood estimation. The upper bound is governed by the supremum of the largest diagonal entry of the inverse Fisher information matrix, while the lower bound is characterized by any diagonal element evaluated at arbitrary parameter values. We then apply the general bounds to Pauli channel learning and to the estimation of Pauli expectation values in the asymptotic small-error regime, and recover the previously established sample complexity through considerably streamlined derivations. Furthermore, we identify the structural origin of exponential sample complexity in Pauli channel learning without entanglement and in Pauli expectation value estimation without quantum memory. We then extend the analysis to an error criterion based on the Euclidean distance between the true parameter values and their estimators. We derive the corresponding upper and lower bounds on the sample complexity, which are likewise characterized by the inverse Fisher information matrix. As an application, we consider Pauli expectation estimation with entangled probes. Finally, we highlight two fundamental contributions to quantum learning theory. First, we establish a systematic framework that determines the task-independent sample complexity under maximum-likelihood estimation. Second, we show that, in the small-error regime, learning sample complexity is governed by the inverse Fisher information matrix. Source arXiv: 2602.21510v1
Universal Sample Complexity Bounds in Quantum Learning Theory via Fisher Information Matrix Authors Hyukgun Kwon, Seok Hyung Lie, Liang Jiang Published: 02.25.2026 Updated: 03.09.2026 Summary In this work, we show that the sample complexity required in quantum learning theory within a general parametric framework, is fundamentally governed by the inverse Fisher information matrix. More specifically, we derive upper and lower bounds on the number of samples required to estimate the parameters of a quantum system within a prescribed small additive error, with high success probability under maximum likelihood estimation. The upper bound is governed by the supremum of the largest diagonal entry of the inverse Fisher information matrix, while the lower bound is characterized by any diagonal element evaluated at arbitrary parameter values. We then apply the general bounds to Pauli channel learning and to Pauli expectation values learning in the asymptotic small-error regime, and recover the previously established sample complexity through considerably streamlined derivations. Furthermore, we identify the structural origin of exponential sample complexity in Pauli channel learning without entanglement and in Pauli expectation values learning without quantum memory. We then extend the analysis to an error criterion based on the Euclidean distance between the true parameter values and their estimators. We derive the corresponding upper and lower bounds on the sample complexity, which are likewise characterized by the inverse Fisher information matrix. As an application, we consider Pauli channel learning with entangled probes. Finally, we highlight two fundamental contributions to quantum learning theory. First, we establish a systematic framework that determines the task-independent sample complexity under maximum-likelihood estimation. Second, we show that, in the small-error regime, the learning sample complexity is determined by the inverse Fisher information matrix, the central quantity in quantum metrology that determines the ultimate achievable mean squared error. Source arXiv: 2602.21510v2
Agentic AI for Scalable and Robust Optical Systems Control Authors Zehao Wang, Mingzhe Han, Wei Cheng, Yue-Kai Huang, Philip Ji, Denton Wu, Mahdi Safari, Flemming Holtorf, Kenaish AlQubaisi, Norbert M. Linke, Danyang Zhuo, Yiran Chen, Ting Wang, Dirk Englund, Tingjun Chen Published: 02.23.2026 Updated: 02.23.2026 Summary We present AgentOptics, an agentic AI framework for high-fidelity, autonomous optical system control built on the Model Context Protocol (MCP). AgentOptics interprets natural language tasks and executes protocol-compliant actions on heterogeneous optical devices through a structured tool abstraction layer. We implement 64 standardized MCP tools across 8 representative optical devices and construct a 410-task benchmark to evaluate request understanding, role-aware responses, multi-step coordination, robustness to linguistic variation, and error handling. We assess two deployment configurations–commercial online LLMs and locally hosted open-source LLMs–and compare them with LLM-based code generation baselines. AgentOptics achieves 87.7%–99.0% average task success rates, significantly outperforming code-generation approaches, which reach up to 50% success. We further demonstrate broader applicability through five case studies extending beyond device-level control to system orchestration, monitoring, and closed-loop optimization. These include DWDM link provisioning and coordinated monitoring of coherent 400 GbE and analog radio-over-fiber (ARoF) channels; autonomous characterization and bias optimization of a wideband ARoF link carrying 5G fronthaul traffic; multi-span channel provisioning with launch power optimization; closed-loop fiber polarization stabilization; and distributed acoustic sensing (DAS)-based fiber monitoring with LLM-assisted event detection. These results establish AgentOptics as a scalable, robust paradigm for autonomous control and orchestration of heterogeneous optical systems. Source arXiv: 2602.20144v1
Exact Solutions to Acoustoelectric Interactions in Arbitrary Geometries Authors William W. Roberts, Matt Eichenfield Published: 02.23.2026 Updated: 02.25.2026 Summary Acoustoelectric interactions occur when free carriers in a semiconductor interact with the fields of an acoustic wave in a piezoelectric medium. These interactions can amplify acoustic waves, as well as give rise to extremely large phononic nonlinearities and strong non-reciprocal effects. The field of acoustoelectric devices is currently dependent on analytical and perturbative solutions for the two simplest arrangements of piezoelectric-semiconductor materials. While these canonical models have allowed the field to advance substantially, new geometries are arising that do not satisfy assumptions integral to these models. These assumptions include the treatment of the interactions between the acoustic fields and free carriers as weak, the neglect of the tensorial nature of the material properties, the omission of the spatial variations in the phonons’ electric field profiles, and the disregard of elastic coupling across material boundaries, among others. We develop, for the first time, a finite element method (FEM) model to solve for acoustoelectric interactions in arbitrary geometries that avoids making the assumptions of the canonical models. We verify the FEM model using results for amplification, dispersion, and non-reciprocity obtained from the canonical models in their regime of validity. We then examine the acoustoelectric effect in two geometries not covered by the canonical models: a thin piezoelectric film placed on a semiconductor substrate and a fully 2D waveguide under a thin semiconductor layer. This work lays the foundation for accurate modeling of arbitrary acoustoelectric geometries such as those currently being developed for all-acoustic radio frequency (RF) signal processing, acoustoelectrically enhanced photonic devices, and quantum acoustoelectric devices. Source arXiv: 2602.19482v2
Exact Solutions to Acoustoelectric Interactions in Arbitrary Geometries Authors William W. Roberts, Matt Eichenfield Published: 02.23.2026 Updated: 02.23.2026 Summary Acoustoelectric interactions occur when free carriers in a semiconductor interact with the fields of an acoustic wave in a piezoelectric medium. These interactions can amplify acoustic waves, as well as give rise to extremely large phononic nonlinearities and strong non-reciprocal effects. Despite the tremendous progress in the last ten years, the field is entirely dependent on analytical and perturbative solutions for the two simplest arrangements of piezoelectric-semiconductor materials. While these models have allowed the field to advance substantially, new geometries are arising that do not satisfy assumptions integral to these canonical models. These models rely on simplifying assumptions that remove the tensorial nature of the materials, restricting analysis to plane wave and perturbative solutions. Such restrictions fails to capture the non-perturbative nature of the acoustoelectric effect, illustrating the need for more advanced computational methods to analyze acoustoelectric systems. We develop, for the first time, a finite element method (FEM) model to solve for acoustoelectric interactions in arbitrary geometries. We use the model to verify existing results for amplification, dispersion, and non-reciprocity obtained from the canonical models. We then examine the acoustoelectric effect in two geometries not covered by the canonical models: a thin piezoelectric film placed above a semiconductor substrate and a fully 2D waveguide under a thin semiconductor layer. This work lays the foundation for accurate modeling of arbitrary acoustoelectric geometries such as those currently being developed for all-acoustic radio frequency (RF) signal processing, acoustoelectrically enhanced photonic devices, and quantum acoustoelectric devices. Source arXiv: 2602.19482v1
Superconducting phase diagram of multi-layer square-planar nickelates Authors Grace A. Pan, Dan Ferenc Segedin, Sophia F. R. TenHuisen, Lopa Bhatt, Harrison LaBollita, Abigail Y. Jiang, Qi Song, Ari B. Turkiewicz, Denitsa R. Baykusheva, Abhishek Nag, Stefano Agrestini, Ke-Jin Zhou, Jonathan Pelliciari, Valentina Bisogni, Hua Zhou, Mark P. M. Dean, Hanjong Paik, David A. Muller, Lena F. Kourkoutis, Charles M. Brooks, Matteo Mitrano, Antia S. Botana, Berit H. Goodge, Julia A. Mundy Published: 02.22.2026 Updated: 02.22.2026 Summary The discovery of superconductivity in square-planar nickelates has offered a rich materials platform to explore the origins of cuprate-like superconductivity. Experimental investigations however have largely been limited to the infinite-layer $R$NiO$_2$ ($R$=rare-earth) nickelates. Here, we construct a phase diagram of multi-layer square-planar Nd$_{n+1}$Ni$_n$O$_{2n+2}$ compounds and discover signatures of superconductivity for $n$ = 4 – 8. Upon decreasing the dimensionality $n$, the superconducting anisotropy evolves due to 4$f$ electron effects, and electronic structure characteristics approach cuprate-like behavior. Magnetic fluctuations persist from within the superconducting regime and into the over-doped, non-superconducting regime. Remarkably, the superconducting regime overlaps with that of chemically-doped infinite-layer nickelates, demonstrating underlying commonalities and distinct differences across varying structural realizations of square-planar nickelates. Our work establishes this layered template for creating new nickel-based superconductors. Source arXiv: 2602.19093v1
Engineering quantum criticality and dynamics on an analog-digital simulator Authors Alexandra A. Geim, Nazli Ugur Koyluoglu, Simon J. Evered, Rahul Sahay, Sophie H. Li, Muqing Xu, Dolev Bluvstein, Nik O. Gjonbalaj, Nishad Maskara, Marcin Kalinowski, Tom Manovitz, Ruben Verresen, Susanne F. Yelin, Johannes Feldmeier, Markus Greiner, Vladan Vuletic, Mikhail D. Lukin Published: 02.20.2026 Updated: 02.20.2026 Summary Understanding emergent phenomena in out-of-equilibrium interacting many-body systems is an exciting frontier in physical science. While quantum simulators represent a promising approach to this long-standing problem, in practice it can be challenging to directly realize the required interactions, measure arbitrary observables, and mitigate errors. Here we use coherent mapping between the Rydberg and hyperfine qubits in a neutral atom array simulator to engineer and probe complex quantum dynamics. We combine efficient analog dynamics with fully programmable state preparation and measurement, leverage non-destructive readout for loss information and atomic qubit reuse, and use an atom reservoir for replacing lost atoms. With this analog-digital approach, we first demonstrate dynamical engineering of ring-exchange and particle hopping dynamics via Floquet driving and measure the spectral function of single excitations by evolving initial superposition states. Extending these techniques to a 271-site kagome lattice, we employ closed-loop optimization to target an out-of-equilibrium critical quantum spin liquid of the Rokhsar-Kivelson type. We observe the key features of such a state, including the absence of local order, many-body coherences between nearly equal-amplitude dimer configurations over up to 18 sites, and universal correlations consistent with predictions from field theory. Together, these results pave the way for using dynamical control in analog-digital quantum simulators to study complex quantum many-body systems. Source arXiv: 2602.18555v1
Quantum superresolution and noise spectroscopy with quantum computing Authors James W. Gardner, Federico Belliardo, Gideon Lee, Tuvia Gefen, Liang Jiang Published: 02.19.2026 Updated: 02.19.2026 Summary Quantum metrology of an incoherent signal is a canonical sensing problem related to superresolution and noise spectroscopy. We show that quantum computing can accelerate searches for a weak incoherent signal when the signal and noise are not precisely known. In particular, we consider weak Schur sampling, density matrix exponentiation, and quantum signal processing for testing the rank, purity, and spectral gap of the unknown quantum state to detect the incoherent signal. We show that these algorithms are faster than full-state tomography, which scales with the dimension of the Hilbert space. We apply our results to detecting exoplanets, stochastic gravitational waves, ultralight dark matter, geontropic quantum gravity, and Pauli noise. Source arXiv: 2602.17862v1
Approaching the Limit in Multiparameter AC Magnetometry with Quantum Control Authors Takuya Isogawa, Zhiyao Hu, Ayumi Kanamoto, Nutdech Phadetsuwannukun, Shilin Wang, Shunsuke Nishimura, Boning Li, Liang Jiang, Zain H. Saleem, Guoqing Wang, Haidong Yuan, Paola Cappellaro Published: 02.19.2026 Updated: 02.19.2026 Summary Simultaneously estimating multiple parameters at the ultimate limit is a central challenge in quantum metrology, often hindered by inherent incompatibilities in optimal estimation strategies. At its most extreme, this incompatibility culminates in a fundamental impossibility when the quantum Fisher information matrix (QFIM) becomes singular, rendering joint estimation unattainable. This is the case for a canonical problem: estimating the amplitude and frequency of an AC magnetic field, where the generators are parallel to each other. Here, we introduce a quantum control protocol that resolves this singularity. Our control protocol strategically engineers the sensor’s time evolution so the generators for the two parameters become orthogonal. It not only removes the singularity but also restores the optimal scaling of precision with interrogation time for both parameters simultaneously. We experimentally validate this protocol using a nitrogen-vacancy center in diamond at room temperature, demonstrating the concurrent achievement of the optimal scaling for both parameters under realistic conditions. Source arXiv: 2602.17648v1
Recirculating Quantum Photonic Networks for Fast Deterministic Quantum Information Processing Authors Emil Grovn, Matias Bundgaard-Nielsen, Jesper Mørk, Dirk Englund, Mikkel Heuck Published: 02.11.2026 Updated: 02.11.2026 Summary A fundamental challenge in photonics-based deterministic quantum information processing is to realize key transformations on time scales shorter than those of detrimental decoherence and loss mechanisms. This challenge has been addressed through device-focused approaches that aim to increase nonlinear interactions relative to decoherence rates. In this work, we adopt a complementary architecture-focused approach by proposing a recirculating quantum photonic network (RQPN) that minimizes the duration of quantum information processing tasks, thereby reducing the requirements on nonlinear interaction rates. The RQPN consists of a network of all-to-all connected nonlinear cavities with dynamically controlled waveguide couplings, and it processes information by capturing a photonic input state, recirculating photons between the cavities, and releasing a photonic output state. We demonstrate the RQPN’s architectural advantage through two examples: first, we show that processing all qubits simultaneously yields faster operations than single- and two-qubit decompositions of the three-qubit Toffoli gate. Second, we demonstrate implementations of a measurement-free correction for single-photon loss, achieving up to seven-fold speedups and significantly improved hardware efficiency relative to state-of-the-art architecture proposals. Our work shows that a single hardware-efficient recirculating architecture substantially reduces the temporal overhead of multi-qubit gates and quantum error correction, thereby lowering the barrier to experimental realizations of deterministic photonic quantum information processing. Source arXiv: 2602.11033v1
LitBench: A Graph-Centric Large Language Model Benchmarking Tool For Literature Tasks Authors Andreas Varvarigos, Ali Maatouk, Jiasheng Zhang, Ngoc Bui, Jialin Chen, Leandros Tassiulas, Rex Ying Published: 02.10.2026 Updated: 02.10.2026 Summary While large language models (LLMs) have become the de facto framework for literature-related tasks, they still struggle to function as domain-specific literature agents due to their inability to connect pieces of knowledge and reason across domain-specific contexts, terminologies, and nomenclatures. This challenge underscores the need for a tool that facilitates such domain-specific adaptation and enables rigorous benchmarking across literature tasks. To that end, we introduce LitBench, a benchmarking tool designed to enable the development and evaluation of domain-specific LLMs tailored to literature-related tasks. At its core, LitBench uses a data curation process that generates domain-specific literature sub-graphs and constructs training and evaluation datasets based on the textual attributes of the resulting nodes and edges. The tool is designed for flexibility, supporting the curation of literature graphs across any domain chosen by the user, whether high-level fields or specialized interdisciplinary areas. In addition to dataset curation, LitBench defines a comprehensive suite of literature tasks, ranging from node and edge level analyses to advanced applications such as related work generation. These tasks enable LLMs to internalize domain-specific knowledge and relationships embedded in the curated graph during training, while also supporting rigorous evaluation of model performance. Our results show that small domain-specific LLMs trained and evaluated on LitBench datasets achieve competitive performance compared to state-of-the-art models like GPT-4o and DeepSeek-R1. To enhance accessibility and ease of use, we open-source the tool along with an AI agent tool that streamlines data curation, model training, and evaluation. Source arXiv: 2603.00051v1
Quantization-aware Photonic Homodyne computing for Accelerated Artificial Intelligence and Scientific Simulation Authors Lian Zhou, Kaiwen Xue, Amirhossein Fallah, Lijin Liu, Chun-Ho Lee, Kiwon Kwon, Clayton Cheung, Yuan Li, Yue Yu, Yun-Jhu Lee, Songlin Zhao, Ryan Hamerly, Edo Waks, Dirk Englund, Constantine Sideris, Mengjie Yu, Zaijun Chen Published: 02.09.2026 Updated: 02.09.2026 Summary Modern problems in high-performance computing, ranging from training and inferencing deep learning models in computer vision and language models to simulating complex physical systems with nonlinearly-coupled equations, require exponential growth of computational resources. Photonic analog systems are emerging with solutions of intrinsic parallelism, high bandwidth, and low propagation loss. However, their application has been hindered by the low analog accuracy due to the electro-optic distortion, material nonlinearities, and signal-to-noise ratios. Here we overcome this barrier with a quantization-aware digital-photonic mixed-precision framework across chiplets for accelerated AI processing and physical simulation. Using Lithium Niobate photonics with channel equalization techniques, we demonstrate linear multiplication (9-bit amplitude-phase decoupling) in homodyne optical logics with 6-bit precision at the clock rate of 128 giga-symbol-per-second (128 GS/s), enabling AI processing with 6 ns latency. Codesign hardware-algorithms, including iterative solvers, sparse-dense quantization, and bit-sliced matrix multiplication, explore photonic amplitude and phase coherence for complex-valued, physics-inspired computation. In electromagnetic problems, our approach yields 12-bit solutions for partial differential equations (PDEs) in scattering problems that would conventionally require up to 32-bit and often even 64-bit precision. These results preserve digital-level fidelity while leveraging the high-speed low-energy photonic hardware, establishing a pathway toward general-purpose optical acceleration for generative artificial intelligence, real-time robotics, and accurate simulation for climate challenges and biological discoveries. Source arXiv: 2602.08269v1
HypRAG: Hyperbolic Dense Retrieval for Retrieval Augmented Generation Authors Hiren Madhu, Ngoc Bui, Ali Maatouk, Leandros Tassiulas, Smita Krishnaswamy, Menglin Yang, Sukanta Ganguly, Kiran Srinivasan, Rex Ying Published: 02.08.2026 Updated: 02.08.2026 Summary Embedding geometry plays a fundamental role in retrieval quality, yet dense retrievers for retrieval-augmented generation (RAG) remain largely confined to Euclidean space. However, natural language exhibits hierarchical structure from broad topics to specific entities that Euclidean embeddings fail to preserve, causing semantically distant documents to appear spuriously similar and increasing hallucination risk. To address these limitations, we introduce hyperbolic dense retrieval, developing two model variants in the Lorentz model of hyperbolic space: HyTE-FH, a fully hyperbolic transformer, and HyTE-H, a hybrid architecture projecting pre-trained Euclidean embeddings into hyperbolic space. To prevent representational collapse during sequence aggregation, we introduce the Outward Einstein Midpoint, a geometry-aware pooling operator that provably preserves hierarchical structure. On MTEB, HyTE-FH outperforms equivalent Euclidean baselines, while on RAGBench, HyTE-H achieves up to 29% gains over Euclidean baselines in context relevance and answer relevance using substantially smaller models than current state-of-the-art retrievers. Our analysis also reveals that hyperbolic representations encode document specificity through norm-based separation, with over 20% radial increase from general to specific concepts, a property absent in Euclidean embeddings, underscoring the critical role of geometric inductive bias in faithful RAG systems. Source arXiv: 2602.07739v1
Fin-RATE: A Real-world Financial Analytics and Tracking Evaluation Benchmark for LLMs on SEC Filings Authors Yidong Jiang, Junrong Chen, Eftychia Makri, Jialin Chen, Peiwen Li, Ali Maatouk, Leandros Tassiulas, Eliot Brenner, Bing Xiang, Rex Ying Published: 02.07.2026 Updated: 02.14.2026 Summary With the increasing deployment of Large Language Models (LLMs) in the finance domain, LLMs are increasingly expected to parse complex regulatory disclosures. However, existing benchmarks often focus on isolated details, failing to reflect the complexity of professional analysis that requires synthesizing information across multiple documents, reporting periods, and corporate entities. Furthermore, these benchmarks do not disentangle whether errors arise from retrieval failures, generation inaccuracies, domain-specific reasoning mistakes, or misinterpretation of the query or context, making it difficult to precisely diagnose performance bottlenecks. To bridge these gaps, we introduce Fin-RATE, a benchmark built on U.S. Securities and Exchange Commission (SEC) filings and mirroring financial analyst workflows through three pathways: detail-oriented reasoning within individual disclosures, cross-entity comparison under shared topics, and longitudinal tracking of the same firm across reporting periods. We benchmark 17 leading LLMs, spanning open-source, closed-source, and finance-specialized models, under both ground-truth context and retrieval-augmented settings. Results show substantial performance degradation, with accuracy dropping by 18.60% and 14.35% as tasks shift from single-document reasoning to longitudinal and cross-entity analysis. This degradation is driven by increased comparison hallucinations, temporal and entity mismatches, and is further reflected in declines in reasoning quality and factual consistency–limitations that existing benchmarks have yet to formally categorize or quantify. Source arXiv: 2602.07294v3
Fin-RATE: A Real-world Financial Analytics and Tracking Evaluation Benchmark for LLMs on SEC Filings Authors Yidong Jiang, Junrong Chen, Eftychia Makri, Jialin Chen, Peiwen Li, Ali Maatouk, Leandros Tassiulas, Eliot Brenner, Bing Xiang, Rex Ying Published: 02.07.2026 Updated: 02.07.2026 Summary With increasing deployment of Large Language Models (LLMs) in the finance domain, LLMs are increasingly expected to parse complex regulatory disclosures. However, existing benchmarks often focus on isolated details, failing to reflect the complexity of professional analysis that requires synthesizing information across multiple documents, reporting periods, and corporate entities. They do not distinguish whether errors stem from retrieval failures, generation flaws, finance-specific reasoning mistakes, or misunderstanding of the query or context. This makes it difficult to pinpoint performance bottlenecks. To bridge these gaps, we introduce Fin-RATE, a benchmark built on U.S. Securities and Exchange Commission (SEC) filings and mirror financial analyst workflows through three pathways: detail-oriented reasoning within individual disclosures, cross-entity comparison under shared topics, and longitudinal tracking of the same firm across reporting periods. We benchmark 17 leading LLMs, spanning open-source, closed-source, and finance-specialized models, under both ground-truth context and retrieval-augmented settings. Results show substantial performance degradation, with accuracy dropping by 18.60% and 14.35% as tasks shift from single-document reasoning to longitudinal and cross-entity analysis. This is driven by rising comparison hallucinations, time and entity mismatches, and mirrored by declines in reasoning and factuality–limitations that prior benchmarks have yet to formally categorize or quantify. Source arXiv: 2602.07294v1
Fin-RATE: A Real-world Financial Analytics and Tracking Evaluation Benchmark for LLMs on SEC Filings Authors Yidong Jiang, Junrong Chen, Eftychia Makri, Jialin Chen, Peiwen Li, Ali Maatouk, Leandros Tassiulas, Eliot Brenner, Bing Xiang, Rex Ying Published: 02.07.2026 Updated: 02.12.2026 Summary With the increasing deployment of Large Language Models (LLMs) in the finance domain, LLMs are increasingly expected to parse complex regulatory disclosures. However, existing benchmarks often focus on isolated details, failing to reflect the complexity of professional analysis that requires synthesizing information across multiple documents, reporting periods, and corporate entities. Furthermore, these benchmarks do not disentangle whether errors arise from retrieval failures, generation inaccuracies, domain-specific reasoning mistakes, or misinterpretation of the query or context, making it difficult to precisely diagnose performance bottlenecks. To bridge these gaps, we introduce Fin-RATE, a benchmark built on U.S. Securities and Exchange Commission (SEC) filings and mirroring financial analyst workflows through three pathways: detail-oriented reasoning within individual disclosures, cross-entity comparison under shared topics, and longitudinal tracking of the same firm across reporting periods. We benchmark 17 leading LLMs, spanning open-source, closed-source, and finance-specialized models, under both ground-truth context and retrieval-augmented settings. Results show substantial performance degradation, with accuracy dropping by 18.60% and 14.35% as tasks shift from single-document reasoning to longitudinal and cross-entity analysis. This degradation is driven by increased comparison hallucinations, temporal and entity mismatches, and is further reflected in declines in reasoning quality and factual consistency–limitations that existing benchmarks have yet to formally categorize or quantify. Source arXiv: 2602.07294v2
InftyThink+: Effective and Efficient Infinite-Horizon Reasoning via Reinforcement Learning Authors Yuchen Yan, Liang Jiang, Jin Jiang, Shuaicheng Li, Zujie Wen, Zhiqiang Zhang, Jun Zhou, Jian Shao, Yueting Zhuang, Yongliang Shen Published: 02.06.2026 Updated: 02.06.2026 Summary Large reasoning models achieve strong performance by scaling inference-time chain-of-thought, but this paradigm suffers from quadratic cost, context length limits, and degraded reasoning due to lost-in-the-middle effects. Iterative reasoning mitigates these issues by periodically summarizing intermediate thoughts, yet existing methods rely on supervised learning or fixed heuristics and fail to optimize when to summarize, what to preserve, and how to resume reasoning. We propose InftyThink+, an end-to-end reinforcement learning framework that optimizes the entire iterative reasoning trajectory, building on model-controlled iteration boundaries and explicit summarization. InftyThink+ adopts a two-stage training scheme with supervised cold-start followed by trajectory-level reinforcement learning, enabling the model to learn strategic summarization and continuation decisions. Experiments on DeepSeek-R1-Distill-Qwen-1.5B show that InftyThink+ improves accuracy by 21% on AIME24 and outperforms conventional long chain-of-thought reinforcement learning by a clear margin, while also generalizing better to out-of-distribution benchmarks. Moreover, InftyThink+ significantly reduces inference latency and accelerates reinforcement learning training, demonstrating improved reasoning efficiency alongside stronger performance. Source arXiv: 2602.06960v1
InftyThink+: Effective and Efficient Infinite-Horizon Reasoning via Reinforcement Learning Authors Yuchen Yan, Liang Jiang, Jin Jiang, Shuaicheng Li, Zujie Wen, Zhiqiang Zhang, Jun Zhou, Jian Shao, Yueting Zhuang, Yongliang Shen Published: 02.06.2026 Updated: 02.09.2026 Summary Large reasoning models achieve strong performance by scaling inference-time chain-of-thought, but this paradigm suffers from quadratic cost, context length limits, and degraded reasoning due to lost-in-the-middle effects. Iterative reasoning mitigates these issues by periodically summarizing intermediate thoughts, yet existing methods rely on supervised learning or fixed heuristics and fail to optimize when to summarize, what to preserve, and how to resume reasoning. We propose InftyThink+, an end-to-end reinforcement learning framework that optimizes the entire iterative reasoning trajectory, building on model-controlled iteration boundaries and explicit summarization. InftyThink+ adopts a two-stage training scheme with supervised cold-start followed by trajectory-level reinforcement learning, enabling the model to learn strategic summarization and continuation decisions. Experiments on DeepSeek-R1-Distill-Qwen-1.5B show that InftyThink+ improves accuracy by 21% on AIME24 and outperforms conventional long chain-of-thought reinforcement learning by a clear margin, while also generalizing better to out-of-distribution benchmarks. Moreover, InftyThink+ significantly reduces inference latency and accelerates reinforcement learning training, demonstrating improved reasoning efficiency alongside stronger performance. Source arXiv: 2602.06960v2
Efficient learning of logical noise from syndrome data Authors Han Zheng, Chia-Tung Chu, Senrui Chen, Argyris Giannisis Manes, Su-un Lee, Sisi Zhou, Liang Jiang Published: 01.29.2026 Updated: 02.10.2026 Summary Characterizing errors in quantum circuits is essential for device calibration, yet detecting rare error events requires a large number of samples. This challenge is particularly severe in calibrating fault-tolerant, error-corrected circuits, where logical error probabilities are suppressed to higher order relative to physical noise and are therefore difficult to calibrate through direct logical measurements. Recently, Wagner et al. [PRL 130, 200601 (2023)] showed that, for phenomenological Pauli noise models, the logical channel can instead be inferred from syndrome measurement data generated during error correction. Here, we extend this framework to realistic circuit-level noise models. From a unified code-theoretic perspective and spacetime code formalism, we derive necessary and sufficient conditions for learning the logical channel from syndrome data alone and explicitly characterize the learnable degrees of freedom of circuit-level Pauli faults. Using Fourier analysis and compressed sensing, we develop efficient estimators with provable guarantees on sample complexity and computational cost. We further present an end-to-end protocol and demonstrate its performance on several syndrome-extraction circuits, achieving orders-of-magnitude sample-complexity savings over direct logical benchmarking. Our results establish syndrome-based learning as a practical approach to characterizing the logical channel in fault-tolerant quantum devices. Source arXiv: 2601.22286v2
Efficient learning of logical noise from syndrome data Authors Han Zheng, Chia-Tung Chu, Senrui Chen, Argyris Giannisis Manes, Su-un Lee, Sisi Zhou, Liang Jiang Published: 01.29.2026 Updated: 01.29.2026 Summary Characterizing errors in quantum circuits is essential for device calibration, yet detecting rare error events requires a large number of samples. This challenge is particularly severe in calibrating fault-tolerant, error-corrected circuits, where logical error probabilities are suppressed to higher order relative to physical noise and are therefore difficult to calibrate through direct logical measurements. Recently, Wagner et al. [PRL 130, 200601 (2023)] showed that, for phenomenological Pauli noise models, the logical channel can instead be inferred from syndrome measurement data generated during error correction. Here, we extend this framework to realistic circuit-level noise models. From a unified code-theoretic perspective and spacetime code formalism, we derive necessary and sufficient conditions for learning the logical channel from syndrome data alone and explicitly characterize the learnable degrees of freedom of circuit-level Pauli faults. Using Fourier analysis and compressed sensing, we develop efficient estimators with provable guarantees on sample complexity and computational cost. We further present an end-to-end protocol and demonstrate its performance on several syndrome-extraction circuits, achieving orders-of-magnitude sample-complexity savings over direct logical benchmarking. Our results establish syndrome-based learning as a practical approach to characterizing the logical channel in fault-tolerant quantum devices. Source arXiv: 2601.22286v1
Hierarchy of discriminative power and complexity in learning quantum ensembles Authors Jian Yao, Pengtao Li, Xiaohui Chen, Quntao Zhuang Published: 01.29.2026 Updated: 01.29.2026 Summary Distance metrics are central to machine learning, yet distances between ensembles of quantum states remain poorly understood due to fundamental quantum measurement constraints. We introduce a hierarchy of integral probability metrics, termed MMD-$k$, which generalizes the maximum mean discrepancy to quantum ensembles and exhibit a strict trade-off between discriminative power and statistical efficiency as the moment order $k$ increases. For pure-state ensembles of size $N$, estimating MMD-$k$ using experimentally feasible SWAP-test-based estimators requires $Θ(N^{2-2/k})$ samples for constant $k$, and $Θ(N^3)$ samples to achieve full discriminative power at $k = N$. In contrast, the quantum Wasserstein distance attains full discriminative power with $Θ(N^2 log N)$ samples. These results provide principled guidance for the design of loss functions in quantum machine learning, which we illustrate in the training quantum denoising diffusion probabilistic models. Source arXiv: 2601.22005v1
Multi-Modal Time Series Prediction via Mixture of Modulated Experts Authors Lige Zhang, Ali Maatouk, Jialin Chen, Leandros Tassiulas, Rex Ying Published: 01.29.2026 Updated: 01.29.2026 Summary Real-world time series exhibit complex and evolving dynamics, making accurate forecasting extremely challenging. Recent multi-modal forecasting methods leverage textual information such as news reports to improve prediction, but most rely on token-level fusion that mixes temporal patches with language tokens in a shared embedding space. However, such fusion can be ill-suited when high-quality time-text pairs are scarce and when time series exhibit substantial variation in scale and characteristics, thus complicating cross-modal alignment. In parallel, Mixture-of-Experts (MoE) architectures have proven effective for both time series modeling and multi-modal learning, yet many existing MoE-based modality integration methods still depend on token-level fusion. To address this, we propose Expert Modulation, a new paradigm for multi-modal time series prediction that conditions both routing and expert computation on textual signals, enabling direct and efficient cross-modal control over expert behavior. Through comprehensive theoretical analysis and experiments, our proposed method demonstrates substantial improvements in multi-modal time series prediction. The current code is available at https://github.com/BruceZhangReve/MoME Source arXiv: 2601.21547v1
Transversal gates for quantum CSS codes Authors Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews, Narayanan Rengaswamy, Rodrigo San-José Published: 01.29.2026 Updated: 01.29.2026 Summary In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of the gates as well as the groups of transversal gates that induce non-trivial logical gates and logical identities. We explicitly declare the set of equations defining the groups, a key advantage and differentiator of our approach. We compute the complete set of transversal stabilizers and transversal gates for any CSS code arising from monomial codes, a family that includes decreasing monomial codes and polar codes. As a consequence, we recover and extend some results in the literature on CSS-T codes, triorthogonal codes, and divisible codes. Source arXiv: 2601.21514v1
In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits Authors Xiao Xiao, Dominik Hangleiter, Dolev Bluvstein, Mikhail D. Lukin, Michael J. Gullans Published: 01.29.2026 Updated: 01.29.2026 Summary Benchmarking physical devices and verifying logical algorithms are important tasks for scalable fault-tolerant quantum computing. Numerous protocols exist for benchmarking devices before running actual algorithms. In this work, we show that both physical and logical errors of fault-tolerant circuits can even be characterized in-situ using syndrome data. To achieve this, we map general fault-tolerant Clifford circuits to subsystem codes using the spacetime code formalism and develop a scheme for estimating Pauli noise in Clifford circuits using syndrome data. We give necessary and sufficient conditions for the learnability of physical and logical noise from given syndrome data, and show that we can accurately predict logical fidelities from the same data. Importantly, our approach requires only a polynomial sample size, even when the logical error rate is exponentially suppressed by the code distance, and thus gives an exponential advantage against methods that use only logical data such as direct fidelity estimation. We demonstrate the practical applicability of our methods in various scenarios using synthetic data as well as the experimental data from a recent demonstration of fault-tolerant circuits by Bluvstein et al. [Nature 626, 7997 (2024)]. Our methods provide an efficient, in-situ way of characterizing a fault-tolerant quantum computer to help gate calibration, improve decoding accuracy, and verify logical circuits. Source arXiv: 2601.21472v1
In-situ benchmarking of fault-tolerant quantum circuits. I. Clifford circuits Authors Xiao Xiao, Dominik Hangleiter, Dolev Bluvstein, Mikhail D. Lukin, Michael J. Gullans Published: 01.29.2026 Updated: 02.04.2026 Summary Benchmarking physical devices and verifying logical algorithms are important tasks for scalable fault-tolerant quantum computing. Numerous protocols exist for benchmarking devices before running actual algorithms. In this work, we show that both physical and logical errors of fault-tolerant circuits can even be characterized in-situ using syndrome data. To achieve this, we map general fault-tolerant Clifford circuits to subsystem codes using the spacetime code formalism and develop a scheme for estimating Pauli noise in Clifford circuits using syndrome data. We give necessary and sufficient conditions for the learnability of physical and logical noise from given syndrome data, and show that we can accurately predict logical fidelities from the same data. Importantly, our approach requires only a polynomial sample size, even when the logical error rate is exponentially suppressed by the code distance, and thus gives an exponential advantage against methods that use only logical data such as direct fidelity estimation. We demonstrate the practical applicability of our methods in various scenarios using synthetic data as well as the experimental data from a recent demonstration of fault-tolerant circuits by Bluvstein et al. [Nature 626, 7997 (2024)]. Our methods provide an efficient, in-situ way of characterizing a fault-tolerant quantum computer to help gate calibration, improve decoding accuracy, and verify logical circuits. Source arXiv: 2601.21472v2
Entangling logical qubits without physical operations Authors Jin Ming Koh, Anqi Gong, Andrei C. Diaconu, Daniel Bochen Tan, Alexandra A. Geim, Michael J. Gullans, Norman Y. Yao, Mikhail D. Lukin, Shayan Majidy Published: 01.28.2026 Updated: 01.28.2026 Summary Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation, yielding perfect fidelity with no spatial or temporal overhead. We present a systematic study of such codes. First, we identify phantom codes using complementary numerical and analytical approaches. We exhaustively enumerate all $2.71 times 10^{10}$ inequivalent CSS codes up to $n=14$ and identify additional instances up to $n=21$ via SAT-based methods. We then construct higher-distance phantom-code families using quantum Reed-Muller codes and the binarization of qudit codes. Across all identified codes, we characterize other supported fault-tolerant logical Clifford and non-Clifford operations. Second, through end-to-end noisy simulations with state preparation, full QEC cycles, and realistic physical error rates, we demonstrate scalable advantages of phantom codes over the surface code across multiple tasks. We observe a one-to-two order-of-magnitude reduction in logical infidelity at comparable qubit overhead for GHZ-state preparation and Trotterized many-body simulation tasks, given a modest preselection acceptance rate. Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure, and introduces general tools for systematically exploring the broader landscape of quantum error-correcting codes. Source arXiv: 2601.20927v1
Foundry-Enabled Patterning of Diamond Quantum Microchiplets for Scalable Quantum Photonics Authors Jawaher Almutlaq, Alessandro Buzzi, Anders Khaykin, Linsen Li, William Yzaguirre, Maxim Sirotin, Gerald Gilbert, Genevieve Clark, Dirk Englund Published: 01.27.2026 Updated: 01.27.2026 Summary Quantum technologies promise secure communication networks and powerful new forms of information processing, but building these systems at scale remains a major challenge. Diamond is an especially attractive material for quantum devices because it can host atomic-scale defects that emit single photons and store quantum information with exceptional stability. However, fabricating the optical structures needed to control light in diamond typically relies on slow, bespoke processes that are difficult to scale. In this work, we introduce a manufacturing approach that brings diamond quantum photonics closer to industrial production. Instead of sequentially defining each device by lithography written directly on diamond, we fabricate high-precision silicon masks using commercial semiconductor foundries and transfer them onto diamond via microtransfer printing. These masks define large arrays of nanoscale optical structures, shifting the most demanding pattern-definition steps away from the diamond substrate, improving uniformity, yield, and throughput. Using this method, we demonstrate hundreds of diamond “quantum microchiplets” with improved optical performance and controlled interaction with quantum emitters. The chiplet format allows defective devices to be replaced and enables integration with existing photonic and electronic circuits. Our results show that high-quality diamond quantum devices can be produced using scalable, foundry-compatible techniques. This approach provides a practical pathway toward large-scale quantum photonic systems and hybrid quantum-classical technologies built on established semiconductor manufacturing infrastructure. Source arXiv: 2601.20025v1
Quick Change Detection in Discrete-Time in Presence of a Covert Adversary Authors Amir Reza Ramtin, Philippe Nain, Don Towsley Published: 01.27.2026 Updated: 01.27.2026 Summary We study the problem of covert quickest change detection in a discrete-time setting, where a sequence of observations undergoes a distributional change at an unknown time. Unlike classical formulations, we consider a covert adversary who has knowledge of the detector’s false alarm constraint parameter $γ$ and selects a stationary post-change distribution that depends on it, seeking to remain undetected for as long as possible. Building on the theoretical foundations of the CuSum procedure, we rigorously characterize the asymptotic behavior of the average detection delay (ADD) and the average time to false alarm (AT2FA) when the post-change distribution converges to the pre-change distribution as $γto infty$. Our analysis establishes exact asymptotic expressions for these quantities, extending and refining classical results that no longer hold in this regime. We identify the critical scaling laws governing covert behavior and derive explicit conditions under which an adversary can maintain covertness, defined by ADD = $Θ(γ)$, whereas in the classical setting, ADD grows only as $mathcal{O}(log γ)$. In particular, for Gaussian and Exponential models under adversarial perturbations of their respective parameters, we asymptotically characterize ADD as a function of the Kullback–Leibler divergence between the pre- and post-change distributions and $γ$. Source arXiv: 2601.20022v1
Quickest Change Detection in Discrete-Time in Presence of a Covert Adversary Authors Amir Reza Ramtin, Philippe Nain, Don Towsley Published: 01.27.2026 Updated: 02.16.2026 Summary We study the problem of covert quickest change detection in a discrete-time setting, where a sequence of observations undergoes a distributional change at an unknown time. Unlike classical formulations, we consider a covert adversary who has knowledge of the detector’s false alarm constraint parameter $γ$ and selects a stationary post-change distribution that depends on it, seeking to remain undetected for as long as possible. Building on the theoretical foundations of the CuSum procedure, we rigorously characterize the asymptotic behavior of the average detection delay (ADD) and the average time to false alarm (AT2FA) when the post-change distribution converges to the pre-change distribution as $γto infty$. Our analysis establishes exact asymptotic expressions for these quantities, extending and refining classical results that no longer hold in this regime. We identify the critical scaling laws governing covert behavior and derive explicit conditions under which an adversary can maintain covertness, defined by ADD = $Θ(γ)$, whereas in the classical setting, ADD grows only as $mathcal{O}(log γ)$. In particular, for Gaussian and Exponential models under adversarial perturbations of their respective parameters, we asymptotically characterize ADD as a function of the Kullback–Leibler divergence between the pre- and post-change distributions and $γ$. Source arXiv: 2601.20022v2
Multivariate Multicycle Codes for Complete Single-Shot Decoding Authors Feroz Ahmed Mian, Owen Gwilliam, Stefan Krastanov Published: 01.26.2026 Updated: 01.26.2026 Summary We introduce multivariate multicycle (MM) codes, a new family of quantum error correcting codes that unifies and generalizes bivariate bicycle codes, multivariate bicycle codes, abelian two-block group algebra codes, generalized bicycle codes, trivariate tricycle codes, and n-dimensional toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-t chain complexes with $t ge 4$. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding, while also having additional algebraic structure that might enable logical non-Clifford gates. We offer a framework that facilitates the construction of long-length chain complexes through the use of Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates that demonstrate these capabilities at high rates and high code distances. Examples of new codes with parameters $[[n,k,d]]$ include $[[96, 12, 8]]$, $[[96, 44, 4]]$ $[[144, 40, 4]]$, $[[216, 12, 12]]$, $[[360, 30, 6]]$, $[[384, 80, 4]]$, $[[486, 24, 12]]$, $[[486, 66, 9]]$ and $[[648, 60, 9]]$. Notably, our codes achieve confinement profiles that surpass all known single-shot decodable quantum CSS codes of practical blocksize. Source arXiv: 2601.18879v1
Upper bounds on the purity of Wigner positive quantum states that verify the Wigner entropy conjecture Authors Qipeng Qian, Christos Gagatsos Published: 01.23.2026 Updated: 01.23.2026 Summary We present analytical results toward the Wigner entropy conjecture, which posits that among all physical Wigner non-negative states the Wigner entropy is minimized by pure Gaussian states for which it attains the value $1+lnπ$.Working under a minimal set of constraints on the Wigner function, namely, non-negativity, normalization, and the pointwise bound $πWle 1$, we construct an explicit hierarchy of lower bounds $B_n$ on $S[W]$ by combining a truncated series lower bound for $-ln x$ with moment identities of the Wigner function.This yields closed-form purity-based sufficient conditions ensuring $S[W]ge 1+lnπ$.In particular, we first prove that all Wigner non-negative states with $μle 4-2sqrt3$ satisfy the Wigner entropy conjecture. We further obtain a systematic purity-only relaxation of the hierarchy, yielding the simple sufficient condition $μle 2/e$. On top of aforesaid results, our analysis clarifies why additional physicality constraints are necessary for purity-based approaches that aim to approach the extremal case $μleq1$. Source arXiv: 2601.16898v1
Integrated Photonic Quantum Computing: From Silicon to Lithium Niobate Authors Hui Zhang, Yiming Ma, Di Zhu, Yuancheng Zhan, Yuzhi Shi, Zhanshan Wang, Leong Chuan Kwek, Anthony Laing, Ai Qun Liu, Marko Loncar, Xinbin Cheng Published: 01.23.2026 Updated: 01.23.2026 Summary Quantum technologies have surpassed classical systems by leveraging the unique properties of superposition and entanglement in photons and matter. Recent advancements in integrated quantum photonics, especially in silicon-based and lithium niobate platforms, are pushing the technology toward greater scalability and functionality. Silicon circuits have progressed from centimeter-scale, dual-photon systems to millimeter-scale, high-density devices that integrate thousands of components, enabling sophisticated programmable manipulation of multi-photon states. Meanwhile, lithium niobate, thanks to its wide optical transmission window, outstanding nonlinear and electro-optic coefficients, and chemical stability, has emerged as an optimal substrate for fully integrated photonic quantum chips. Devices made from this material exhibit high efficiency in in generating, manipulating, converting, storing, and detecting photon states, thereby establishing a basis for deterministic multi-photon generation and single-photon quantum interactions, as well as comprehensive frequency-state control. This review explores the development of integrated photonic quantum technologies based on both silicon and lithium niobate, highlighting invaluable insights gained from silicon-based systems that can assist the scaling of lithium niobate technologies. It examines the functional integration mechanisms of lithium niobate in electro-optic tuning and nonlinear energy conversion, showcasing its transformative impact throughout the photonic quantum computing process. Looking ahead, we speculate on the developmental pathways for lithium niobate platforms and their potential to revolutionize areas such as quantum communication, complex system simulation, quantum sampling, and optical quantum computing paradigms. Source arXiv: 2601.16484v1
Heterogeneous Transfer of Thin Film BaTiO$_3$ onto Silicon for Device Fabrication Authors Temazulu S. Zulu, Larissa B. Little, Aaron M. Day, Chaoshen Zhang, Keith Powell, Kyeong-Yoon Baek, Benazir Fazlioglu-Yalcin, Neil Sinclair, Charles M. Brooks, David R. Barton, Marko Loncar, Julia A. Mundy Published: 01.21.2026 Updated: 01.21.2026 Summary Thin film BaTiO$_3$ has one of the highest known Pockels coefficients (>1200 pm/V), making it an attractive material for use in electro-optic devices. It is advantageous to integrate BaTiO$_3$ on silicon to enable complementary metal-oxide-semiconductor (CMOS) compatible processing. However, synthesis of high-quality BaTiO$_3$ directly on silicon remains a challenge. Here, we synthesize BaTiO$_3$ using hybrid metal-organic molecular beam epitaxy (hMBE) and demonstrate its transfer onto silicon using thermocompression bonding and chemical lift-off. Hybrid metal-organic MBE enables self-regulated synthesis of highly stoichiometric thin films at high growth rates (>100nm/hr). Our transfer method results in millimeter-scale areas of atomically flat, crack-free BaTiO$_3$ making it a potentially scalable method. Finally, we demonstrate the applicability of our process to device fabrication through characterization of lithographically-patterned and etch-transferred sub-micron features. Source arXiv: 2601.14551v1
Inverse Quantum Simulation for Quantum Material Design Authors Christian Kokail, Pavel E. Dolgirev, Rick van Bijnen, Daniel Gonzalez-Cuadra, Mikhail D. Lukin, Peter Zoller Published: 01.18.2026 Updated: 01.18.2026 Summary Quantum simulation provides a powerful route for exploring many-body phenomena beyond the capabilities of classical computation. Existing approaches typically proceed in the forward direction: a model Hamiltonian is specified, implemented on a programmable quantum platform, and its phase diagram and properties are explored. Here we present a quantum algorithmic framework for inverse quantum simulation, enabling quantum material design with desired properties. Target material characteristics are encoded as a cost function, which is minimized on quantum hardware to prepare a many-body state with the desired properties in quantum memory. Hamiltonian learning is then used to reconstruct a low-energy Hamiltonian for which this state is an approximate ground state, yielding a physically interpretable model that can guide experimental synthesis. As illustrative applications, we outline how the method can be used to search for high-temperature superconductors within the fermionic Hubbard model, enhancing $d$-wave correlations over a broad range of dopings and temperatures, design quantum phases by stabilizing a topological order through continuous Hamiltonian modifications, and optimize dynamical properties relevant for photochemistry and frequency- and momentum-resolved condensed-matter data. These results extend the scope of quantum simulators from exploring quantum many-body systems to designing and discovering new quantum materials. Source arXiv: 2601.12239v1
Controlling Rydberg atom-polariton interactions: from exceptional points to fast readout Authors Tamara Šumarac, Emily H. Qiu, Shai Tsesses, Peiran Niu, Adrian J. Menssen, Wenchao Xu, Valentin Walther, Uroš Delić, Soonwon Choi, Mikhail D. Lukin, Vladan Vuletić Published: 01.09.2026 Updated: 01.09.2026 Summary Rydberg atoms represent a platform underpinning many recent developments in quantum computation, simulation, sensing, and metrology. They further facilitate optical nonlinearity at the single-photon level when coupled to photons propagating in atomic clouds, which form collective atomic excitations called Rydberg polaritons, strongly interacting with each other. Here, we experimentally explore interactions between a Rydberg polariton in an atomic ensemble and a single, adjacent, Rydberg atom. We discover three different regimes of quantum dynamics corresponding to polariton blockade, coherent exchange, and probabilistic hopping, which are defined by their distinct transmission characteristics, with a transition through an exceptional point occurring between blockade and coherent exchange. We investigate the applications of such interactions for fast, non-destructive detection of Rydberg atoms and present proof-of-principle demonstrations for their potential application in nonlinear photonic networks. Source arXiv: 2601.06345v1
Benchmarking Quantum Data Center Architectures: A Performance and Scalability Perspective Authors Shahrooz Pouryousef, Eneet Kaur, Hassan Shapourian, Don Towsley, Ramana Kompella, Reza Nejabati Published: 01.04.2026 Updated: 01.04.2026 Summary Scalable distributed quantum computing (DQC) has motivated the design of multiple quantum data-center (QDC) architectures that overcome the limitations of single quantum processors through modular interconnection. While these architectures adopt fundamentally different design philosophies, their relative performance under realistic quantum hardware constraints remains poorly understood. In this paper, we present a systematic benchmarking study of four representative QDC architectures-QFly, BCube, Clos, and Fat-Tree-quantifying their impact on distributed quantum circuit execution latency, resource contention, and scalability. Focusing on quantum-specific effects absent from classical data-center evaluations, we analyze how optical-loss-induced Einstein-Podolsky-Rosen (EPR) pair generation delays, coherence-limited entanglement retry windows, and contention from teleportation-based non-local gates shape end-to-end execution performance. Across diverse circuit workloads, we evaluate how architectural properties such as path diversity and path length, and shared BSM (Bell State Measurement) resources interact with optical-switch insertion loss and reconfiguration delay. Our results show that distributed quantum performance is jointly shaped by topology, scheduling policies, and physical-layer parameters, and that these factors interact in nontrivial ways. Together, these insights provide quantitative guidance for the design of scalable and high-performance quantum data-center architectures for DQC. Source arXiv: 2601.01353v1
Benchmarking Quantum Data Center Architectures: A Performance and Scalability Perspective Authors Shahrooz Pouryousef, Eneet Kaur, Hassan Shapourian, Don Towsley, Ramana Kompella, Reza Nejabati Published: 01.04.2026 Updated: 01.10.2026 Summary Scalable distributed quantum computing (DQC) has motivated the design of multiple quantum data-center (QDC) architectures that overcome the limitations of single quantum processors through modular interconnection. While these architectures adopt fundamentally different design philosophies, their relative performance under realistic quantum hardware constraints remains poorly understood. In this paper, we present a systematic benchmarking study of four representative QDC architectures-QFly, BCube, Clos, and Fat-Tree-quantifying their impact on distributed quantum circuit execution latency, resource contention, and scalability. Focusing on quantum-specific effects absent from classical data-center evaluations, we analyze how optical-loss-induced Einstein-Podolsky-Rosen (EPR) pair generation delays, coherence-limited entanglement retry windows, and contention from teleportation-based non-local gates shape end-to-end execution performance. Across diverse circuit workloads, we evaluate how architectural properties such as path diversity and path length, and shared BSM (Bell State Measurement) resources interact with optical-switch insertion loss and reconfiguration delay. Our results show that distributed quantum performance is jointly shaped by topology, scheduling policies, and physical-layer parameters, and that these factors interact in nontrivial ways. Together, these insights provide quantitative guidance for the design of scalable and high-performance quantum data-center architectures for DQC. Source arXiv: 2601.01353v2
Generalized model of anisotropic thermo-optic response on thin-film lithium niobate platform Authors Joonsup Shim, Seonghun Kim, Shengyuan Lu, Jiayu Yang, Seongjin Jeon, Sanghyeon Kim, Marko Lončar, Young-Ik Sohn Published: 01.01.2026 Updated: 01.01.2026 Summary Thermo-optic (TO) control is crucial for thin-film lithium niobate (TFLN) photonic integrated circuits (PICs), offering a simple and practical method for low-frequency and DC tuning while remaining compatible with high-frequency electro-optic (EO) modulation. In x-cut TFLN, the TO response is inherently anisotropic, depending on both waveguide propagation angle and polarization due to the mode-specific overlap of the electric field with the ordinary and extraordinary refractive index axes of the crystal. Despite its significance, a systematic and quantitative analysis of this anisotropy has remained elusive. Here, we present the first generalized analytical model that describes the anisotropic TO response as a function of polarization and arbitrary waveguide orientation, and rigorously validate it through numerical simulations and experiments. This study provides foundational insight into anisotropic thermal tuning and enables new opportunities for engineering energy-efficient and scalable photonic design in next-generation TFLN PICs. Source arXiv: 2601.00174v1
Fast-Recovery Epitaxial NbN Superconducting Nanowire Single-Photon Detectors with Saturated Efficiency at 1550 nm in Liquid Helium Authors Francesca Incalza, Matteo Castellani, Dip Joti Paul, Alejandro Simon, Emma Batson, Davide Mondin, Owen Medeiros, Karl K. Berggren Published: 12.19.2025 Updated: 12.19.2025 Summary Achieving both high internal efficiency and fast reset times at elevated temperatures remains challenging due to limited understanding of how film properties govern SNSPD performance. We demonstrate that epitaxial NbN films on sapphire enable simultaneous high efficiency and rapid response. We fabricate and characterize SNSPDs based on these films deposited via DC magnetron sputtering on c-cut sapphire. High-quality epitaxial growth preserves a low electron diffusion coefficient and promotes strong electron-phonon coupling, yielding a high critical temperature and efficient hotspot formation in the dirty limit. X-ray diffraction and transmission electron microscopy confirm epitaxial alignment and lattice order. Nanowires of 20 nm width exhibit saturated internal efficiency at 1550 nm wavelength and short reset times at 4.2 K, enabled by lattice matching and high thermal conductance of the sapphire interface. Ab initio modeling reproduces photon count rates, linking device performance quantitatively to film properties such as diffusivity and electron-phonon coupling. Source arXiv: 2512.18063v1
Zero-added-loss entanglement multiplexing using time-bin spectral shearing Authors Joseph C. Chapman, Muneer Alshowkan, Jack Postlewaite, Saikat Guha, Nageswara Rao Published: 12.19.2025 Updated: 12.19.2025 Summary High-quality quantum communications that enable important capabilities, such as distributed quantum computing and sensing, will require quantum repeaters for providing high-quality entanglement. To realize high-rate heralded entanglement for quantum repeaters, Chen et al. [Phys. Rev. Appl. 19, 054209 (2023)] proposed a scheme for heralded-multiplexed generation of quasi-deterministic entangled photon pairs, called zero-added-loss multiplexing (ZALM). Here, we propose a design of ZALM source using time-bin entanglement and spectral shearing. Additionally, we provide an analysis of experimentally relevant spectral-shearing parameters to optimize the spectral multiplexing. Moreover, we experimentally verify the compatibility of time-bin pulses and spectral shearing, as supported by observation of no phase shift when the same shearing is applied to both time bins. These results expand the benefits of applying a ZALM source to time-bin entanglement use cases. Moreover, more fully demonstrating time-bin and spectral shearing compatibility clears a path towards a broader use of spectral shearing that provides a deterministic frequency shift of high utility. Source arXiv: 2512.17148v1
Comparing Homodyne and Heterodyne Tomography of Quantum States of Light Authors Rhea P. Fernandes, Andrew J. Pizzimenti, Christos N. Gagatsos, Joseph M. Lukens Published: 12.18.2025 Updated: 12.18.2025 Summary Non-Gaussian quantum states are critical resources in photonic quantum information processing, rendering their generation and characterization of increasing importance in quantum optics. In this work, we theoretically and numerically analyze the relative efficiency of homodyne versus heterodyne measurements for reconstructing non-Gaussian states, a major outstanding question in continuous-variable tomography. Combining a Fisher information-based formalism with simulated experiments, we find homodyne tomography to outperform heterodyne measurements for all non-Gaussian states tested, although the separation between the two modalities proves significantly narrower than suggested by the asymptotic Cramer-Rao lower bound. Our results should find use for optimizing measurement strategies in practical continuous-variable quantum systems. Source arXiv: 2512.17031v1
QuantumSavory: Write Symbolically, Run on Any Backend — A Unified Simulation Toolkit for Quantum Computing and Networking Authors Hana KimLee, Leonardo Bacciottini, Abhishek Bhatt, Andrew Kille, Stefan Krastanov Published: 12.18.2025 Updated: 12.18.2025 Summary Progress in quantum computing and networking depends on codesign across abstraction layers: device-level noise and heterogeneous hardware, algorithmic structure, and distributed classical control. We present QuantumSavory, an open-source toolkit built to make such end-to-end studies practical by cleanly separating a symbolic computer-algebra frontend from interchangeable numerical simulation backends. States, operations, measurements, and protocol logic are expressed in a backend-agnostic symbolic language; the same model can be executed across multiple backends (e.g., stabilizer, wavefunction, phase-space), enabling rapid exploration of accuracy-performance tradeoffs without rewriting the model. Furthermore, new custom backends can be added via a small, well-defined interface that immediately reuses existing models and protocols. QuantumSavory also addresses the classical-quantum interaction inherent to LOCC protocols via discrete-event execution and a tag/query system for coordination. Tags attach structured classical metadata to quantum registers and message buffers, and queries retrieve, filter, or wait on matching metadata by wildcards or arbitrary predicates. This yields a data-driven control plane where protocol components coordinate by publishing and consuming semantic facts (e.g., resource availability, pairing relationships, protocol outcomes) rather than by maintaining rigid object graphs or bespoke message plumbing, improving composability and reuse as models grow. Our toolkit is also not limited to qubits and Bell pairs; rather, any networking dynamics of any quantum system under any type of multipartite entanglement can be tackled. Lastly, QuantumSavory ships reusable libraries of standard states, circuits, and protocol building blocks with consistent interfaces, enabling full-stack examples to be assembled, modified, and compared with minimal glue code. Source arXiv: 2512.16752v1
Noncooperative Quantum Networks Authors Yanxuan Shao, Jannik L. Wyss, Don Towsley, Adilson E. Motter Published: 12.17.2025 Updated: 12.17.2025 Summary Existing protocols for quantum communication networks usually assume an initial allocation of quantum entanglement resources, which are then manipulated through local operations and classical communication (LOCC) to establish high-fidelity entanglement between distant parties. It is generally held that the resulting fidelity would increase monotonically with the entanglement budget. Here, we show that for noncooperative LOCC protocols, the resulting fidelity may decrease as more entanglement is added to a network with non-pure states. This effect results from a quantum analog of selfish routing and constitutes a potential obstacle to the optimal use of resources in large quantum networks. Source arXiv: 2512.15884v1
Opportunistic Scheduling for Single-downlink Satellite-based Quantum Key Distribution Authors Md Zakir Hossain, Nitish K. Panigrahy, Walter O. Krawec, Don Towsley, Bing Wang Published: 12.14.2025 Updated: 12.14.2025 Summary Satellite-based quantum key distribution (QKD), leveraging low photon loss in free-space quantum communication, is widely regarded as one of the most promising directions to achieve global-scale QKD. With a constellation of satellites and a set of ground stations in a satellite-based QKD system, how to schedule satellites to achieve efficient QKD is an important problem. This problem has been studied in the dual-downlink architecture, where each satellite distributes pairs of entanglements to two ground stations simultaneously. However, it has not been studied in the single downlink architecture, where satellites create keys with each individual ground station, and then serve as trusted nodes to create keys between pairs of ground stations. While the single downlink architecture provides weaker security in that the satellites need to be trusted, it has many advantages, including the potential of achieving significantly higher key rates, and generating keys between pairs of ground stations that are far away from each other and cannot be served using the dual-downlink architecture. In this paper, we propose a novel opportunistic approach for satellite scheduling that accounts for fairness among the ground station pairs, while taking advantage of the dynamic satellite channels to maximize the system performance. We evaluate this approach in a wide range of settings and demonstrate that it provides the best tradeoffs in terms of total and minimum key rates across the ground station pairs. Our evaluation also highlights the importance of considering seasonal effects and cloud coverage in evaluating satellite-based QKD systems. In addition, we show different tradeoffs in global and regional QKD systems. Source arXiv: 2512.12514v1
Hybrid electrostatic-piezo MEMS photonic integrated modulators Authors Thuy-Linh Le, Hardit Singh, Julia M. Boyle, Matthew Zimmermann, Andrew J. Leenheer, Daniel Dominguez, Matt Eichenfield, Mark Dong Published: 12.13.2025 Updated: 12.13.2025 Summary Programmable photonic integrated circuits (PICs) have recently emerged as an important technology for quantum information science and artificial neural networks. In particular, PICs with MEMS-based modulators have the advantages of voltage-based control, ultra-low-energy consumption, cryogenic compatibility, and CMOS-foundry support. Here we report a cantilever optical modulator that utilizes hybrid piezoelectric and electrostatic tuning forces together on a monolithic silicon nitride (SiN) PIC platform. The device achieves actuation of visible-wavelength light with quasi-static tuning up to 10 kHz at 1.5 Vπ-cm as well as high-speed (>20 MHz) AC modulation with dynamically adjustable (25 – 40 MHz) mechanical resonances. We report the physics of how geometric nonlinearities such as capacitive pull-in give rise to suspended and contacted cantilever modes. These reversible operating regimes generate different strain profiles and boundary conditions which are responsible for the active tuning of the mechanical resonances. Our proof-of-concept electrostatic-piezo modulator shows promising potential in large-scale programmable PICs applied to high-speed optical switching and optomechanical sensing. Source arXiv: 2512.12383v1
Programmable Quantum Photonic Interfaces for Quantum Networking Authors Siavash Mirzaei-Ghormish, Mahmoud Jalali Mehrabad, Helaman Flores, Dirk Englund, Ryan M. Camacho Published: 12.10.2025 Updated: 12.10.2025 Summary Quantum networks require interfaces translating memory photons to telecom wavelengths while controlling spatial modes; tasks performed by separate components today. We present a programmable alternative: a structured pump writes a virtual Bragg grating enabling simultaneous spatio-spectral conversion and real-time controlling of emission. Using a LiNbO$_3$ whispering-gallery resonator, we demonstrate 93% spatial coupling and bidirectional conversion between 736,nm and 1347,nm. This reconfigurable interface eliminates cascaded losses and hardware modifications. Source arXiv: 2512.10140v1
Broadband Spatio-Spectral Mode Conversion via Four-Wave Mixing Authors Helaman Flores, Mahmoud Jalali Mehrabad, Siavash Mirzaei-Ghormish, Ryan M. Camacho, Dirk Englund Published: 12.10.2025 Updated: 12.10.2025 Summary We introduce a framework for scalable and broadband free-space phase-matched four-wave mixing in ring resonators. This method for four-wave mixing reduces the complexity of coupling an emitter to a quantum network by combining the spatial and spectral interfaces between them into one nonlinear optical process. The device is compliant with current heterogeneous integration capabilities and has a bandwidth of 165 nm for efficient spatio-spectral conversion. We outline a fabrication-ready diamond-on-insulator pathway towards modular unit cells that natively bridge visible color centers to the infrared spectrum for scalable quantum networks. We also present and analyze an end-to-end framework for considering single-photon coupling efficiency from a color center to a quantum network. This framework represents a step forwards in analyzing and reducing system-scale losses in a spin-photon interface. Source arXiv: 2512.10045v1
Dressed-state Hamiltonian engineering in a strongly interacting solid-state spin ensemble Authors Haoyang Gao, Nathaniel T. Leitao, Siddharth Dandavate, Lillian B. Hughes Wyatt, Piotr Put, Mathew Mammen, Leigh S. Martin, Hongkun Park, Ania C. Bleszynski Jayich, Mikhail D. Lukin Published: 12.09.2025 Updated: 12.09.2025 Summary In quantum science applications, ranging from many-body physics to quantum metrology, dipolar interactions in spin ensembles are controlled via Floquet engineering. However, this technique typically reduces the interaction strength between spins, and effectively weakens the coupling to a target sensing field, limiting the metrological sensitivity. In this work, we develop and demonstrate a method for direct tuning of the native interaction in an ensemble of nitrogen-vacancy (NV) centers in diamond. Our approach utilizes dressed-state qubit encoding under a magnetic field perpendicular to the crystal lattice orientation. This method leads to a $3.2times$ enhancement of the dimensionless coherence parameter $JT_2$ compared to state-of-the-art Floquet engineering, and a $2.6times$ ($8.3~$dB) enhanced sensitivity in AC magnetometry. Utilizing the extended coherence we experimentally probe spin transport at intermediate to late times. Our results provide a powerful Hamiltonian engineering tool for future studies with NV ensembles and other interacting higher-spin ($S>frac{1}{2}$) systems. Source arXiv: 2512.09043v1
Scheduling in Quantum Satellite Networks: Fairness and Performance Optimization Authors Ashutosh Jayant Dikshit, Naga Lakshmi Anipeddi, Prajit Dhara, Saikat Guha, Deirdre Kilbane, Leandros Tassiulas, Don Towsley, Nitish K. Panigrahy Published: 12.08.2025 Updated: 12.15.2025 Summary Quantum satellite networks offer a promising solution for achieving long-distance quantum communication by enabling entanglement distribution across global scales. This work formulates and solves the quantum satellite network scheduling problem by optimizing satellite-to-ground station pair assignments under realistic system and environmental constraints. Our framework accounts for limited satellite and ground station resources, fairness, entanglement fidelity thresholds, and real world non-idealities including atmospheric losses, weather and background noise. In addition, we incorporate the complexities of multi-satellite relays enabled via inter-satellite links. We propose an integer linear programming (ILP) based optimization framework that supports multiple scheduling objectives, allowing us to analyze tradeoffs between maximizing total entanglement distribution rate and ensuring fairness across ground station pairs. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies. Source arXiv: 2512.07108v2
Scheduling in Quantum Satellite Networks: Fairness and Performance Optimization Authors Ashutosh Jayant Dikshit, Naga Lakshmi Anipeddi, Prajit Dhara, Saikat Guha, Deirdre Kilbane, Leandros Tassiulas, Don Towsley, Nitish K. Panigrahy Published: 12.08.2025 Updated: 12.08.2025 Summary Quantum satellite networks offer a promising solution for achieving long-distance quantum communication by enabling entanglement distribution across global scales. This work formulates and solves the quantum satellite network scheduling problem by optimizing satellite-to-ground station pair assignments under realistic system and environmental constraints. Our framework accounts for limited satellite and ground station resources, fairness, entanglement fidelity thresholds, and real world non-idealities including atmospheric losses, weather and background noise. In addition, we incorporate the complexities of multi-satellite relays enabled via inter-satellite links. We propose an integer linear programming (ILP) based optimization framework that supports multiple scheduling objectives, allowing us to analyze tradeoffs between maximizing total entanglement distribution rate and ensuring fairness across ground station pairs. Our framework can also be used as a benchmark tool to measure the performance of other potential transmission scheduling policies. Source arXiv: 2512.07108v1
HiMoE-VLA: Hierarchical Mixture-of-Experts for Generalist Vision-Language-Action Policies Authors Zhiying Du, Bei Liu, Yaobo Liang, Yichao Shen, Haidong Cao, Xiangyu Zheng, Zhiyuan Feng, Zuxuan Wu, Jiaolong Yang, Yu-Gang Jiang Published: 12.05.2025 Updated: 12.05.2025 Summary The development of foundation models for embodied intelligence critically depends on access to large-scale, high-quality robot demonstration data. Recent approaches have sought to address this challenge by training on large collections of heterogeneous robotic datasets. However, unlike vision or language data, robotic demonstrations exhibit substantial heterogeneity across embodiments and action spaces as well as other prominent variations such as senor configurations and action control frequencies. The lack of explicit designs for handling such heterogeneity causes existing methods to struggle with integrating diverse factors, thereby limiting their generalization and leading to degraded performance when transferred to new settings. In this paper, we present HiMoE-VLA, a novel vision-language-action (VLA) framework tailored to effectively handle diverse robotic data with heterogeneity. Specifically, we introduce a Hierarchical Mixture-of-Experts (HiMoE) architecture for the action module which adaptively handles multiple sources of heterogeneity across layers and gradually abstracts them into shared knowledge representations. Through extensive experimentation with simulation benchmarks and real-world robotic platforms, HiMoE-VLA demonstrates a consistent performance boost over existing VLA baselines, achieving higher accuracy and robust generalization across diverse robots and action spaces. The code and models are publicly available at https://github.com/ZhiyingDu/HiMoE-VLA. Source arXiv: 2512.05693v1
ProPhy: Progressive Physical Alignment for Dynamic World Simulation Authors Zijun Wang, Panwen Hu, Jing Wang, Terry Jingchen Zhang, Yuhao Cheng, Long Chen, Yiqiang Yan, Zutao Jiang, Hanhui Li, Xiaodan Liang Published: 12.05.2025 Updated: 12.05.2025 Summary Recent advances in video generation have shown remarkable potential for constructing world simulators. However, current models still struggle to produce physically consistent results, particularly when handling large-scale or complex dynamics. This limitation arises primarily because existing approaches respond isotropically to physical prompts and neglect the fine-grained alignment between generated content and localized physical cues. To address these challenges, we propose ProPhy, a Progressive Physical Alignment Framework that enables explicit physics-aware conditioning and anisotropic generation. ProPhy employs a two-stage Mixture-of-Physics-Experts (MoPE) mechanism for discriminative physical prior extraction, where Semantic Experts infer semantic-level physical principles from textual descriptions, and Refinement Experts capture token-level physical dynamics. This mechanism allows the model to learn fine-grained, physics-aware video representations that better reflect underlying physical laws. Furthermore, we introduce a physical alignment strategy that transfers the physical reasoning capabilities of vision-language models (VLMs) into the Refinement Experts, facilitating a more accurate representation of dynamic physical phenomena. Extensive experiments on physics-aware video generation benchmarks demonstrate that ProPhy produces more realistic, dynamic, and physically coherent results than existing state-of-the-art methods. Source arXiv: 2512.05564v1
Little red dot variability over a century reveals black hole envelope via a giant Einstein cross Authors Zijian Zhang, Mingyu Li, Masamune Oguri, Xiaojing Lin, Kohei Inayoshi, Catherine Cerny, Dan Coe, Jose M. Diego, Seiji Fujimoto, Linhua Jiang, Guillaume Mahler, Jorryt Matthee, Rohan P. Naidu, Keren Sharon, Yue Shen, Adi Zitrin, Abdurro'uf, Hollis Akins, Joseph F. V. Allingham, Ricardo Amorín, Yoshihisa Asada, Hakim Atek, Franz E. Bauer, Maruša Bradač, Larry D. Bradley, Zheng Cai, Sebastiano Cantalupo, Christopher Conselice, Liang Dai, Pratika Dayal, Eiichi Egami, Daniel J. Eisenstein, Andreas L. Faisst, Xiaohui Fan, Qinyue Fei, Brenda L. Frye, Yoshinobu Fudamoto, Lukas J. Furtak, Miriam Golubchik, Mauro González-Otero, Yuichi Harikane, Tiger Yu-Yang Hsiao, Yolanda Jiménez-Teja, Jeyhan S. Kartaltepe, Tomokazu Kiyota, Anton M. Koekemoer, Kotaro Kohno, Vasily Kokorev, Nimisha Kumari, Ivo Labbe, Claudia D. P. Lagos, Conor Larison, Yongming Liang, Ray A. Lucas, Jianwei Lyu, Nicholas S. Martis, Georgios E. Magdis, Matteo Messa, Minami Nakane, Gaël Noirot, Rafael Ortiz, Masami Ouchi, Justin D. R. Pierel, Marc Postman, Naveen Reddy, Massimo Ricotti, Daniel Schaerer, Raffaella Schneider, Charles C. Steidel, Wei Leong Tee, Roberta Tripodi, James A. A. Trussler, Hiroya Umeda, Francesco Valentino, Eros Vanzella, Feige Wang, Rogier Windhorst, Yunjing Wu, Zihao Wu, Hiroto Yanagisawa, Jinyi Yang, Fengwu Sun Published: 12.04.2025 Updated: 12.04.2025 Summary “Little red dots” (LRDs) represent a new population of astronomical objects uncovered by JWST whose nature remains debated. Although many LRDs are suspected as active galactic nuclei (AGN), they show little variability on days-years timescales. We report the discovery of two gravitationally lensed LRDs at redshift $sim$4.3 behind the cluster RXCJ2211-0350, one of which (RX1) is quadruply imaged with time delays spanning $sim$130 years. RX1 exhibits intrinsic color and brightness variations of up to 0.7 magnitude among its images. These changes are consistent with blackbody-temperature variations of a photosphere, indicating long-term variability analogous to Cepheid-like pulsations but in a far more extended ($R sim 2000$ AU) and massive ($M gtrsim 10^6 , M_{odot}$) systems. These results suggest LRDs as a distinct class of AGN with stellar-like envelopes. Source arXiv: 2512.05180v1
Measurement of the branching fractions and longitudinal polarisations of $B^0_{(s)} to K^{*0} kern 0.18em overline{kern -0.18em K}{}^{*0}$ decays Authors LHCb collaboration, R. Aaij, A. S. W. Abdelmotteleb, C. Abellan Beteta, F. Abudinén, T. Ackernley, A. A. Adefisoye, B. Adeva, M. Adinolfi, P. Adlarson, C. Agapopoulou, C. A. Aidala, Z. Ajaltouni, S. Akar, K. Akiba, P. Albicocco, J. Albrecht, R. Aleksiejunas, F. Alessio, P. Alvarez Cartelle, R. Amalric, S. Amato, J. L. Amey, Y. Amhis, L. An, L. Anderlini, M. Andersson, P. Andreola, M. Andreotti, S. Andres Estrada, A. Anelli, D. Ao, C. Arata, F. Archilli, Z. Areg, M. Argenton, S. Arguedas Cuendis, L. Arnone, A. Artamonov, M. Artuso, E. Aslanides, R. Ataíde Da Silva, M. Atzeni, B. Audurier, J. A. Authier, D. Bacher, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J. J. Back, P. Baladron Rodriguez, V. Balagura, A. Balboni, W. Baldini, Z. Baldwin, L. Balzani, H. Bao, J. Baptista de Souza Leite, C. Barbero Pretel, M. Barbetti, I. R. Barbosa, R. J. Barlow, M. Barnyakov, S. Barsuk, W. Barter, J. Bartz, S. Bashir, B. Batsukh, P. B. Battista, A. Bay, A. Beck, M. Becker, F. Bedeschi, I. B. Bediaga, N. A. Behling, S. Belin, A. Bellavista, K. Belous, I. Belov, I. Belyaev, G. Benane, G. Bencivenni, E. Ben-Haim, A. Berezhnoy, R. Bernet, S. Bernet Andres, A. Bertolin, F. Betti, J. Bex, O. Bezshyyko, S. Bhattacharya, J. Bhom, M. S. Bieker, N. V. Biesuz, A. Biolchini, M. Birch, F. C. R. Bishop, A. Bitadze, A. Bizzeti, T. Blake, F. Blanc, J. E. Blank, S. Blusk, V. Bocharnikov, J. A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, A. Boldyrev, C. Bolognani, R. Bolzonella, R. B. Bonacci, N. Bondar, A. Bordelius, F. Borgato, S. Borghi, M. Borsato, J. T. Borsuk, E. Bottalico, S. A. Bouchiba, M. Bovill, T. J. V. Bowcock, A. Boyer, C. Bozzi, J. D. Brandenburg, A. Brea Rodriguez, N. Breer, J. Brodzicka, J. Brown, D. Brundu, E. Buchanan, M. Burgos Marcos, A. T. Burke, C. Burr, C. Buti, J. S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H. Cai, Y. Cai, A. Caillet, R. Calabrese, S. Calderon Ramirez, L. Calefice, M. Calvi, M. Calvo Gomez, P. Camargo Magalhaes, J. I. Cambon Bouzas, P. Campana, A. F. Campoverde Quezada, S. Capelli, M. Caporale, L. Capriotti, R. Caravaca-Mora, A. Carbone, L. Carcedo Salgado, R. Cardinale, A. Cardini, P. Carniti, L. Carus, A. Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G. Cavallero, V. Cavallini, S. Celani, I. Celestino, S. Cesare, A. J. Chadwick, I. Chahrour, H. Chang, M. Charles, Ph. Charpentier, E. Chatzianagnostou, R. Cheaib, M. Chefdeville, C. Chen, J. Chen, S. Chen, Z. Chen, A. Chen Hu, M. Cherif, A. Chernov, S. Chernyshenko, X. Chiotopoulos, V. Chobanova, M. Chrzaszcz, A. Chubykin, V. Chulikov, P. Ciambrone, X. Cid Vidal, G. Ciezarek, P. Cifra, P. E. L. Clarke, M. Clemencic, H. V. Cliff, J. Closier, C. Cocha Toapaxi, V. Coco, J. Cogan, E. Cogneras, L. Cojocariu, S. Collaviti, P. Collins, T. Colombo, M. Colonna, A. Comerma-Montells, L. Congedo, J. Connaughton, A. Contu, N. Cooke, G. Cordova, C. Coronel, I. Corredoira, A. Correia, G. Corti, J. Cottee Meldrum, B. Couturier, D. C. Craik, M. Cruz Torres, E. Curras Rivera, R. Currie, C. L. Da Silva, S. Dadabaev, X. Dai, E. Dall'Occo, J. Dalseno, C. D'Ambrosio, J. Daniel, G. Darze, A. Davidson, J. E. Davies, O. De Aguiar Francisco, C. De Angelis, F. De Benedetti, J. de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De Freitas Carneiro Da Graca, E. De Lucia, J. M. De Miranda, L. De Paula, M. De Serio, P. De Simone, F. De Vellis, J. A. de Vries, F. Debernardis, D. Decamp, S. Dekkers, L. Del Buono, B. Delaney, H. -P. Dembinski, J. Deng, V. Denysenko, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, I. Diachkov, S. Didenko, S. Ding, Y. Ding, L. Dittmann, V. Dobishuk, A. D. Docheva, A. Doheny, C. Dong, A. M. Donohoe, F. Dordei, A. C. dos Reis, A. D. Dowling, L. Dreyfus, W. Duan, P. Duda, L. Dufour, V. Duk, P. Durante, M. M. Duras, J. M. Durham, O. D. Durmus, A. Dziurda, A. Dzyuba, S. Easo, E. Eckstein, U. Egede, A. Egorychev, V. Egorychev, S. Eisenhardt, E. Ejopu, L. Eklund, M. Elashri, D. Elizondo Blanco, J. Ellbracht, S. Ely, A. Ene, J. Eschle, S. Esen, T. Evans, F. Fabiano, S. Faghih, L. N. Falcao, B. Fang, R. Fantechi, L. Fantini, M. Faria, K. Farmer, F. Fassin, D. Fazzini, L. Felkowski, M. Feng, A. Fernandez Casani, M. Fernandez Gomez, A. D. Fernez, F. Ferrari, F. Ferreira Rodrigues, M. Ferrillo, M. Ferro-Luzzi, S. Filippov, R. A. Fini, M. Fiorini, M. Firlej, K. L. Fischer, D. S. Fitzgerald, C. Fitzpatrick, T. Fiutowski, F. Fleuret, A. Fomin, M. Fontana, L. A. Foreman, R. Forty, D. Foulds-Holt, V. Franco Lima, M. Franco Sevilla, M. Frank, E. Franzoso, G. Frau, C. Frei, D. A. Friday, J. Fu, Q. Führing, T. Fulghesu, G. Galati, M. D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta, M. Gandelman, P. Gandini, B. Ganie, H. Gao, R. Gao, T. Q. Gao, Y. Gao, Y. Gao, Y. Gao, L. M. Garcia Martin, P. Garcia Moreno, J. García Pardiñas, P. Gardner, L. Garrido, C. Gaspar, A. Gavrikov, L. L. Gerken, E. Gersabeck, M. Gersabeck, T. Gershon, S. Ghizzo, Z. Ghorbanimoghaddam, F. I. Giasemis, V. Gibson, H. K. Giemza, A. L. Gilman, M. Giovannetti, A. Gioventù, L. Girardey, M. A. Giza, F. C. Glaser, V. V. Gligorov, C. Göbel, L. Golinka-Bezshyyko, E. Golobardes, D. Golubkov, A. Golutvin, S. Gomez Fernandez, W. Gomulka, I. Gonçales Vaz, F. Goncalves Abrantes, M. Goncerz, G. Gong, J. A. Gooding, I. V. Gorelov, C. Gotti, E. Govorkova, J. P. Grabowski, L. A. Granado Cardoso, E. Graugés, E. Graverini, L. Grazette, G. Graziani, A. T. Grecu, N. A. Grieser, L. Grillo, S. Gromov, C. Gu, M. Guarise, L. Guerry, A. -K. Guseinov, E. Gushchin, Y. Guz, T. Gys, K. Habermann, T. Hadavizadeh, C. Hadjivasiliou, G. Haefeli, C. Haen, S. Haken, G. Hallett, P. M. Hamilton, J. Hammerich, Q. Han, X. Han, S. Hansmann-Menzemer, L. Hao, N. Harnew, T. H. Harris, M. Hartmann, S. Hashmi, J. He, N. Heatley, A. Hedes, F. Hemmer, C. Henderson, R. Henderson, R. D. L. Henderson, A. M. Hennequin, K. Hennessy, L. Henry, J. Herd, P. Herrero Gascon, J. Heuel, A. Heyn, A. Hicheur, G. Hijano Mendizabal, J. Horswill, R. Hou, Y. Hou, D. C. Houston, N. Howarth, W. Hu, X. Hu, W. Hulsbergen, R. J. Hunter, M. Hushchyn, D. Hutchcroft, M. Idzik, D. Ilin, P. Ilten, A. Iniukhin, A. Iohner, A. Ishteev, K. Ivshin, H. Jage, S. J. Jaimes Elles, S. Jakobsen, T. Jakoubek, E. Jans, B. K. Jashal, A. Jawahery, C. Jayaweera, V. Jevtic, Z. Jia, E. Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, E. Jimenez Moya, N. Jindal, M. John, A. John Rubesh Rajan, D. Johnson, C. R. Jones, S. Joshi, B. Jost, J. Juan Castella, N. Jurik, I. Juszczak, K. Kalecinska, D. Kaminaris, S. Kandybei, M. Kane, Y. Kang, C. Kar, M. Karacson, A. Kauniskangas, J. W. Kautz, M. K. Kazanecki, F. Keizer, M. Kenzie, T. Ketel, B. Khanji, A. Kharisova, S. Kholodenko, G. Khreich, T. Kirn, V. S. Kirsebom, S. Klaver, N. Kleijne, A. Kleimenova, D. K. Klekots, K. Klimaszewski, M. R. Kmiec, T. Knospe, R. Kolb, S. Koliiev, L. Kolk, A. Konoplyannikov, P. Kopciewicz, P. Koppenburg, A. Korchin, M. Korolev, I. Kostiuk, O. Kot, S. Kotriakhova, E. Kowalczyk, A. Kozachuk, P. Kravchenko, L. Kravchuk, O. Kravcov, M. Kreps, P. Krokovny, W. Krupa, W. Krzemien, O. Kshyvanskyi, S. Kubis, M. Kucharczyk, V. Kudryavtsev, E. Kulikova, A. Kupsc, V. Kushnir, B. Kutsenko, J. Kvapil, I. Kyryllin, D. Lacarrere, P. Laguarta Gonzalez, A. Lai, A. Lampis, D. Lancierini, C. Landesa Gomez, J. J. Lane, G. Lanfranchi, C. Langenbruch, J. Langer, T. Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, H. Lee, R. Lefèvre, A. Leflat, S. Legotin, M. Lehuraux, E. Lemos Cid, O. Leroy, T. Lesiak, E. D. Lesser, B. Leverington, A. Li, C. Li, C. Li, H. Li, J. Li, K. Li, L. Li, M. Li, P. Li, P. -R. Li, Q. Li, T. Li, T. Li, Y. Li, Y. Li, Y. Li, Z. Lian, Q. Liang, X. Liang, Z. Liang, S. Libralon, A. Lightbody, C. Lin, T. Lin, R. Lindner, H. Linton, R. Litvinov, D. Liu, F. L. Liu, G. Liu, K. Liu, S. Liu, W. Liu, Y. Liu, Y. Liu, Y. L. Liu, G. Loachamin Ordonez, I. Lobo, A. Lobo Salvia, A. Loi, T. Long, F. C. L. Lopes, J. H. Lopes, A. Lopez Huertas, C. Lopez Iribarnegaray, S. López Soliño, Q. Lu, C. Lucarelli, D. Lucchesi, M. Lucio Martinez, Y. Luo, A. Lupato, E. Luppi, K. Lynch, X. -R. Lyu, G. M. Ma, H. Ma, S. Maccolini, F. Machefert, F. Maciuc, B. Mack, I. Mackay, L. M. Mackey, L. R. Madhan Mohan, M. J. Madurai, D. Magdalinski, D. Maisuzenko, J. J. Malczewski, S. Malde, L. Malentacca, A. Malinin, T. Maltsev, G. Manca, G. Mancinelli, C. Mancuso, R. Manera Escalero, F. M. Manganella, D. Manuzzi, D. Marangotto, J. F. Marchand, R. Marchevski, U. Marconi, E. Mariani, S. Mariani, C. Marin Benito, J. Marks, A. M. Marshall, L. Martel, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli, D. Martinez Gomez, D. Martinez Santos, F. Martinez Vidal, A. Martorell i Granollers, A. Massafferri, R. Matev, A. Mathad, V. Matiunin, C. Matteuzzi, K. R. Mattioli, A. Mauri, E. Maurice, J. Mauricio, P. Mayencourt, J. Mazorra de Cos, M. Mazurek, M. McCann, N. T. McHugh, A. McNab, R. McNulty, B. Meadows, G. Meier, D. Melnychuk, D. Mendoza Granada, P. Menendez Valdes Perez, F. M. Meng, M. Merk, A. Merli, L. Meyer Garcia, D. Miao, H. Miao, M. Mikhasenko, D. A. Milanes, A. Minotti, E. Minucci, T. Miralles, B. Mitreska, D. S. Mitzel, R. Mocanu, A. Modak, L. Moeser, R. D. Moise, E. F. Molina Cardenas, T. Mombächer, M. Monk, T. Monnard, S. Monteil, A. Morcillo Gomez, G. Morello, M. J. Morello, M. P. Morgenthaler, A. Moro, J. Moron, W. Morren, A. B. Morris, A. G. Morris, R. Mountain, Z. M. Mu, E. Muhammad, F. Muheim, M. Mulder, K. Müller, F. Muñoz-Rojas, R. Murta, V. Mytrochenko, P. Naik, T. Nakada, R. Nandakumar, T. Nanut, G. Napoletano, I. Nasteva, M. Needham, E. Nekrasova, N. Neri, S. Neubert, N. Neufeld, P. Neustroev, J. Nicolini, D. Nicotra, E. M. Niel, N. Nikitin, L. Nisi, Q. Niu, P. Nogarolli, P. Nogga, C. Normand, J. Novoa Fernandez, G. Nowak, C. Nunez, H. N. Nur, A. Oblakowska-Mucha, V. Obraztsov, T. Oeser, A. Okhotnikov, O. Okhrimenko, R. Oldeman, F. Oliva, E. Olivart Pino, M. Olocco, R. H. O'Neil, J. S. Ordonez Soto, D. Osthues, J. M. Otalora Goicochea, P. Owen, A. Oyanguren, O. Ozcelik, F. Paciolla, A. Padee, K. O. Padeken, B. Pagare, T. Pajero, A. Palano, L. Palini, M. Palutan, C. Pan, X. Pan, S. Panebianco, S. Paniskaki, G. Panshin, L. Paolucci, A. Papanestis, M. Pappagallo, L. L. Pappalardo, C. Pappenheimer, C. Parkes, D. Parmar, G. Passaleva, D. Passaro, A. Pastore, M. Patel, J. Patoc, C. Patrignani, A. Paul, C. J. Pawley, A. Pellegrino, J. Peng, X. Peng, M. Pepe Altarelli, S. Perazzini, D. Pereima, H. Pereira Da Costa, M. Pereira Martinez, A. Pereiro Castro, C. Perez, P. Perret, A. Perrevoort, A. Perro, M. J. Peters, K. Petridis, A. Petrolini, S. Pezzulo, J. P. Pfaller, H. Pham, L. Pica, M. Piccini, L. Piccolo, B. Pietrzyk, G. Pietrzyk, R. N. Pilato, D. Pinci, F. Pisani, M. Pizzichemi, V. M. Placinta, M. Plo Casasus, T. Poeschl, F. Polci, M. Poli Lener, A. Poluektov, N. Polukhina, I. Polyakov, E. Polycarpo, S. Ponce, D. Popov, K. Popp, S. Poslavskii, K. Prasanth, C. Prouve, D. Provenzano, V. Pugatch, A. Puicercus Gomez, G. Punzi, J. R. Pybus, Q. Q. Qian, W. Qian, N. Qin, R. Quagliani, R. I. Rabadan Trejo, R. Racz, J. H. Rademacker, M. Rama, M. Ramírez García, V. Ramos De Oliveira, M. Ramos Pernas, M. S. Rangel, F. Ratnikov, G. Raven, M. Rebollo De Miguel, F. Redi, J. Reich, F. Reiss, Z. Ren, P. K. Resmi, M. Ribalda Galvez, R. Ribatti, G. Ricart, D. Riccardi, S. Ricciardi, K. Richardson, M. Richardson-Slipper, F. Riehn, K. Rinnert, P. Robbe, G. Robertson, E. Rodrigues, A. Rodriguez Alvarez, E. Rodriguez Fernandez, J. A. Rodriguez Lopez, E. Rodriguez Rodriguez, J. Roensch, A. Rogachev, A. Rogovskiy, D. L. Rolf, P. Roloff, V. Romanovskiy, A. Romero Vidal, G. Romolini, F. Ronchetti, T. Rong, M. Rotondo, S. R. Roy, M. S. Rudolph, M. Ruiz Diaz, R. A. Ruiz Fernandez, J. Ruiz Vidal, J. J. Saavedra-Arias, J. J. Saborido Silva, S. E. R. Sacha Emile R., N. Sagidova, D. Sahoo, N. Sahoo, B. Saitta, M. Salomoni, I. Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro, E. Santovetti, A. Saputi, D. Saranin, A. Sarnatskiy, G. Sarpis, M. Sarpis, C. Satriano, A. Satta, M. Saur, D. Savrina, H. Sazak, F. Sborzacchi, A. Scarabotto, S. Schael, S. Scherl, M. Schiller, H. Schindler, M. Schmelling, B. Schmidt, N. Schmidt, S. Schmitt, H. Schmitz, O. Schneider, A. Schopper, N. Schulte, M. H. Schune, G. Schwering, B. Sciascia, A. Sciuccati, G. Scriven, I. Segal, S. Sellam, A. Semennikov, T. Senger, M. Senghi Soares, A. Sergi, N. Serra, L. Sestini, A. Seuthe, B. Sevilla Sanjuan, Y. Shang, D. M. Shangase, M. Shapkin, R. S. Sharma, I. Shchemerov, L. Shchutska, T. Shears, L. Shekhtman, Z. Shen, S. Sheng, V. Shevchenko, B. Shi, Q. Shi, W. S. Shi, Y. Shimizu, E. Shmanin, R. Shorkin, J. D. Shupperd, R. Silva Coutinho, G. Simi, S. Simone, M. Singha, N. Skidmore, T. Skwarnicki, M. W. Slater, E. Smith, K. Smith, M. Smith, L. Soares Lavra, M. D. Sokoloff, F. J. P. Soler, A. Solomin, A. Solovev, K. Solovieva, N. S. Sommerfeld, R. Song, Y. Song, Y. Song, Y. S. Song, F. L. Souza De Almeida, B. Souza De Paula, K. M. Sowa, E. Spadaro Norella, E. Spedicato, J. G. Speer, P. Spradlin, F. Stagni, M. Stahl, S. Stahl, S. Stanislaus, M. Stefaniak, E. N. Stein, O. Steinkamp, D. Strekalina, Y. Su, F. Suljik, J. Sun, J. Sun, L. Sun, D. Sundfeld, W. Sutcliffe, P. Svihra, V. Svintozelskyi, K. Swientek, F. Swystun, A. Szabelski, T. Szumlak, Y. Tan, Y. Tang, Y. T. Tang, M. D. Tat, J. A. Teijeiro Jimenez, A. Terentev, F. Terzuoli, F. Teubert, E. Thomas, D. J. D. Thompson, A. R. Thomson-Strong, H. Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, T. T. Todorov, L. Tomassetti, G. Tonani, X. Tong, T. Tork, D. Torres Machado, L. Toscano, D. Y. Tou, C. Trippl, G. Tuci, N. Tuning, L. H. Uecker, A. Ukleja, D. J. Unverzagt, A. Upadhyay, B. Urbach, A. Usachov, A. Ustyuzhanin, U. Uwer, V. Vagnoni, A. Vaitkevicius, V. Valcarce Cadenas, G. Valenti, N. Valls Canudas, J. van Eldik, H. Van Hecke, E. van Herwijnen, C. B. Van Hulse, R. Van Laak, M. van Veghel, G. Vasquez, R. Vazquez Gomez, P. Vazquez Regueiro, C. Vázquez Sierra, S. Vecchi, J. Velilla Serna, J. J. Velthuis, M. Veltri, A. Venkateswaran, M. Verdoglia, M. Vesterinen, W. Vetens, D. Vico Benet, P. Vidrier Villalba, M. Vieites Diaz, X. Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, B. Vivacqua, F. C. Volle, D. vom Bruch, N. Voropaev, K. Vos, C. Vrahas, J. Wagner, J. Walsh, E. J. Walton, G. Wan, A. Wang, B. Wang, C. Wang, G. Wang, H. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M. Wang, N. W. Wang, R. Wang, X. Wang, X. Wang, X. W. Wang, Y. Wang, Y. Wang, Y. H. Wang, Z. Wang, Z. Wang, J. A. Ward, M. Waterlaat, N. K. Watson, D. Websdale, Y. Wei, Z. Weida, J. Wendel, B. D. C. Westhenry, C. White, M. Whitehead, E. Whiter, A. R. Wiederhold, D. Wiedner, M. A. Wiegertjes, C. Wild, G. Wilkinson, M. K. Wilkinson, M. Williams, M. J. Williams, M. R. J. Williams, R. Williams, S. Williams, Z. Williams, F. F. Wilson, M. Winn, W. Wislicki, M. Witek, L. Witola, T. Wolf, E. Wood, G. Wormser, S. A. Wotton, H. Wu, J. Wu, X. Wu, Y. Wu, Z. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, T. X. Xing, A. Xu, L. Xu, M. Xu, Z. Xu, Z. Xu, Z. Xu, S. Yadav, K. Yang, X. Yang, Y. Yang, Y. Yang, Z. Yang, V. Yeroshenko, H. Yeung, H. Yin, X. Yin, C. Y. Yu, J. Yu, X. Yuan, Y Yuan, J. A. Zamora Saa, M. Zavertyaev, M. Zdybal, F. Zenesini, C. Zeng, M. Zeng, C. Zhang, D. Zhang, J. Zhang, L. Zhang, R. Zhang, S. Zhang, S. L. Zhang, Y. Zhang, Y. Z. Zhang, Z. Zhang, Y. Zhao, A. Zhelezov, S. Z. Zheng, X. Z. Zheng, Y. Zheng, T. Zhou, X. Zhou, Y. Zhou, V. Zhovkovska, L. Z. Zhu, X. Zhu, X. Zhu, Y. Zhu, V. Zhukov, J. Zhuo, Q. Zou, D. Zuliani, G. Zunica Published: 12.04.2025 Updated: 12.04.2025 Summary A time- and flavour-integrated amplitude analysis of $B^0$ and $B^0_s$ decays to the $(K^+π^-)(K^-π^+)$ final state in the $K^*(892)^0 kern 0.18em overline{kern -0.18em K}{}^{*}(892)^0$ region is presented, using $pp$ collision data recorded with the LHCb detector in 2011–2018, corresponding to an integrated luminosity of $9,text{fb}^{-1}$. The branching fractions of the $B^0$ and $B^0_s$ decays are measured relative to the $B^0 to D^-π^+$ and $B^0_s to D^-_s π^+$ modes, respectively. The corresponding longitudinal polarisation fractions are found to be $f_L^{d} = 0.600 pm 0.022 pm 0.017$ and $f_L^{s} = 0.159 pm 0.010 pm 0.007$, where the uncertainties are statistical and systematic, respectively. The theory-motivated $L_{K^{*0} kern 0.18em overline{kern -0.18em K}{}^{*0}}$ observable is found to be $L_{K^{*0} kern 0.18em overline{kern -0.18em K}{}^{*0}} = 4.92 pm 0.55 pm 0.47 pm 0.02 pm 0.10$, where the uncertainties are statistical, systematic, due to uncertainty of external mass and lifetime measurements, and due to knowledge of the fragmentation fraction ratio, respectively. This confirms the previously reported tension between experimental determinations and theoretical predictions of longitudinal polarisation in $B to VV$ decays. Source arXiv: 2512.05102v1
Pump Free Microwave-Optical Quantum Transduction Authors Fangxin Li, Jaesung Heo, Zhaoyou Wang, Andrew P. Higginbotham, Alexander A. High, Liang Jiang Published: 12.04.2025 Updated: 12.04.2025 Summary Distributed quantum computing involves superconducting computation nodes operating at microwave frequencies, which are connected by long-distance transmission lines that transmit photons at optical frequencies. Quantum transduction, which coherently converts between microwave and optical (M-O) photons, is a critical component of such an architecture. Current approaches are hindered by the unavoidable problem of device heating due to the optical pump. In this work, we propose a pump-free scheme based on color centers that generates time-bin encoded M-O Bell pairs. Our scheme first creates spin-photon entanglement and then converts the spin state into a time-bin-encoded microwave photon using a strongly coupled Purcell-enhanced resonator. In our protocol, the microwave retrieval is heralded by detecting the microwave signal with a three-level transmon. We have analyzed the resulting Bell state fidelity and generation probability of this protocol. Our simulation shows that by combining a state-of-the-art spin-optical interface with our proposed strongly-coupled spin-microwave design, the pump-free scheme can generate M-O Bell pairs at a heralding rate exceeding one kilohertz with near-unity fidelity, which establishes the scheme as a promising source for M-O Bell pairs. Source arXiv: 2512.05096v1
Evidence for the semileptonic decays $Λ_c^{+} to Σ^{pm} π^{mp} e^+ ν_e$ Authors BESIII Collaboration, M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, R. Aliberti, A. Amoroso, Q. An, Y. Bai, O. Bakina, Y. Ban, H. -R. Bao, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, H. Cai, M. H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin, X. Y. Chai, J. F. Chang, G. R. Che, Y. Z. Che, G. Chelkov, C. H. Chen, Chao Chen, G. Chen, H. S. Chen, H. Y. Chen, M. L. Chen, S. J. Chen, S. L. Chen, S. M. Chen, T. Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, Z. K. Chen, S. K. Choi, X. Chu, G. Cibinetto, F. Cossio, J. J. Cui, H. L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, C. Q. Deng, Z. Y. Deng, A. Denig, I. Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding, Y. X. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, S. X. Du, Y. Y. Duan, Z. H. Duan, P. Egorov, G. F. Fan, J. J. Fan, Y. H. Fan, J. Fang, J. Fang, S. S. Fang, W. X. Fang, Y. Q. Fang, R. Farinelli, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, Y. T. Feng, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, X. B. Gao, Y. N. Gao, Y. N. Gao, Y. Y. Gao, Yang Gao, S. Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A. Gilman, K. Goetzen, J. D. Gong, L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu, Y. T. Gu, C. Y. Guan, A. Q. Guo, L. B. Guo, M. J. Guo, R. P. Guo, Y. P. Guo, A. Guskov, J. Gutierrez, K. L. Han, T. T. Han, F. Hanisch, K. D. Hao, X. Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, T. Holtmann, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, Q. P. Hu, S. L. Hu, T. Hu, Y. Hu, Z. M. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, P. Huang, X. T. Huang, Y. P. Huang, Y. S. Huang, T. Hussain, N. Hüsken, N. in der Wiesche, J. Jackson, S. Janchiv, Q. Ji, Q. P. Ji, W. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, Z. K. Jia, D. Jiang, H. B. Jiang, P. C. Jiang, S. J. Jiang, T. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, J. K. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, X. M. Jing, T. Johansson, S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang, M. Kavatsyuk, B. C. Ke, V. Khachatryan, A. Khoukaz, R. Kiuchi, O. B. Kolcu, B. Kopf, M. Kuessner, X. Kui, N. Kumar, A. Kupsc, W. Kühn, Q. Lan, W. N. Lan, T. T. Lei, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, C. K. Li, Cheng Li, D. M. Li, F. Li, G. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J. S. Li, K. Li, K. L. Li, K. L. Li, L. J. Li, Lei Li, M. H. Li, M. R. Li, P. L. Li, P. R. Li, Q. M. Li, Q. X. Li, R. Li, T. Li, T. Y. Li, W. D. Li, W. G. Li, X. Li, X. H. Li, X. L. Li, X. Y. Li, X. Z. Li, Y. Li, Y. G. Li, Y. P. Li, Z. J. Li, Z. Y. Li, C. Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. B. Liao, M. H. Liao, Y. P. Liao, J. Libby, A. Limphirat, C. C. Lin, C. X. Lin, D. X. Lin, L. Q. Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, F. Liu, F. H. Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. H. Liu, H. M. Liu, Huihui Liu, J. B. Liu, J. J. Liu, K. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C. Liu, Lu Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W. M. Liu, W. T. Liu, X. Liu, X. Liu, X. Y. Liu, Y. Liu, Y. Liu, Yuan Liu, Y. B. Liu, Z. A. Liu, Z. D. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, Y. Lu, Y. H. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, J. R. Luo, J. S. Luo, M. X. Luo, T. Luo, X. L. Luo, Z. Y. Lv, X. R. Lyu, Y. F. Lyu, Y. H. Lyu, F. C. Ma, H. Ma, H. L. Ma, J. L. Ma, L. L. Ma, L. R. Ma, Q. M. Ma, R. Q. Ma, R. Y. Ma, T. Ma, X. T. Ma, X. Y. Ma, Y. M. Ma, F. E. Maas, I. MacKay, M. Maggiora, S. Malde, Y. J. Mao, Z. P. Mao, S. Marcello, F. M. Melendi, Y. H. Meng, Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, B. Moses, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, L. S. Nie, I. B. Nikolaev, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan, A. Pathak, Y. P. Pei, M. Pelizaeus, H. P. Peng, Y. Y. Peng, K. Peters, J. L. Ping, R. G. Ping, S. Plura, V. Prasad, F. Z. Qi, H. R. Qi, M. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. H. Qiao, J. J. Qin, J. L. Qin, L. Q. Qin, L. Y. Qin, P. B. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, Z. H. Qu, C. F. Redmer, A. Rivetti, M. Rolo, G. Rong, S. S. Rong, F. Rosini, Ch. Rosner, M. Q. Ruan, N. Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X. Y. Shan, Z. J. Shang, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. Shi, J. L. Shi, J. Y. Shi, S. Y. Shi, X. Shi, H. L. Song, J. J. Song, T. Z. Song, W. M. Song, Y. X. Song, S. Sosio, S. Spataro, F. Stieler, S. S Su, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, Y. C. Sun, Y. H. Sun, Y. J. Sun, Y. Z. Sun, Z. Q. Sun, Z. T. Sun, C. J. Tang, G. Y. Tang, J. Tang, L. F. Tang, M. Tang, Y. A. Tang, L. Y. Tao, M. Tat, J. X. Teng, J. Y. Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, B. Wang, B. Wang, Bo Wang, C. Wang, Cong Wang, D. Y. Wang, H. J. Wang, J. J. Wang, K. Wang, L. L. Wang, L. W. Wang, M. Wang, M. Wang, N. Y. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, Wei Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, X. N. Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. L. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi Wang, Yuan Wang, Z. Wang, Z. L. Wang, Z. L. Wang, Z. Q. Wang, Z. Y. Wang, D. H. Wei, H. R. Wei, F. Weidner, S. P. Wen, Y. R. Wen, U. Wiedner, G. Wilkinson, M. Wolke, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, Lianjie Wu, S. G. Wu, S. M. Wu, X. Wu, X. H. Wu, Y. J. Wu, Z. Wu, L. Xia, X. M. Xian, B. H. Xiang, T. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, K. J. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, H. Y. Xu, M. Xu, Q. J. Xu, Q. N. Xu, W. L. Xu, X. P. Xu, Y. Xu, Y. Xu, Y. C. Xu, Z. S. Xu, H. Y. Yan, L. Yan, W. B. Yan, W. C. Yan, W. P. Yan, X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, J. H. Yang, R. J. Yang, T. Yang, Y. Yang, Y. F. Yang, Y. H. Yang, Y. Q. Yang, Y. X. Yang, Y. Z. Yang, M. Ye, M. H. Ye, Z. J. Ye, Junhao Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, M. C. Yu, T. Yu, X. D. Yu, Y. C. Yu, C. Z. Yuan, H. Yuan, J. Yuan, J. Yuan, L. Yuan, S. C. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, Ying Yue, A. A. Zafar, S. H. Zeng, X. Zeng, Y. Zeng, Yujie Zeng, Y. J. Zeng, X. Y. Zhai, Y. H. Zhan, A. Q. Zhang, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, G. Y. Zhang, H. Zhang, H. Zhang, H. C. Zhang, H. H. Zhang, H. Q. Zhang, H. R. Zhang, H. Y. Zhang, Jin Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. S. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, L. M. Zhang, Lei Zhang, N. Zhang, P. Zhang, Q. Zhang, Q. Y. Zhang, R. Y. Zhang, S. H. Zhang, Shulei Zhang, X. M. Zhang, X. Y Zhang, X. Y. Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. M. Zhang, Z. D. Zhang, Z. H. Zhang, Z. L. Zhang, Z. L. Zhang, Z. X. Zhang, Z. Y. Zhang, Z. Y. Zhang, Z. Z. Zhang, Zh. Zh. Zhang, G. Zhao, J. Y. Zhao, J. Z. Zhao, L. Zhao, Lei Zhao, M. G. Zhao, N. Zhao, R. P. Zhao, S. J. Zhao, Y. B. Zhao, Y. L. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, B. M. Zheng, J. P. Zheng, W. J. Zheng, X. R. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, J. Q. Zhou, J. Y. Zhou, S. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, Z. C. Zhou, A. N. Zhu, J. Zhu, K. Zhu, K. J. Zhu, K. S. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, T. J. Zhu, W. D. Zhu, W. D. Zhu, W. J. Zhu, W. Z. Zhu, Y. C. Zhu, Z. A. Zhu, X. Y. Zhuang, J. H. Zou, J. Zu Published: 12.04.2025 Updated: 12.04.2025 Summary Using $4.5, fb^{-1}$ of $e^+e^-$ collision data collected by the BESIII detector at center-of-mass energies between $4.600$ and $4.699,GeV$, we search for the semileptonic decays $Λ_c^{+} to Σ^{+} π^{-} e^+ ν_e$ and $Λ_c^{+} to Σ^{-} π^{+} e^+ ν_e$ for the first time. Assuming their branching fractions are equal under isospin symmetry, evidence for $Λ_c^{+} to Σ^{pm} π^{mp} e^+ ν_e$ is reported with a significance of $3.6σ$. The corresponding branching fraction is measured to be $mathcal{B}(Λ_c^{+} to Σ^pmπ^mp e^+ν_e) = (7.7^{+2.5}_{-2.3_{rm stat.}}pm1.3_{rm syst.})times 10^{-4}$, which is consistent with quark model predictions within two standard deviations. Source arXiv: 2512.05178v1
Nex-N1: Agentic Models Trained via a Unified Ecosystem for Large-Scale Environment Construction Authors Nex-AGI Team, :, Yuxuan Cai, Lu Chen, Qiaoling Chen, Yuyang Ding, Liwen Fan, Wenjie Fu, Yufei Gao, Honglin Guo, Pinxue Guo, Zhenhua Han, Zhengfu He, Hanglei Hu, Kai Hu, Shengjia Hua, Tianyu Huai, Baodai Huang, Li Ji, Zhen Jiang, Zhikai Lei, Bufan Li, Jiahang Lin, Lizhi Lin, Jinxiu Liu, Shichun Liu, Ziming Liu, Yuchen Ni, Pengfang Qian, Yujiong Shen, Qingyun Shi, Wentao Shu, Peng Sun, Yiran Suo, Tian Tang, Boyu Tian, Guoteng Wang, Junzhe Wang, Peixin Wang, Zhiheng Xi, Hang Yan, Jie Yang, Zhixiong Yang, Tianchu Yao, Guangze Ye, Qianxi Yu, Shuo Zhang, Xinyue Zhang, Yiqi Zhang, Jiarong Zhao, Miao Zheng, Rui Zheng, Enyu Zhou, Jiazheng Zhou, Maosen Zhou, Yuhao Zhou, Tao Gui, Yining Zheng, Xinchi Chen, Jie Zhou, Siyuan Feng, Qin Chen, Liang He, Qi Zhang, Xuanjing Huang, Xipeng Qiu Published: 12.04.2025 Updated: 12.04.2025 Summary The evolution of Large Language Models (LLMs) from passive responders to autonomous agents necessitates a fundamental shift in learning paradigms — from static imitation to incentive-driven decision making. However, this transition is significantly impeded by the lack of scalable infrastructure capable of constructing high-quality interaction signals for effective policy learning. To address this, we introduce a comprehensive method designed to systematically scale the diversity and complexity of interactive environments. Our method realizes this scaling by addressing three orthogonal dimensions: (1) Complexity: NexAU, a flexible agent framework that supports building complex agent hierarchies via simple configurations; (2) Diversity: NexA4A automatically generates diverse agent hierarchies from natural language to cover infinite domains; and (3) Fidelity: NexGAP bridges the simulation-reality gap by integrating dynamic real-world environment for grounded trajectories synthesis. We train Nex-N1 upon the diverse and complex interactive environments established by our infrastructure. Empirical results on benchmarks such as SWE-bench and tau2 demonstrate that Nex-N1 consistently outperforms SOTA open-source models and achieves competitive performance against frontier proprietary models on complex agentic tasks. We open-source the Nex ecosystem and model weights to facilitate further research. Source arXiv: 2512.04987v1
Study of the reaction $Ξ^{0}nrightarrowΛΛX$ using $Ξ^{0}$-nucleus scattering Authors BESIII Collaboration, M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, R. Aliberti, A. Amoroso, Q. An, Y. Bai, O. Bakina, Y. Ban, H. -R. Bao, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, H. Cai, M. H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin, X. Y. Chai, J. F. Chang, G. R. Che, Y. Z. Che, C. H. Chen, Chao Chen, G. Chen, H. S. Chen, H. Y. Chen, M. L. Chen, S. J. Chen, S. L. Chen, S. M. Chen, T. Chen, X. R. Chen, X. T. Chen, X. Y. Chen, Y. B. Chen, Y. Q. Chen, Y. Q. Chen, Z. Chen, Z. J. Chen, Z. K. Chen, J. C. Cheng, S. K. Choi, X. Chu, G. Cibinetto, F. Cossio, J. Cottee-Meldrum, J. J. Cui, H. L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, C. Q. Deng, Z. Y. Deng, A. Denig, I. Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding, Y. X. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, S. X. Du, Y. Y. Duan, Z. H. Duan, P. Egorov, G. F. Fan, J. J. Fan, Y. H. Fan, J. Fang, J. Fang, S. S. Fang, W. X. Fang, Y. Q. Fang, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, L. Feng, Q. X. Feng, Y. T. Feng, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, X. B. Gao, Y. Gao, Y. N. Gao, Y. N. Gao, Y. Y. Gao, S. Garbolino, I. Garzia, L. Ge, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A. Gilman, K. Goetzen, J. D. Gong, L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu, Y. T. Gu, C. Y. Guan, A. Q. Guo, L. B. Guo, M. J. Guo, R. P. Guo, Y. P. Guo, A. Guskov, J. Gutierrez, K. L. Han, T. T. Han, F. Hanisch, K. D. Hao, X. Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, Q. P. Hu, S. L. Hu, T. Hu, Y. Hu, Z. M. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, P. Huang, X. T. Huang, Y. P. Huang, Y. S. Huang, T. Hussain, N. Hüsken, N. in der Wiesche, J. Jackson, Q. Ji, Q. P. Ji, W. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, Z. K. Jia, D. Jiang, H. B. Jiang, P. C. Jiang, S. J. Jiang, T. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, J. K. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, X. M. Jing, T. Johansson, S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang, M. Kavatsyuk, B. C. Ke, V. Khachatryan, A. Khoukaz, R. Kiuchi, O. B. Kolcu, B. Kopf, M. Kuessner, X. Kui, N. Kumar, A. Kupsc, W. Kühn, Q. Lan, W. N. Lan, T. T. Lei, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, C. K. Li, D. M. Li, F. Li, G. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J. S. Li, K. Li, K. L. Li, K. L. Li, L. J. Li, Lei Li, M. H. Li, M. R. Li, P. L. Li, P. R. Li, Q. M. Li, Q. X. Li, R. Li, S. X. Li, T. Li, T. Y. Li, W. D. Li, W. G. Li, X. Li, X. H. Li, X. L. Li, X. Y. Li, X. Z. Li, Y. Li, Y. G. Li, Y. P. Li, Z. J. Li, Z. Y. Li, C. Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. B. Liao, M. H. Liao, Y. P. Liao, J. Libby, A. Limphirat, C. C. Lin, D. X. Lin, L. Q. Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, F. Liu, F. H. Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. H. Liu, H. M. Liu, Huihui Liu, J. B. Liu, J. J. Liu, K. Liu, K. Liu, K. Y. Liu, Ke Liu, L. C. Liu, Lu Liu, M. H. Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W. M. Liu, W. T. Liu, X. Liu, X. Liu, X. K. Liu, X. L. Liu, X. Y. Liu, Y. Liu, Y. Liu, Yuan Liu, Y. B. Liu, Z. A. Liu, Z. D. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. H. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, J. R. Luo, J. S. Luo, M. X. Luo, T. Luo, X. L. Luo, Z. Y. Lv, X. R. Lyu, Y. F. Lyu, Y. H. Lyu, F. C. Ma, H. L. Ma, Heng Ma, J. L. Ma, L. L. Ma, L. R. Ma, Q. M. Ma, R. Q. Ma, R. Y. Ma, T. Ma, X. T. Ma, X. Y. Ma, Y. M. Ma, F. E. Maas, I. MacKay, M. Maggiora, S. Malde, Q. A. Malik, H. X. Mao, Y. J. Mao, Z. P. Mao, S. Marcello, A. Marshall, F. M. Melendi, Y. H. Meng, Z. X. Meng, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, B. Moses, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, L. S. Nie, I. B. Nikolaev, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, C. Normand, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan, A. Pathak, Y. P. Pei, M. Pelizaeus, H. P. Peng, X. J. Peng, Y. Y. Peng, K. Peters, K. Petridis, J. L. Ping, R. G. Ping, S. Plura, V. Prasad, F. Z. Qi, H. R. Qi, M. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. H. Qiao, J. J. Qin, J. L. Qin, L. Q. Qin, L. Y. Qin, P. B. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, Z. H. Qu, J. Rademacker, K. Ravindran, C. F. Redmer, A. Rivetti, M. Rolo, G. Rong, S. S. Rong, F. Rosini, Ch. Rosner, M. Q. Ruan, N. Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X. Y. Shan, Z. J. Shang, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. Shi, J. L. Shi, J. Y. Shi, S. Y. Shi, X. Shi, H. L. Song, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y. X. Song, Zirong Song, S. Sosio, S. Spataro, S. Stansilaus, F. Stieler, S. S Su, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, Y. C. Sun, Y. H. Sun, Y. J. Sun, Y. Z. Sun, Z. Q. Sun, Z. T. Sun, C. J. Tang, G. Y. Tang, J. Tang, J. J. Tang, L. F. Tang, Y. A. Tang, L. Y. Tao, M. Tat, J. X. Teng, J. Y. Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, B. Wang, B. Wang, Bo Wang, C. Wang, C. Wang, Cong Wang, D. Y. Wang, H. J. Wang, J. J. Wang, K. Wang, L. L. Wang, L. W. Wang, M. Wang, M. Wang, N. Y. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, Wei Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, X. N. Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. J. Wang, Y. L. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi Wang, Yuan Wang, Z. Wang, Z. L. Wang, Z. L. Wang, Z. Q. Wang, Z. Y. Wang, D. H. Wei, H. R. Wei, F. Weidner, S. P. Wen, Y. R. Wen, U. Wiedner, G. Wilkinson, M. Wolke, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, L. J. Wu, Lianjie Wu, S. G. Wu, S. M. Wu, X. Wu, X. H. Wu, Y. J. Wu, Z. Wu, L. Xia, X. M. Xian, B. H. Xiang, D. Xiao, G. Y. Xiao, H. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, K. J. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, H. Y. Xu, M. Xu, Q. J. Xu, Q. N. Xu, T. D. Xu, W. Xu, W. L. Xu, X. P. Xu, Y. Xu, Y. Xu, Y. C. Xu, Z. S. Xu, F. Yan, H. Y. Yan, L. Yan, W. B. Yan, W. C. Yan, W. H. Yan, W. P. Yan, X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, J. H. Yang, R. J. Yang, T. Yang, Y. Yang, Y. F. Yang, Y. H. Yang, Y. Q. Yang, Y. X. Yang, Y. Z. Yang, M. Ye, M. H. Ye, Z. J. Ye, Junhao Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, L. Q. Yu, M. C. Yu, T. Yu, X. D. Yu, Y. C. Yu, C. Z. Yuan, H. Yuan, J. Yuan, J. Yuan, L. Yuan, S. C. Yuan, S. H. Yuan, X. Q. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, Ying Yue, A. A. Zafar, S. H. Zeng, X. Zeng, Y. Zeng, Yujie Zeng, Y. J. Zeng, X. Y. Zhai, Y. H. Zhan, Shunan Zhang, A. Q. Zhang, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, G. Y. Zhang, H. Zhang, H. Zhang, H. C. Zhang, H. H. Zhang, H. Q. Zhang, H. R. Zhang, H. Y. Zhang, Jin Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. S. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, L. M. Zhang, Lei Zhang, N. Zhang, P. Zhang, Q. Zhang, Q. Y. Zhang, R. Y. Zhang, S. H. Zhang, Shulei Zhang, X. M. Zhang, X. Y Zhang, X. Y. Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. M. Zhang, Y. P. Zhang, Z. D. Zhang, Z. H. Zhang, Z. L. Zhang, Z. L. Zhang, Z. X. Zhang, Z. Y. Zhang, Z. Y. Zhang, Z. Z. Zhang, Zh. Zh. Zhang, G. Zhao, J. Y. Zhao, J. Z. Zhao, L. Zhao, L. Zhao, M. G. Zhao, N. Zhao, R. P. Zhao, S. J. Zhao, Y. B. Zhao, Y. L. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, B. M. Zheng, J. P. Zheng, W. J. Zheng, X. R. Zheng, Y. H. Zheng, B. Zhong, C. Zhong, H. Zhou, J. Q. Zhou, J. Y. Zhou, S. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. X. Zhou, Y. Z. Zhou, A. N. Zhu, J. Zhu, K. Zhu, K. J. Zhu, K. S. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, T. J. Zhu, W. D. Zhu, W. D. Zhu, W. J. Zhu, W. Z. Zhu, Y. C. Zhu, Z. A. Zhu, X. Y. Zhuang, J. H. Zou, J. Zu Published: 12.04.2025 Updated: 12.04.2025 Summary Using $(10087pm44)times10^{6}$$J/ψ$ events collected with the BESIII detector operating at the BEPCII storage ring in $2009$, $2012$, $2018$, and $2019$, we perform a search for the reaction $Ξ^0nrightarrowΛΛX$, where $X$ denotes any additional final particles. Given the highly suppressed phase space for producing extra pions, the $X$ consists of either nothing or a photon, corresponding to the processes $Ξ^0 n rightarrow ΛΛ$ and $Ξ^{0}nrightarrowΛΣ^0rightarrowΛΛγ$. The $Ξ^0$ comes from the decay of $J/ψrightarrowΞ^0barΞ^0$, while the neutron originates from material of the beam pipe. A signal is observed for the first time with a statistical significance of 6.4$σ$. The cross section for the reaction $Ξ^0+{^9rm{Be}}rightarrowΛ+Λ+X$ is measured to be $(43.6pm10.5_{text{stat}}pm11.1_{text{syst}})$ mb at $P_{Ξ^0}approx0.818$ GeV/$c$, where the first uncertainty is statistical and the second systematic. No significant $H$-dibaryon signal is observed in the $ΛΛ$ final state. Source arXiv: 2512.04701v1
FLEX: Leveraging FPGA-CPU Synergy for Mixed-Cell-Height Legalization Acceleration Authors Xingyu Liu, Jiawei Liang, Linfeng Du, Yipu Zhang, Chaofang Ma, Hanwei Fan, Jiang Xu, Wei Zhang Published: 12.04.2025 Updated: 12.04.2025 Summary In this work, we present FLEX, an FPGA-CPU accelerator for mixed-cell-height legalization tasks. We address challenges from the following perspectives. First, we optimize the task assignment strategy and perform an efficient task partition between FPGA and CPU to exploit their complementary strengths. Second, a multi-granularity pipelining technique is employed to accelerate the most time-consuming step, finding optimal placement position (FOP), in legalization. At last, we particularly target the computationally intensive cell shifting process in FOP, optimizing the design to align it seamlessly with the multi-granularity pipelining framework for further speedup. Experimental results show that FLEX achieves up to 18.3x and 5.4x speedups compared to state-of-the-art CPU-GPU and multi-threaded CPU legalizers with better scalability, while improving legalization quality by 4% and 1%. Source arXiv: 2512.04527v1
SmartAlert: Implementing Machine Learning-Driven Clinical Decision Support for Inpatient Lab Utilization Reduction Authors April S. Liang, Fatemeh Amrollahi, Yixing Jiang, Conor K. Corbin, Grace Y. E. Kim, David Mui, Trevor Crowell, Aakash Acharya, Sreedevi Mony, Soumya Punnathanam, Jack McKeown, Margaret Smith, Steven Lin, Arnold Milstein, Kevin Schulman, Jason Hom, Michael A. Pfeffer, Tho D. Pham, David Svec, Weihan Chu, Lisa Shieh, Christopher Sharp, Stephen P. Ma, Jonathan H. Chen Published: 12.04.2025 Updated: 12.04.2025 Summary Repetitive laboratory testing unlikely to yield clinically useful information is a common practice that burdens patients and increases healthcare costs. Education and feedback interventions have limited success, while general test ordering restrictions and electronic alerts impede appropriate clinical care. We introduce and evaluate SmartAlert, a machine learning (ML)-driven clinical decision support (CDS) system integrated into the electronic health record that predicts stable laboratory results to reduce unnecessary repeat testing. This case study describes the implementation process, challenges, and lessons learned from deploying SmartAlert targeting complete blood count (CBC) utilization in a randomized controlled pilot across 9270 admissions in eight acute care units across two hospitals between August 15, 2024, and March 15, 2025. Results show significant decrease in number of CBC results within 52 hours of SmartAlert display (1.54 vs 1.82, p <0.01) without adverse effect on secondary safety outcomes, representing a 15% relative reduction in repetitive testing. Implementation lessons learned include interpretation of probabilistic model predictions in clinical contexts, stakeholder engagement to define acceptable model behavior, governance processes for deploying a complex model in a clinical environment, user interface design considerations, alignment with clinical operational priorities, and the value of qualitative feedback from end users. In conclusion, a machine learning-driven CDS system backed by a deliberate implementation and governance process can provide precision guidance on inpatient laboratory testing to safely reduce unnecessary repetitive testing. Source arXiv: 2512.04354v1
Measurement of the hyperon weak radiative decay $Ξ^0toγΣ^0$ at BESIII Authors BESIII Collaboration, M. Ablikim, M. N. Achasov, P. Adlarson, X. C. Ai, R. Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I. Balossino, Y. Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A. Briere, A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A. Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C. Chen, Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. L. Chen, S. M. Chen, T. Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S. Cheng, S. K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H. L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I. Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, Z. H. Duan, P. Egorov, Y. H. Fan, J. Fang, S. S. Fang, W. X. Fang, Y. Fang, R. Farinelli, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, K Fischer, M. Fritsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Y. N. Gao, Yang Gao, S. Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A Gilman, K. Goetzen, L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu, Y. T. Gu, C. Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, M. J. Guo, R. P. Guo, Y. P. Guo, A. Guskov, T. T. Han, W. Y. Han, X. Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H. H. Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, T. Holtmann, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, X. T. Huang, Y. P. Huang, T. Hussain, N Hüsken, N. in der Wiesche, M. Irshad, J. Jackson, S. Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, X. Q. Jia, Z. K. Jia, H. J. Jiang, P. C. Jiang, S. S. Jiang, T. J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, T. Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang, M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R. Kliemt, O. B. Kolcu, B. Kopf, M. Kuessner, A. Kupsc, W. Kühn, J. J. Lane, P. Larin, A. Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei, H. Leithoff, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, Cheng Li, D. M. Li, F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J. S. Li, J. W. Li, K. L. Li, Ke Li, L. J Li, L. K. Li, Lei Li, M. H. Li, P. R. Li, Q. X. Li, S. X. Li, T. Li, W. D. Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J. Li, Z. X. Li, C. Liang, H. Liang, H. Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. Z. Liao, Y. P. Liao, J. Libby, A. Limphirat, D. X. Lin, T. Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, F. H. Liu, Fang Liu, Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui Liu, J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W. M. Liu, X. Liu, Y. Liu, Y. Liu, Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, M. X. Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma, J. L. Ma, L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma, Y. M. Ma, F. E. Maas, M. Maggiora, S. Malde, Q. A. Malik, A. Mangoni, Y. J. Mao, Z. P. Mao, S. Marcello, Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, I. B. Nikolaev, Z. Ning, S. Nisar, Q. L. Niu, W. D. Niu, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan, A. Pathak, P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, Y. Y. Peng, K. Peters, J. L. Ping, R. G. Ping, S. Plura, V. Prasad, F. Z. Qi, H. Qi, H. R. Qi, M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K. J. Ren, A. Rivetti, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N. Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X. Y. Shan, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q. Q. Shi, R. S. Shi, X. Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y. X. Song, S. Sosio, S. Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. Sun, Y. J. Sun, Y. Z. Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J. Tang, Y. A. Tang, L. Y Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H. Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, S. J. Wang, B. Wang, B. L. Wang, Bo Wang, C. W. Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, J. P. Wang, K. Wang, L. L. Wang, M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, W. Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi Wang, Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D. H. Wei, F. Weidner, S. P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M. Wolke, L. Wollenberg, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu, Y. Wu, Y. H. Wu, Y. J. Wu, Z. Wu, L. Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, S. Y. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, W. Xu, W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, Z. S. Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan, X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao Yang, Y. Yang, Y. F. Yang, Y. X. Yang, Yifan Yang, Z. W. Yang, Z. P. Yao, M. Ye, M. H. Ye, J. H. Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, T. Yu, X. D. Yu, C. Z. Yuan, L. Yuan, S. C. Yuan, X. Q. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, A. A. Zafar, F. R. Zeng, X. Zeng, Y. Zeng, Y. J. Zeng, X. Y. Zhai, Y. C. Zhai, Y. H. Zhan, A. Q. Zhang, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, H. Zhang, H. C. Zhang, H. H. Zhang, H. H. Zhang, H. Q. Zhang, H. Y. Zhang, J. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jiawei Zhang, L. M. Zhang, L. Q. Zhang, Lei Zhang, P. Zhang, Q. Y. Zhang, Shuihan Zhang, Shulei Zhang, X. D. Zhang, X. M. Zhang, X. Y. Zhang, Xuyan Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z. Y. Zhang, Z. Y. Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao, Ling Zhao, M. G. Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, L. P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, J. Zhu, K. Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu, T. J. Zhu, W. J. Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu Published: 12.03.2025 Updated: 12.03.2025 Summary The hyperon weak radiative decay $Ξ^0toγΣ^0$ is measured via the process $J/ψtoΞ^0barΞ^0$. The absolute branching fraction of $Ξ^0toγΣ^0$ is determined to be $(3.69pm 0.21_{text{stat}}pm0.12_{text{syst}})times 10^{-3}$, based on $(10.087pm 0.044)times 10^{9}$ $J/ψ$ events collected with the BESIII detector operating at the BEPCII collider. The decay asymmetry parameter is measured, with a complete angular analysis of the cascade decay chain, to be $α_γ = -0.807pm 0.095_{text{stat}}pm 0.011_{text{syst}}$. Source arXiv: 2512.03877v1
A Comprehensive Survey of 3GPP Release 19 ISAC Channel Modeling: From Empirical Features to Unified Methodology and Standardized Simulator Authors Yameng Liu, Yuxiang Zhang, Jianhua Zhang, Yuanpeng Pei, Changsheng Zhao, Shilin Luo, Lei Tian, Yingyang Li, Wei Hong, Jianming Wu, Guangyi Liu, Yan Li, Tao Jiang, Chuangxin Jiang, Junchen Liu, Yongqiang Fei, Woo-Suk Ko, Jing Xu, Bin Liang, Takahiro Tomie Published: 12.03.2025 Updated: 12.03.2025 Summary Integrated Sensing and Communication (ISAC) has been identified as a key 6G application by ITU and 3GPP. Channel measurement and modeling is a prerequisite for ISAC system design and has attracted widespread attention from both academia and industry. 3GPP Release 19 initiated the ISAC channel study item in December 2023 and finalized its modeling specification in May 2025 after extensive technical discussions. However, a comprehensive survey that provides a systematic overview,from empirical channel features to modeling methodologies and standardized simulators,remains unavailable. In this paper, the key requirements and challenges in ISAC channel research are first analyzed, followed by a structured overview of the standardization workflow throughout the 3GPP Release 19 process. Then, critical aspects of ISAC channels, including physical objects, target channels, and background channels, are examined in depth, together with additional features such as spatial consistency, environment objects, Doppler characteristics, and shared clusters, supported by measurement-based analysis. To establish a unified ISAC channel modeling framework, an Extended Geometry-based Stochastic Model (E-GBSM) is proposed, incorporating all the aforementioned ISAC channel characteristics. Finally, a standardized simulator is developed based on E-GBSM, and a two-phase calibration procedure aligned with 3GPP Release 19 is conducted to validate both the model and the simulator, demonstrating close agreement with industrial reference results. Overall, this paper provides a systematic survey of 3GPP Release 19 ISAC channel standardization and offers insights into best practices for new feature characterization, unified modeling methodology, and standardized simulator implementation, which can effectively supporting ISAC technology evaluation and future 6G standardization. Source arXiv: 2512.03506v1
Tunable giant Purcell enhancement of quantum light emitters by means of acoustic graphene plasmons Authors Justin Gruber, Mahtab A. Khan, Dirk R. Englund, Michael N. Leuenberger Published: 12.02.2025 Updated: 12.02.2025 Summary Inspired by the remarkable ability of plasmons to boost radiative emission rates, we propose leveraging acoustic graphene plasmons (AGPs) to realize tunable, giant Purcell enhancements for single-photon, entangled-photon, and multipolar quantum emitters. These AGPs are localized inside a cavity defined by a graphene sheet and a metallic nanocube and filled with a dielectric of thickness of a few nanometers and consisting of stacked layers of 2D materials, containing impurities or defects that act as quantum light emitters. Through finite-difference time domain (FDTD) calculations, we show that this geometry can achieve giant Purcell enhancement factors over a large portion of the infrared (IR) spectrum, up to 6 orders of magnitude in the mid-IR and up to 4 orders of magnitude at telecommunications wavelengths, reaching quantum efficiencies of 95% and 89%, respectively, with high-mobility graphene. We obtain Purcell enhancement factors for single-photon electric dipole (E1), electric quadrupole (E2), and electric octupole (E3) transitions and two-photon spontaneous emission (2PSE) transitions, of the orders of $10^{4}$, $10^{7}$, $10^{9}$, and $10^9$, respectively, and a quantum efficiency of 79% for entangled-photon emission with high-mobility graphene at a wavelength of $λ=1.55$ $μ$m. Importantly, AGP mode frequencies depend on the graphene Fermi energy, which can be tuned via electrostatic gating to modulate fluorescence enhancement in real time. As an example, we consider the Purcell enhancement of spontaneous single- and two-photon emissions from an erbium atom inside single-layer (SL) WS$_2$. Our results could be useful for electrically tunable quantum emitter devices with applications in quantum communication and quantum information processing. Source arXiv: 2512.02907v1
DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models Authors DeepSeek-AI, Aixin Liu, Aoxue Mei, Bangcai Lin, Bing Xue, Bingxuan Wang, Bingzheng Xu, Bochao Wu, Bowei Zhang, Chaofan Lin, Chen Dong, Chengda Lu, Chenggang Zhao, Chengqi Deng, Chenhao Xu, Chong Ruan, Damai Dai, Daya Guo, Dejian Yang, Deli Chen, Erhang Li, Fangqi Zhou, Fangyun Lin, Fucong Dai, Guangbo Hao, Guanting Chen, Guowei Li, H. Zhang, Hanwei Xu, Hao Li, Haofen Liang, Haoran Wei, Haowei Zhang, Haowen Luo, Haozhe Ji, Honghui Ding, Hongxuan Tang, Huanqi Cao, Huazuo Gao, Hui Qu, Hui Zeng, Jialiang Huang, Jiashi Li, Jiaxin Xu, Jiewen Hu, Jingchang Chen, Jingting Xiang, Jingyang Yuan, Jingyuan Cheng, Jinhua Zhu, Jun Ran, Junguang Jiang, Junjie Qiu, Junlong Li, Junxiao Song, Kai Dong, Kaige Gao, Kang Guan, Kexin Huang, Kexing Zhou, Kezhao Huang, Kuai Yu, Lean Wang, Lecong Zhang, Lei Wang, Liang Zhao, Liangsheng Yin, Lihua Guo, Lingxiao Luo, Linwang Ma, Litong Wang, Liyue Zhang, M. S. Di, M. Y Xu, Mingchuan Zhang, Minghua Zhang, Minghui Tang, Mingxu Zhou, Panpan Huang, Peixin Cong, Peiyi Wang, Qiancheng Wang, Qihao Zhu, Qingyang Li, Qinyu Chen, Qiushi Du, Ruiling Xu, Ruiqi Ge, Ruisong Zhang, Ruizhe Pan, Runji Wang, Runqiu Yin, Runxin Xu, Ruomeng Shen, Ruoyu Zhang, S. H. Liu, Shanghao Lu, Shangyan Zhou, Shanhuang Chen, Shaofei Cai, Shaoyuan Chen, Shengding Hu, Shengyu Liu, Shiqiang Hu, Shirong Ma, Shiyu Wang, Shuiping Yu, Shunfeng Zhou, Shuting Pan, Songyang Zhou, Tao Ni, Tao Yun, Tian Pei, Tian Ye, Tianyuan Yue, Wangding Zeng, Wen Liu, Wenfeng Liang, Wenjie Pang, Wenjing Luo, Wenjun Gao, Wentao Zhang, Xi Gao, Xiangwen Wang, Xiao Bi, Xiaodong Liu, Xiaohan Wang, Xiaokang Chen, Xiaokang Zhang, Xiaotao Nie, Xin Cheng, Xin Liu, Xin Xie, Xingchao Liu, Xingkai Yu, Xingyou Li, Xinyu Yang, Xinyuan Li, Xu Chen, Xuecheng Su, Xuehai Pan, Xuheng Lin, Xuwei Fu, Y. Q. Wang, Yang Zhang, Yanhong Xu, Yanru Ma, Yao Li, Yao Li, Yao Zhao, Yaofeng Sun, Yaohui Wang, Yi Qian, Yi Yu, Yichao Zhang, Yifan Ding, Yifan Shi, Yiliang Xiong, Ying He, Ying Zhou, Yinmin Zhong, Yishi Piao, Yisong Wang, Yixiao Chen, Yixuan Tan, Yixuan Wei, Yiyang Ma, Yiyuan Liu, Yonglun Yang, Yongqiang Guo, Yongtong Wu, Yu Wu, Yuan Cheng, Yuan Ou, Yuanfan Xu, Yuduan Wang, Yue Gong, Yuhan Wu, Yuheng Zou, Yukun Li, Yunfan Xiong, Yuxiang Luo, Yuxiang You, Yuxuan Liu, Yuyang Zhou, Z. F. Wu, Z. Z. Ren, Zehua Zhao, Zehui Ren, Zhangli Sha, Zhe Fu, Zhean Xu, Zhenda Xie, Zhengyan Zhang, Zhewen Hao, Zhibin Gou, Zhicheng Ma, Zhigang Yan, Zhihong Shao, Zhixian Huang, Zhiyu Wu, Zhuoshu Li, Zhuping Zhang, Zian Xu, Zihao Wang, Zihui Gu, Zijia Zhu, Zilin Li, Zipeng Zhang, Ziwei Xie, Ziyi Gao, Zizheng Pan, Zongqing Yao, Bei Feng, Hui Li, J. L. Cai, Jiaqi Ni, Lei Xu, Meng Li, Ning Tian, R. J. Chen, R. L. Jin, S. S. Li, Shuang Zhou, Tianyu Sun, X. Q. Li, Xiangyue Jin, Xiaojin Shen, Xiaosha Chen, Xinnan Song, Xinyi Zhou, Y. X. Zhu, Yanping Huang, Yaohui Li, Yi Zheng, Yuchen Zhu, Yunxian Ma, Zhen Huang, Zhipeng Xu, Zhongyu Zhang, Dongjie Ji, Jian Liang, Jianzhong Guo, Jin Chen, Leyi Xia, Miaojun Wang, Mingming Li, Peng Zhang, Ruyi Chen, Shangmian Sun, Shaoqing Wu, Shengfeng Ye, T. Wang, W. L. Xiao, Wei An, Xianzu Wang, Xiaowen Sun, Xiaoxiang Wang, Ying Tang, Yukun Zha, Zekai Zhang, Zhe Ju, Zhen Zhang, Zihua Qu Published: 12.02.2025 Updated: 12.02.2025 Summary We introduce DeepSeek-V3.2, a model that harmonizes high computational efficiency with superior reasoning and agent performance. The key technical breakthroughs of DeepSeek-V3.2 are as follows: (1) DeepSeek Sparse Attention (DSA): We introduce DSA, an efficient attention mechanism that substantially reduces computational complexity while preserving model performance in long-context scenarios. (2) Scalable Reinforcement Learning Framework: By implementing a robust reinforcement learning protocol and scaling post-training compute, DeepSeek-V3.2 performs comparably to GPT-5. Notably, our high-compute variant, DeepSeek-V3.2-Speciale, surpasses GPT-5 and exhibits reasoning proficiency on par with Gemini-3.0-Pro, achieving gold-medal performance in both the 2025 International Mathematical Olympiad (IMO) and the International Olympiad in Informatics (IOI). (3) Large-Scale Agentic Task Synthesis Pipeline: To integrate reasoning into tool-use scenarios, we developed a novel synthesis pipeline that systematically generates training data at scale. This methodology facilitates scalable agentic post-training, yielding substantial improvements in generalization and instruction-following robustness within complex, interactive environments. Source arXiv: 2512.02556v1
GUI Exploration Lab: Enhancing Screen Navigation in Agents via Multi-Turn Reinforcement Learning Authors Haolong Yan, Yeqing Shen, Xin Huang, Jia Wang, Kaijun Tan, Zhixuan Liang, Hongxin Li, Zheng Ge, Osamu Yoshie, Si Li, Xiangyu Zhang, Daxin Jiang Published: 12.02.2025 Updated: 12.02.2025 Summary With the rapid development of Large Vision Language Models, the focus of Graphical User Interface (GUI) agent tasks shifts from single-screen tasks to complex screen navigation challenges. However, real-world GUI environments, such as PC software and mobile Apps, are often complex and proprietary, making it difficult to obtain the comprehensive environment information needed for agent training and evaluation. This limitation hinders systematic investigation and benchmarking of agent navigation capabilities. To address this limitation, we introduce GUI Exploration Lab, a simulation environment engine for GUI agent navigation research that enables flexible definition and composition of screens, icons, and navigation graphs, while providing full access to environment information for comprehensive agent training and evaluation. Through extensive experiments, we find that supervised fine-tuning enables effective memorization of fundamental knowledge, serving as a crucial foundation for subsequent training. Building on this, single-turn reinforcement learning further enhances generalization to unseen scenarios. Finally, multi-turn reinforcement learning encourages the development of exploration strategies through interactive trial and error, leading to further improvements in screen navigation performance. We validate our methods on both static and interactive benchmarks, demonstrating that our findings generalize effectively to real-world scenarios. These findings demonstrate the advantages of reinforcement learning approaches in GUI navigation and offer practical guidance for building more capable and generalizable GUI agents. Source arXiv: 2512.02423v1
Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality Authors Shashwat Kumar, Eliott Rosenberg, Alejandro Grajales Dau, Rodrigo Cortinas, Dmitri Maslov, Richard Oliver, Adam Zalcman, Matthew Neeley, Alice Pagano, Aaron Szasz, Ilya Drozdov, Zlatko Minev, Craig Gidney, Noureldin Yosri, Stijn J. de Graaf, Aniket Maiti, Dmitry Abanin, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Hector Bates, Andreas Bengtsson, Martin Bigdeli, Alexander Bilmes, Simon Bilodeau, Felix Borjans, Alexandre Bourassa, Jenna Bovaird, Dylan Bowers, Leon Brill, Peter Brooks, Michael Broughton, David A. Browne, Brett Buchea, Bob B. Buckley, Tim Burger, Brian Burkett, Nicholas Bushnell, Jamal Busnaina, Anthony Cabrera, Juan Campero, Hung-Shen Chang, Silas Chen, Zijun Chen, Ben Chiaro, Liang-Ying Chih, Jahan Claes, Agnetta Y. Cleland, Bryan Cochrane, Matt Cockrell, Josh Cogan, Roberto Collins, Paul Conner, Harold Cook, William Courtney, Alexander L. Crook, Ben Curtin, Sayan Das, Laura De Lorenzo, Sean Demura, Agustin Di Paolo, Paul Donohoe, Andrew Dunsworth, Valerie Ehimhen, Alec Eickbusch, Aviv Moshe Elbag, Lior Ella, Mahmoud Elzouka, David Enriquez, Catherine Erickson, Vinicius S. Ferreira, Marcos Flores, Leslie Flores Burgos, Ebrahim Forati, Jeremiah Ford, Austin G. Fowler, Brooks Foxen, Masaya Fukami, Alan Wing Lun Fung, Lenny Fuste, Suhas Ganjam, Gonzalo Garcia, Christopher Garrick, Robert Gasca, Helge Gehring, Élie Genois, William Giang, Dar Gilboa, James E. Goeders, Ed Gonzales, Raja Gosula, Dietrich Graumann, Joel Grebel, Alex Greene, Jonathan A. Gross, Jose Guerrero, Tan Ha, Steve Habegger, Tanner Hadick, Monica Hansen, Matthew P. Harrigan, Sean D. Harrington, Jeanne Hartshorn, Stephen Heslin, Paula Heu, Oscar Higgott, Reno Hiltermann, Jeremy Hilton, Hsin-Yuan Huang, Mike Hucka, Ashley Huff, William J. Huggins, Evan Jeffrey, Shaun Jevons, Zhang Jiang, Xiaoxuan Jin, Cody Jones, Chaitali Joshi, Pavol Juhas, Andreas Kabel, Dvir Kafri, Hui Kang, Amir H. Karamlou, Ryan Kaufman, Kostyantyn Kechedzhi, Trupti Khaire, Tanuj Khattar, Mostafa Khezri, Seon Kim, Paul V. Klimov, Can M. Knaut, Bryce Kobrin, Alexander N. Korotkov, Fedor Kostritsa, John Mark Kreikebaum, Ryuho Kudo, Ben Kueffler, Arun Kumar, Vladislav D. Kurilovich, Vitali Kutsko, David Landhuis, Tiano Lange-Dei, Brandon W. Langley, Pavel Laptev, Kim-Ming Lau, Loïck Le Guevel, Emma Leavell, Justin Ledford, Joy Lee, Kenny Lee, Brian J. Lester, Wendy Leung, Lily L Li, Wing Yan Li, Alexander T. Lill, William P. Livingston, Matthew T. Lloyd, Aditya Locharla, Daniel Lundahl, Aaron Lunt, Sid Madhuk, Ashley Maloney, Salvatore Mandrà, Leigh S. Martin, Orion Martin, Eric Mascot, Paul Masih Das, Cameron Maxfield, Jarrod R. McClean, Matt McEwen, Seneca Meeks, Anthony Megrant, Kevin C. Miao, Reza Molavi, Sebastian Molina, Shirin Montazeri, Charles Neill, Michael Newman, Anthony Nguyen, Murray Nguyen, Chia-Hung Ni, Murphy Yuezhen Niu, Logan Oas, William D. Oliver, Raymond Orosco, Kristoffer Ottosson, Sherman Peek, David Peterson, Alex Pizzuto, Rebecca Potter, Orion Pritchard, Michael Qian, Chris Quintana, Ganesh Ramachandran, Arpit Ranadive, Matthew J. Reagor, Rachel Resnick, David M. Rhodes, Daniel Riley, Gabrielle Roberts, Roberto Rodriguez, Emma Ropes, Emma Rosenfeld, Dario Rosenstock, Elizabeth Rossi, David A. Rower, Kannan Sankaragomathi, Murat Can Sarihan, Kevin J. Satzinger, Sebastian Schroeder, Henry F. Schurkus, Aria Shahingohar, Michael J. Shearn, Aaron Shorter, Noah Shutty, Vladimir Shvarts, Volodymyr Sivak, Spencer Small, W. Clarke Smith, David A. Sobel, Barrett Spells, Sofia Springer, George Sterling, Jordan Suchard, Alexander Sztein, Madeline Taylor, Jothi Priyanka Thiruraman, Douglas Thor, Dogan Timucin, Eifu Tomita, Alfredo Torres, M. Mert Torunbalci, Hao Tran, Abeer Vaishnav, Justin Vargas, Sergey Vdovichev, Guifre Vidal, Catherine Vollgraff Heidweiller, Meghan Voorhees, Steven Waltman, Jonathan Waltz, Shannon X. Wang, Brayden Ware, James D. Watson, Travis Weidel, Theodore White, Kristi Wong, Bryan W. K. Woo, Christopher J. Wood, Maddy Woodson, Cheng Xing, Z. Jamie Yao, Ping Yeh, Bicheng Ying, Juhwan Yoo, Elliot Young, Grayson Young, Ran Zhang, Yaxing Zhang, Ningfeng Zhu, Nicholas Zobrist, Zhenjie Zou, Shruti Puri, Erik Lucero, Julian Kelly, Sergio Boixo, Yu Chen, Vadim Smelyanskiy, Hartmut Neven, Pedram Roushan, Michel Devoret Published: 12.01.2025 Updated: 12.01.2025 Summary The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen–Specker–Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms. Source arXiv: 2512.02284v1
