Searcharxiv⌕ Search

arXiv subjects

Jian Zhou

Publications and source records attributed to Jian Zhou.

At least 55 records · Page 3Linked to original sources

Azimuthal decorrelation in diffractive dijet production

We calculate the azimuthal angular decorrelation of diffractive dijets in ultra-peripheral heavy-ion, $ep$, and $eA$ collisions to probe non-perturbative diffractive transverse momentum-dependent distributions. Focusing on the dominant semi-inclusive channel with an unobserved semi-hard gluon, we perform an all-order resummation of soft gluon emissions for the transverse energy-energy correlator observable, accounting for both initial and final state radiation. We also analyze heavy-quark pair production and demonstrate the sensitivity of the decorrelation to the jet axis definition. Finally, we provide numerical predictions for relevant kinematics at LHC UPCs, HERA, and the future EIC. Our results demonstrate that the acoplanarity of diffractive dijet production could serve as a promising probe of diffractive transverse momentum-dependent distributions.

hep-ph↗

Light-Driven Ferroic Switching Enables Reversible Control of Hydrogen Adsorption Thermodynamics

Reversible ultrafast switching of surface thermodynamics is highly desirable for hydrogen storage and catalysis yet remains elusive at the nanoscale. Here we demonstrate that photoinduced ferroic-order switching in two-dimensional ionic ferroelectric monolayers enables rapid, reversible control of hydrogen binding. In TiGeSe$_3$, carrier-density-driven redistribution of transition-metal 3\textit{d} orbital occupations triggers a sequential evolution from the ferroelectric ground state to paraelectric phases with staggered or Zig-Zag antiferromagnetic order. This switch continuously tunes the hydrogen adsorption free energy from 0.33 to 1.11 eV, shifting the interface from near-thermoneutrality to spontaneous desorption. Nonadiabatic dynamics indicate that electron-phonon coupling promotes nonthermal H release, while picosecond carrier recombination rapidly restores the initial ferroic order, closing an ultrafast reversible cycle. Generality is further validated in AgBiP$_2$Se$_6$ and CuInP$_2$S$_6$, establishing ferroic order as an optically addressable knob for dynamic thermodynamic reconfiguration beyond static design.

cond-mat.mtrl-sci↗

Neural Dynamic GI: Random-Access Neural Compression for Temporal Lightmaps in Dynamic Lighting Environments

High-quality global illumination (GI) in real-time rendering is commonly achieved using precomputed lighting techniques, with lightmap as the standard choice. To support GI for static objects in dynamic lighting environments, multiple lightmaps at different lighting conditions need to be precomputed, which incurs substantial storage and memory overhead. To overcome this limitation, we propose Neural Dynamic GI (NDGI), a novel compression technique specifically designed for temporal lightmap sets. Our method utilizes multi-dimensional feature maps and lightweight neural networks to integrate the temporal information instead of storing multiple sets explicitly, which significantly reduces the storage size of lightmaps. Additionally, we introduce a block compression (BC) simulation strategy during the training process, which enables BC compression on the final generated feature maps and further improves the compression ratio. To enable efficient real-time decompression, we also integrate a virtual texturing (VT) system with our neural representation. Compared with prior methods, our approach achieves high-quality dynamic GI while maintaining remarkably low storage and memory requirements, with only modest real-time decompression overhead. To facilitate further research in this direction, we will release our temporal lightmap dataset precomputed in multiple scenes featuring diverse temporal variations.

cs.GR↗

Suppression of Universal Errors in DFS-Encoded Superconducting Geometric Logical \emph{T} Gate

High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive distillation rounds, alongside sophisticated measurement and feedback control, thereby inducing considerable spatial and temporal resource consumption. Herein, we propose a controlled superconducting geometric logical \emph{T} gate scheme that achieves high-order suppression of universal errors, by integrating decoherence-free subspace encoding with multi-loop optimized composite geometric pulse engineering. Guided by tailored trajectory design, we systematically establish unified gate construction frameworks for conventional geometric, composite geometric, and optimized composite geometric protocols. By flexibly controling additional parametric degrees of freedom, the proposed scheme achieves substantially enhanced robustness against diverse noise sources. Numerical simulations reveal that, within tunable superconducting quantum circuits, our geometric logical \emph{T} gate outperforms both conventional composite geometric and dynamical gates in suppressing Rabi frequency, detuning, and residual inter-qubit crosstalk errors that can all be suppressed to the fourth order, while additionally providing inherent suppression of collective dephasing errors. The present strategy alleviates intrinsic limitations of mainstream approaches and opens a promising avenue toward robust high-fidelity logical \emph{T} gate construction.

quant-ph↗

Cusp Form Dimensions, Lattice Uniqueness, and LP Sharpness for Sphere Packing in Dimensions 8 and 24

The Cohn-Elkies linear programming (LP) bound for sphere packing is known to be sharp in dimensions 8 and 24 but in no other dimension above 2. We investigate why by examining three independent necessary conditions for LP sharpness, drawn from number theory, lattice theory, and conformal field theory. The first condition, dim S_{d/2}(SL_2(Z)) <= 1, bounds the freedom in theta series and rules out all d >= 48. The second, derived from Cohn and Triantafillou's dual LP obstruction via cusp forms for the congruence subgroup Gamma_0(2), explains why LP sharpness fails in dimensions 16 and 32 despite the first condition being satisfied. The third, via the Hartman-Mazac-Rastelli correspondence between LP bounds and the modular bootstrap for Narain conformal field theories, reinterprets LP sharpness as the existence of an extremal CFT. We formulate a conjecture that these three conditions are equivalent for d congruent to 0 mod 8, and observe that the Bost-Connes quantum statistical system provides a natural algebraic framework in which all three perspectives are connected through the Hecke algebra.

math.CO↗

A Rolling-Horizon Stochastic Optimization Framework for NBA Franchise Management with Distributionally Robust Risk Constraints

NBA franchise management is not a sequence of independent tasks, but a single dynamic control problem in which roster construction, cash-flow discipline, media strategy, external market shocks, and player-health uncertainty interact over time. Using the New York Knicks as a case study, this paper develops a unified decision architecture for franchise management under competitive, financial, and regulatory constraints. The core layer is formulated as a rolling-horizon stochastic mixed-integer program augmented with distributionally robust optimization and conditional value-at-risk constraints, so that long-run franchise value can be optimized while downside exposure remains explicitly controlled. On top of this core layer, we construct coordinated modules for transaction execution, league-expansion shock transmission, media-rights regime transition, and injury-triggered re-optimization. This integrated design reframes multiple managerial mechanisms inside one research problem: how should an NBA franchise allocate resources and update decisions when performance objectives and commercial objectives are jointly determined under uncertainty? The manuscript is organized around problem formulation, model architecture, empirical validation, robustness analysis, and managerial interpretation.

cs.CE↗

Band-basis decomposition of superfluid weight in magic-angle twisted bilayer graphene: Quantifying geometric and conventional contributions

We decompose the superfluid weight D_s of magic-angle twisted bilayer graphene (MATBG) into conventional (band-velocity) and geometric (interband-coherence) contributions using a band-basis current operator splitting applied to the Bistritzer-MacDonald continuum model. In the flat-band subspace, quantum geometry accounts for 22-26% of D_s at charge neutrality depending on pairing symmetry, with cross terms vanishing to machine precision. Including remote bands raises the geometric fraction to ~55-58%, while D_s^conv converges to within 2% -- demonstrating that remote bands contribute exclusively through interband coherence. The geometric fraction peaks at ~27-33% near the nu = +/- 2 fillings where superconductivity is strongest, and is insensitive to gap magnitude in the experimentally relevant range.

cond-mat.supr-con↗

Two-Channel Allen-Dynes Framework for Superconducting Critical Temperatures: Blind Predictions Across Five Orders of Magnitude and a Quantum-Metric No-Go Result

We present a two-channel extension of the Allen-Dynes framework that unifies phonon-mediated and spin-fluctuation-mediated pairing channels for predicting superconducting critical temperatures. Channel 1 employs the standard Allen-Dynes formula with material-specific electron-phonon coupling; Channel 2 incorporates a spin-fluctuation coupling parameter extracted from inelastic neutron scattering data. Blind predictions for 19 materials spanning conventional superconductors, MgB2, iron pnictides, iron chalcogenides, heavy fermions, cuprates, and hydrides achieve R-squared = 0.96 across five orders of magnitude in Tc (0.4-250 K) without free parameters. We further demonstrate a quantum-metric no-go result: the Peotta-Torma geometric superfluid weight, while essential for flat-band systems, cannot serve as a universal predictor of Tc because it correlates with band-structure topology rather than pairing strength. The framework identifies the spin-fluctuation channel as the dominant contributor to Tc enhancement in unconventional superconductors, providing quantitative design rules for materials with Tc above 100 K.

cond-mat.supr-con↗

High-Precision Computation and PSLQ Identification of Stokes Multipliers for Anharmonic Oscillators

We present a large-scale computational study combining arbitrary-precision arithmetic, sequence acceleration, and the PSLQ integer relation algorithm to discover exact closed-form expressions for fundamental constants arising in asymptotic analysis. We compute the Stokes multipliers C_M of the one-dimensional anharmonic oscillators H = p^2/2 + x^2/2 + g x^{2M} for M = 2, 3, ..., 11, extracting 17-30 significant digits from up to 1200 perturbation coefficients computed at 300-digit working precision. The computational pipeline consists of three stages: (i) Rayleigh-Schrodinger recursion in the harmonic oscillator basis, (ii) Richardson extrapolation of order 40-100 to accelerate convergence of ratio sequences, and (iii) PSLQ searches over bases of Gamma-function values and algebraic numbers. This pipeline discovers three new exact identities: C_3^2 pi^4 = 32, C_5^4 Gamma(1/4)^4 pi^5 = 2^{12} 3^2, and C_7^6 Gamma(1/3)^9 pi^6 = 2^{20} 3^3, in addition to confirming the known C_2^2 pi^3 = 6. Equally significant is a negative result: exhaustive PSLQ searches at 30-digit precision with coefficient bounds up to 2000 find no closed form for C_4, strongly suggesting the x^8 case introduces a genuinely new transcendental number. A number-theoretic pattern emerges: closed-form existence correlates with Euler's totient function phi(M-1)/2, which counts algebraically independent Gamma-function transcendentals at denominator M-1. We formulate conjectures connecting computational constant recognition to classical number theory, and provide all code and data for full reproducibility.

cs.MS↗

Nuclear pasta in hot neutron-star matter and proto-neutron stars

We investigate nuclear pasta phases appearing in hot neutron-star matter based on the compressible liquid-drop model, where the matter consists of a dense liquid phase and a dilute gas phase separated by a sharp interface. The surface tension is calculated self-consistently from the Thomas-Fermi approximation, and it depends on temperature and isospin asymmetry. We employ relativistic mean-field models with different symmetry energy slopes to describe nuclear interactions. It is found that the TM1e model with a small symmetry energy slope of $L=40$ MeV predicts various pasta shapes at low temperatures, while the TM1 model with $L=110.8$ MeV yields only the droplet configuration up to the crust-core transition density. We examine the occurrence and influence of pasta phases in proto-neutron stars with a constant entropy per baryon. These pasta phases may occur in the inner crust with a thickness of about $1.2$ km, playing an important role in the thermal evolution of the star.

nucl-th↗

Gluon Polarimetry with Energy-Energy Correlators

We propose a novel method to probe gluon linear polarization via energy correlations in hard scattering processes. This approach exploits the characteristic $\cos 2ϕ$ azimuthal modulation in single- and two-point energy correlations within jets initiated by polarized gluons. In contrast to conventional techniques that rely on $k_t$ resummation or intricate jet substructure observables, our method offers a theoretically robust and experimentally accessible avenue for gluon polarimetry. We perform an all-order analysis within the Ciafaloni-Catani-Fiorani-Marchesini (CCFM) formalism, incorporating coherent branching effects to achieve improved precision. Our predictions can be tested at current and future facilities, including the LHC, RHIC, HERA, and the EIC.

hep-ph↗

TumorChain: Interleaved Multimodal Chain-of-Thought Reasoning for Traceable Clinical Tumor Analysis

Accurate tumor analysis is central to clinical radiology and precision oncology, where early detection, reliable lesion characterization, and pathology-level risk assessment guide diagnosis and treatment planning. Chain-of-Thought (CoT) reasoning is particularly important in this setting because it enables step-by-step interpretation from imaging findings to clinical impressions and pathology conclusions, improving traceability and reducing diagnostic errors. Here, we target the clinical tumor analysis task and build a large-scale benchmark that operationalizes a multimodal reasoning pipeline, spanning findings, impressions, and pathology predictions. We curate TumorCoT, a large-scale dataset of 1.5M CoT-labeled VQA instructions paired with 3D CT scans, with step-aligned rationales and cross-modal alignments along the trajectory from findings to impression to pathology, enabling evaluation of both answer accuracy and reasoning consistency. We further propose TumorChain, a multimodal interleaved reasoning framework that tightly couples 3D imaging encoders, clinical text understanding, and organ-level vision-language alignment. Through cross-modal alignment and iterative interleaved causal reasoning, TumorChain grounds visual evidence, aggregates conclusions, and issues pathology predictions after multiple rounds of self-refinement, improving traceability and reducing hallucination risk. Experiments show consistent improvements over strong baselines in lesion detection, impression generation, and pathology classification, and demonstrate strong generalization on the DeepTumorVQA benchmark. These results highlight the potential of multimodal reasoning for reliable and interpretable tumor analysis in clinical practice. Detailed information about our project can be found on our project homepage at https://github.com/ZJU4HealthCare/TumorChain.

cs.CV↗

Step 3.5 Flash: Open Frontier-Level Intelligence with 11B Active Parameters

We introduce Step 3.5 Flash, a sparse Mixture-of-Experts (MoE) model that bridges frontier-level agentic intelligence and computational efficiency. We focus on what matters most when building agents: sharp reasoning and fast, reliable execution. Step 3.5 Flash pairs a 196B-parameter foundation with 11B active parameters for efficient inference. It is optimized with interleaved 3:1 sliding-window/full attention and Multi-Token Prediction (MTP-3) to reduce the latency and cost of multi-round agentic interactions. To reach frontier-level intelligence, we design a scalable reinforcement learning framework that combines verifiable signals with preference feedback, while remaining stable under large-scale off-policy training, enabling consistent self-improvement across mathematics, code, and tool use. Step 3.5 Flash demonstrates strong performance across agent, coding, and math tasks, achieving 85.4% on IMO-AnswerBench, 86.4% on LiveCodeBench-v6 (2024.08-2025.05), 88.2% on tau2-Bench, 69.0% on BrowseComp (with context management), and 51.0% on Terminal-Bench 2.0, comparable to frontier models such as GPT-5.2 xHigh and Gemini 3.0 Pro. By redefining the efficiency frontier, Step 3.5 Flash provides a high-density foundation for deploying sophisticated agents in real-world industrial environments.

cs.CL↗

One Agent to Guide Them All: Empowering MLLMs for Vision-and-Language Navigation via Explicit World Representation

A navigable agent needs to understand both high-level semantic instructions and precise spatial perceptions. Building navigation agents centered on Multimodal Large Language Models (MLLMs) demonstrates a promising solution due to their powerful generalization ability. However, the current tightly coupled design dramatically limits system performance. In this work, we propose a decoupled design that separates low-level spatial state estimation from high-level semantic planning. Unlike previous methods that rely on predefined, oversimplified textual maps, we introduce an interactive metric world representation that maintains rich and consistent information, allowing MLLMs to interact with and reason on it for decision-making. Furthermore, counterfactual reasoning is introduced to further elicit MLLMs' capacity, while the metric world representation ensures the physical validity of the produced actions. We conduct comprehensive experiments in both simulated and real-world environments. Our method establishes a new zero-shot state-of-the-art, achieving 48.8\% Success Rate (SR) in R2R-CE and 42.2\% in RxR-CE benchmarks. Furthermore, to validate the versatility of our metric representation, we demonstrate zero-shot sim-to-real transfer across diverse embodiments, including a wheeled TurtleBot 4 and a custom-built aerial drone. These real-world deployments verify that our decoupled framework serves as a robust, domain-invariant interface for embodied Vision-and-Language navigation.

cs.RO↗

STEP3-VL-10B Technical Report

We present STEP3-VL-10B, a lightweight open-source foundation model designed to redefine the trade-off between compact efficiency and frontier-level multimodal intelligence. STEP3-VL-10B is realized through two strategic shifts: first, a unified, fully unfrozen pre-training strategy on 1.2T multimodal tokens that integrates a language-aligned Perception Encoder with a Qwen3-8B decoder to establish intrinsic vision-language synergy; and second, a scaled post-training pipeline featuring over 1k iterations of reinforcement learning. Crucially, we implement Parallel Coordinated Reasoning (PaCoRe) to scale test-time compute, allocating resources to scalable perceptual reasoning that explores and synthesizes diverse visual hypotheses. Consequently, despite its compact 10B footprint, STEP3-VL-10B rivals or surpasses models 10$\times$-20$\times$ larger (e.g., GLM-4.6V-106B, Qwen3-VL-235B) and top-tier proprietary flagships like Gemini 2.5 Pro and Seed-1.5-VL. Delivering best-in-class performance, it records 92.2% on MMBench and 80.11% on MMMU, while excelling in complex reasoning with 94.43% on AIME2025 and 75.95% on MathVision. We release the full model suite to provide the community with a powerful, efficient, and reproducible baseline.

cs.CV↗

Low-Cost Architecture and Efficient Pattern Synthesis for Polarimetric Phased Array Based on Polarization Coding Reconfigurable Elements

Polarimetric phased arrays (PPAs) enhance radar target detection and anti-jamming capabilities, but their conventional dual transmit/receive (T/R) channel architecture leads to high cost and system complexity. To address these limitations, this paper proposes a polarization-coding reconfigurable phased array (PCRPA) and associated pattern synthesis techniques, which reduce the channel count while preserving key performance. In the PCRPA, each antenna element connects to a single T/R channel and is equipped with a two-level RF switch, enabling real-time control of its polarization state and subarray grouping. By optimizing both the element polarization codes and the excitation weights, the array can synthesize arbitrarily polarized and dual-polarized beams. Simulation results show that the proposed approach achieves suppressed cross-polarization and comparable sidelobe levels compared to conventional PPAs across a wide scan range, with performance improvements being more pronounced in larger arrays. The inherent channel reduction does, however, incur a trade-off in terms of radiated power and directivity. Experimental validation using an $8\times 8$ X-band array antenna confirms the feasibility and effectiveness of the proposed system. The PCRPA architecture and the accompanying synthesis methods offer a cost-effective solution for large-scale PPA systems, maintaining sidelobe and polarization control with significantly reduced hardware complexity.

eess.SY↗

Azimuthal asymmetry in $J/ψ+γ$ and $J/ψ+J/ψ$ production in ultraperipheral heavy-ion collisions at LHC

Two-photon collision in ultraperipheral heavy-ion collisions (UPCs) provides a unique and powerful platform for probing QCD with linearly polarized quasi-real photons. While photon polarization effects have been recognized in dilepton and even in light hadrons production, their consequences for heavy quarkonium production remain unexplored. In this work we investigate for the first time the $γγ\to J/ψ+γ(J/ψ)$ channels in Pb-Pb UPCs at the Large Hadron Collider (LHC), by integrating the non-relativistic QCD (NRQCD) factorization approach with the transverse-momentum-dependent (TMD) photon distributions. Based on the helicity amplitudes at lowest order in strong coupling and velocity expansion, we predict sizable $\cos(2ϕ)$ and $\cos(4ϕ)$ azimuthal asymmetries arising from the interference of linearly polarized photon states. These azimuthal-dependent observables, defined as the ratios of weighted to unweighted cross sections, are expected to be stable against including the higher-order radiative corrections and varying nonperturbative NRQCD matrix elements, thus offering a fresh test of quarkonium production mechanism and the photon TMD structure in the ultrarelativistic limit.

hep-ph↗

Robust Federated Learning in Unreliable Wireless Networks: A Client Selection Approach

Federated learning (FL) has emerged as a promising distributed learning paradigm for training deep neural networks (DNNs) at the wireless edge, but its performance can be severely hindered by unreliable wireless transmission and inherent data heterogeneity among clients. Existing solutions primarily address these challenges by incorporating wireless resource optimization strategies, often focusing on uplink resource allocation across clients under the assumption of homogeneous client-server network standards. However, these approaches overlooked the fact that mobile clients may connect to the server via diverse network standards (e.g., 4G, 5G, Wi-Fi) with customized configurations, limiting the flexibility of server-side modifications and restricting applicability in real-world commercial networks. This paper presents a novel theoretical analysis about how transmission failures in unreliable networks distort the effective label distributions of local samples, causing deviations from the global data distribution and introducing convergence bias in FL. Our analysis reveals that a carefully designed client selection strategy can mitigate biases induced by network unreliability and data heterogeneity. Motivated by this insight, we propose FedCote, a client selection approach that optimizes client selection probabilities without relying on wireless resource scheduling. Experimental results demonstrate the robustness of FedCote in DNN-based classification tasks under unreliable networks with frequent transmission failures.

cs.DC↗