Searcharxiv⌕ Search

arXiv subjects

Manish Kumar

Publications and source records attributed to Manish Kumar.

At least 55 records · Page 3Linked to original sources

Entanglement entropy as a probe of topological phase transitions

Entanglement entropy (EE) provides a powerful probe of quantum phases, yet its role in identifying topological phase transitions in disordered systems remains underexplored. We introduce an exact EE-based framework that captures topological phase transitions even in the presence of disorder. Specifically, for a class of Su-Schrieffer-Heeger (SSH) model variants, we show that the difference in EE between half-filled and near-half-filled ground states, $ΔS^{\mathcal{A}}$, vanishes in the topological phase but remains finite in the trivial phase, a direct consequence of edge-state localization. This behavior persists even in the presence of quasiperiodic or binary disorder. By analyzing domain-wall configurations in the SSH chain, we further show how subsystem tuning allows one to distinguish genuine topological zero-energy eigenstates from trivial localized states. Exact phase boundaries, derived from Lyapunov exponents via transfer matrices, agree closely with numerical results from $ΔS^{\mathcal{A}}$ and the topological invariant $\mathcal{Q}$, with instances where $ΔS^{\mathcal{A}}$ outperforms $\mathcal{Q}$. Our results highlight EE as a robust diagnostic tool and a potential bridge between quantum information and condensed matter approaches to topological matter.

cond-mat.str-el↗

Quantum Spin-1/2 Rings Built from [2]Triangulene Molecular Units

Quantum spin rings represent fundamental model systems that exhibit distinctive quantum phenomena-such as quantum critical behavior and quasiparticle excitations-arising from their periodic boundary conditions and enhanced quantum fluctuations. Here, we report the on-surface synthesis and atomic-scale characterization of antiferromagnetic S=1/2 quantum spin rings composed of pristine and unmodified [2]triangulene units on a Au(111) surface. Using stepwise on-surface synthesis followed by STM tip-induced dehydrogenation, we precisely constructed cyclic five- and six-membered spin rings and investigated their spin states via scanning probe microscopy and multireference calculations. Nc-AFM imaging reveals that the six-membered ring retains a planar geometry, whereas the five-membered ring exhibits pronounced structural distortion. The six-membered ring hosts a uniform excitation gap that can be accurately described by a Heisenberg spin model and multireference CASCI calculations. In contrast, the distorted five-membered ring displays spin ground states with asymmetric spatial distributions due to degeneracy lifting induced by structural distortion. Our findings establish a versatile molecular platform for exploring correlated magnetism and quantum spin phenomena in cyclic organic magnetic architectures with disorder.

cond-mat.mtrl-sci↗

Adsorption-induced surface magnetism

We report the emergence of adsorption-induced magnetism from heterohelicene molecules on a non-magnetic Cu(100) surface. Spin-polarized low-energy electron microscopy (SP-LEEM) measurements reveal spin-dependent electron reflectivity for enantiopure 7,12,17-trioxa[11]helicene (TO[11]H) monolayers, indicating the formation of a spin-polarized state localized in the topmost copper layer. Control experiments on clean Cu(100) and TO[11]H on highly oriented pyrolytic graphite show no such effect, excluding artifacts and chirality-induced spin selectivity as origins. Spin-polarized density functional theory calculations with hybrid functionals attribute the magnetism to strong chemisorption, which induces hybridization between the molecular HOMO and copper s- and d-states, driving asymmetric spin-polarized charge redistribution at the interface. An extended Newns-Anderson-Grimley model incorporating on-site Coulomb repulsion in Cu d-orbitals reproduces the emergence of interfacial spin polarization above a threshold interaction strength, highlighting the key roles of hybridization parameters and Coulomb correlation. These findings reveal a mechanism for inducing magnetism at molecule-metal interfaces without inherently magnetic components, offering avenues for engineering spin-polarized states in organic-inorganic hybrid systems.

cond-mat.mtrl-sci↗

Continuous Fairness On Data Streams

We study the problem of enforcing continuous group fairness over windows in data streams. We propose a novel fairness model that ensures group fairness at a finer granularity level (referred to as block) within each sliding window. This formulation is particularly useful when the window size is large, making it desirable to enforce fairness at a finer granularity. Within this framework, we address two key challenges: efficiently monitoring whether each sliding window satisfies block-level group fairness, and reordering the current window as effectively as possible when fairness is violated. To enable real-time monitoring, we design sketch-based data structures that maintain attribute distributions with minimal overhead. We also develop optimal, efficient algorithms for the reordering task, supported by rigorous theoretical guarantees. Our evaluation on four real-world streaming scenarios demonstrates the practical effectiveness of our approach. We achieve millisecond-level processing and a throughput of approximately 30,000 queries per second on average, depending on system parameters. The stream reordering algorithm improves block-level group fairness by up to 95% in certain cases, and by 50-60% on average across datasets. A qualitative study further highlights the advantages of block-level fairness compared to window-level fairness.

cs.LG↗

Pervasive spin-triplet superconductivity in rhombohedral graphene

Magnetic fields typically suppress superconductivity once the Zeeman energy exceeds the pairing gap, unless mechanisms such as unconventional pairing, strong spin-orbit coupling, or intrinsic magnetism intervene. Several graphene platforms realize such mitigating routes, exhibiting superconductivity resilient to magnetic fields. Here we report superconductivity in rhombohedral heptalayer graphene that is both induced and stabilized by in-plane magnetic field ($B_{\parallel}$), with critical fields far beyond the Pauli paramagnetic limit. The superconductivity spans a wide gate range and emerges from a sharp zero-field resistive ridge that tracks approximately constant conduction band filling. The presence of zero-field superconductivity and the evolution of the critical temperature with $B_{\parallel}$ are highly gate sensitive. We also observe a weak superconducting diode effect in several distinct regimes within the superconducting phase, including nearby to an integer quantum anomalous Hall state generated by a boron nitride moiré superlattice, indicating a potential coexistence of valley imbalance and superconductivity. These results establish several intriguing new properties of spin-triplet, field-induced superconductivity in a thick rhombohedral graphene stack.

cond-mat.mes-hall↗

Role of Wadsley Defects and Cation Disorder to Enhance MoNb12O33 Diffusion

Wadsley-Roth (WR) niobates have emerged as high-rate anode materials that can combine rapid ionic diffusion with good electronic conductivity. WR compounds have been defect-enhanced by limited annealing, however, such materials often contain multiple types of defects. In particular, both Wadsley defects (variable block size) and transition metal disorder have the potential to modify transport rates, however the corresponding effects are not well understood mechanistically. Here, MoNb12O33 (MNO) was calcined at two different temperatures to compare a defect-rich condition (MNO-800) with a proximal order-rich condition (MNO-900) as assessed through XRD, XANES, EXAFS, and STEM characterizations. Galvanostatically cycled lithium half cells of MNO-800 exhibited additional capacity (307 mAh/g at 0.1C, 4.66% higher) and improved high-rate capacity of 200 mAhg-1 at 10C. ICI-based overpotential analysis identified solid state diffusion as the dominant rate limiting process where MNO-800 correspondingly exhibited ~3X faster capacity-weighted diffusivity. A machine-learning interatomic potential was trained to density functional theory and then applied with molecular dynamics (MLIP-MD) to examine the possible roles of Wadsley defects and transition metal disorder. For both defect-types, Li was found to populate and activate fast diffusion paths from window sites at lower extents of lithiation as compared to the order-rich model.

cond-mat.mtrl-sci↗

Controversy and consensus: common ground and best practices for life cycle assessment of emerging technologies

Public and private interest in life cycle assessment (LCA) has grown as environmental disclosure norms tighten, driving demand for decision-relevant assessment early in technological development cycles. Early-stage LCA has the potential to guide design choices, steer innovation, and mitigate lock-in of adverse environmental impacts. However, many aspects of early-stage LCA practice remain unsettled. We convened experts in a series of Faraday Discussion-style workshops to address recurring debates across six key topics for emerging technologies: appropriate use of LCA, uncertainty, comparison with incumbents, standardization, scale-up, and stakeholder engagement. For each issue, we present a declarative resolution, summarize key arguments for and against it, identify points of consensus, and provide recommendations. Across topics, the research network converged on practical priorities including framing studies to the decision context; setting minimum reporting expectations for data and study quality; and explicitly stating limits of transferability for scenario-based uncertainty assessment or analytically scaled-up projections. Disagreements persisted on when to formalize standards and how extensively uncertainty can/should be treated for low-maturity technologies. Supplementing the workshop findings with examples and context from relevant literature, we synthesize outcomes into a set of shared challenges and research priorities to strengthen transparent, evidence-based, and context-informed approaches for early-stage LCA.

cs.CY↗

An Expert-grounded benchmark of General Purpose LLMs in LCA

Purpose: Artificial intelligence (AI), and in particular large language models (LLMs), are increasingly being explored as tools to support life cycle assessment (LCA). While demonstrations exist across environmental and social domains, systematic evidence on their reliability, robustness, and usability remains limited. This study provides the first expert-grounded benchmark of LLMs in LCA, addressing the absence of standardized evaluation frameworks in a field where no clear ground truth or consensus protocols exist. Methods: We evaluated eleven general-purpose LLMs, spanning both commercial and open-source families, across 22 LCA-related tasks. Seventeen experienced practitioners reviewed model outputs against criteria directly relevant to LCA practice, including scientific accuracy, explanation quality, robustness, verifiability, and adherence to instructions. We collected 168 expert reviews. Results: Experts judged 37% of responses to contain inaccurate or misleading information. Ratings of accuracy and quality of explanation were generally rated average or good on many models even smaller models, and format adherence was generally rated favourably. Hallucination rates varied significantly, with some models producing hallucinated citations at rates of up to 40%. There was no clear-cut distinction between ratings on open-weight versus closed-weight LLMs, with open-weight models outperforming or competing on par with closed-weight models on criteria such as accuracy and quality of explanation. Conclusion: These findings highlight the risks of applying LLMs naïvely in LCA, such as when LLMs are treated as free-form oracles, while also showing benefits especially around quality of explanation and alleviating labour intensiveness of simple tasks. The use of general-purpose LLMs without grounding mechanisms presents ...

cs.CL↗

Two Quantum Algorithms for Nonlinear Reaction-Diffusion Equation using Chebyshev Approximation Method

We present two new quantum algorithms for reaction-diffusion equations that employ the truncated Chebyshev polynomial approximation. This method is employed to numerically solve the ordinary differential equation emerging from the linearization of the associated nonlinear differential equation. In the first algorithm, we use the matrix exponentiation method (Patel et al., 2018), while in the second algorithm, we repurpose the quantum spectral method (Childs et al., 2020). Our main technical contribution is to derive the sufficient conditions for the diagonalization of the Carleman embedding matrix, which is indispensable for designing both quantum algorithms. We supplement this with an efficient iterative algorithm to diagonalize the Carleman matrix. Our first algorithm has gate complexity of O(d$\cdot$log(d)+T$\cdot$polylog(T/$\varepsilon$)). Here $d$ is the size of the Carleman matrix, $T$ is the simulation time, and $\varepsilon$ is the approximation error. The second algorithm is polynomial in $log(d)$, $T$, and $log(1/\varepsilon)$ - the gate complexity scales as O(polylog(d)$\cdot$T$\cdot$polylog(T/$\varepsilon$)). In terms of $T$ and $\varepsilon$, this is comparable to the speedup gained by the current best known quantum algorithm for this problem, the truncated Taylor series method (Costa et.al., 2025). Our approach has two shortcomings. First, we have not provided an upper bound, in terms of d, on the condition number of the Carleman matrix. Second, the success of the diagonalization is based on a conjecture that a specific trigonometric equation has no integral solution. However, we provide strategies to mitigate these shortcomings in most practical cases.

quant-ph↗

Virtual global generation in higher dimensions

The notion of virtual global generation (VGG) for a vector bundle has multiple possible generalization from the case of curves to higher dimensional normal projective varieties. We study relationship between these notions. All these notions agree for curves but in higher dimension we show that this is not the case.

math.AG↗

Learning Regional Monsoon Patterns with a Multimodal Attention U-Net

Accurate monsoon rainfall prediction is vital for India's agriculture, water management, and climate risk planning, yet remains challenging due to sparse ground observations and complex regional variability. We present a multimodal deep learning framework for high-resolution precipitation classification that leverages satellite and Earth observation data. Unlike previous rainfall prediction models based on coarse 5-50 km grids, we curate a new 1 km resolution dataset for five Indian states, integrating seven key geospatial modalities: land surface temperature, vegetation (NDVI), soil moisture, relative humidity, wind speed, elevation, and land use, covering the June-September 2024 monsoon season. Our approach uses an attention-guided U-Net architecture to capture spatial patterns and temporal dependencies across modalities, combined with focal and dice loss functions to handle rainfall class imbalance defined by the India Meteorological Department (IMD). Experiments demonstrate that our multimodal framework consistently outperforms unimodal baselines and existing deep learning methods, especially in extreme rainfall categories. This work contributes a scalable framework, benchmark dataset, and state-of-the-art results for regional monsoon forecasting, climate resilience, and geospatial AI applications in India.

cs.CV↗

Distributed Download from an External Data Source in Asynchronous Faulty Settings

The distributedData Retrieval (DR) model consists of $k$ peers connected by a complete peer-to-peer communication network, and a trusted external data source that stores an array $\textbf{X}$ of $n$ bits ($n \gg k$). Up to $βk$ of the peers might fail in any execution (for $β\in [0, 1)$). Peers can obtain the information either by inexpensive messages passed among themselves or through expensive queries to the source array $\textbf{X}$. In the DR model, we focus on designing protocols that minimize the number of queries performed by any nonfaulty peer (a measure referred to as query complexity) while maximizing the resilience parameter $β$. The Download problem requires each nonfaulty peer to correctly learn the entire array $\textbf{X}$. Earlier work on this problem focused on synchronous communication networks and established several deterministic and randomized upper and lower bounds. Our work is the first to extend the study of distributed data retrieval to asynchronous communication networks. We address the Download problem under both the Byzantine and crash failure models. We present query-optimal deterministic solutions in an asynchronous model that can tolerate any fixed fraction $β<1$ of crash faults. In the Byzantine failure model, it is known that deterministic protocols incur a query complexity of $Ω(n)$ per peer, even under synchrony. We extend this lower bound to randomized protocols in the asynchronous model for $β\geq 1/2$, and further show that for $β< 1/2$, a randomized protocol exists with near-optimal query complexity. To the best of our knowledge, this is the first work to address the Download problem in asynchronous communication networks.

cs.DC↗

Superconductivity from dual-surface carriers in rhombohedral graphene

Intrinsic rhombohedral graphene hosts an unusual low-energy electronic wavefunction, predominantly localized at its outer crystal faces with negligible presence in the bulk. Increasing the number of graphene layers amplifies the density of states near charge neutrality, greatly enhancing the susceptibility to symmetry-breaking phases. Here, we report superconductivity in rhombohedral graphene arising from an unusual charge-delocalized semimetallic normal state, characterized by coexisting valence- and conduction-band Fermi pockets split to opposite crystal surfaces. In octalayer graphene, the superconductivity appears in five apparently distinct pockets for each sign of an external electric displacement field ($D$). In a moiré superlattice sample where heptalayer graphene is aligned on one side to hexagonal boron nitride, two pockets of superconductivity emerge from a single sharp resistive feature. At higher $D$ the same resistive feature additionally induces an $h/e^{2}$-quantized anomalous Hall state at dopings near one electron per moiré unit cell. Our findings reveal a novel superconducting regime in multilayer graphene and create opportunities for coupling to nearby topological states.

cond-mat.mes-hall↗

Spectral analysis of ultraluminous X-ray pulsars with models of X-ray pulsars

A fraction of the Ultra Luminous X-ray (ULX) sources are known to be accreting neutron stars as they show coherent X-ray pulsations with pulse periods ranging from ~1-30 seconds. While initially thought to host intermediate-mass black holes, ULXs have since been recognized as a diverse class of objects, including ULX pulsars. These pulsars require models specifically tailored to account for their unique accretion physics, distinct from those used for Galactic black hole binaries. The X-ray spectra of all Galactic accreting X-ray pulsars (including sources in the Magellanic Clouds) are dominated by a high energy cut-off power-law and some of the sources show a soft excess, some emission lines, cyclotron absorption features, etc. In this work, we undertake a comprehensive analysis of the broadband X-ray spectra of five ULX pulsars using simultaneous XMM-Newton and NuSTAR observations and show that their X-ray spectra can be effectively described by spectral models, similar to those used for the local accretion-powered X-ray pulsars. A soft excess is detected in all the sources which is also consistent with the local X-ray pulsars that have low absorption column density. We have marginal detection or low upper limit on the presence of the iron K-alpha emission line from these sources, which is a key difference of the ULX pulsars with the local accreting X-ray pulsars. We discuss the implication of this on the nature of the binary companion and the accretion mechanism in the ULX pulsars.

astro-ph.HE↗

Distributed Machine Learning Approach for Low-Latency Localization in Cell-Free Massive MIMO Systems

Low-latency localization is critical in cellular networks to support real-time applications requiring precise positioning. In this paper, we propose a distributed machine learning (ML) framework for fingerprint-based localization tailored to cell-free massive multiple-input multiple-output (MIMO) systems, an emerging architecture for 6G networks. The proposed framework enables each access point (AP) to independently train a Gaussian process regression model using local angle-of-arrival and received signal strength fingerprints. These models provide probabilistic position estimates for the user equipment (UE), which are then fused by the UE with minimal computational overhead to derive a final location estimate. This decentralized approach eliminates the need for fronthaul communication between the APs and the central processing unit (CPU), thereby reducing latency. Additionally, distributing computational tasks across the APs alleviates the processing burden on the CPU compared to traditional centralized localization schemes. Simulation results demonstrate that the proposed distributed framework achieves localization accuracy comparable to centralized methods, despite lacking the benefits of centralized data aggregation. Moreover, it effectively reduces uncertainty of the location estimates, as evidenced by the 95\% covariance ellipse. The results highlight the potential of distributed ML for enabling low-latency, high-accuracy localization in future 6G networks.

eess.SP↗

KMS states on quantum Cuntz-Krieger algebras

We study the KMS states on local quantum Cuntz-Krieger algebras associated to quantum graphs. Using their isomorphism to the Cuntz-Pimsner algebra of the quantum edge correspondence, we show that the general criteria for KMS states can be translated into statements about the underlying quantum adjacency operator, somewhat analogously to the case of classical Cuntz-Krieger algebras. We study some examples of gauge actions, for which a complete classification of KMS states can be obtained.

math.OA↗

Agentic Distributed Computing

The most celebrated and extensively studied model of distributed computing is the {\em message-passing model,} in which each vertex/node of the (distributed network) graph corresponds to a static computational device that communicates with other devices through passing messages. In this paper, we consider the {\em agentic model} of distributed computing which extends the message-passing model in a new direction. In the agentic model, computational devices are modeled as relocatable or mobile computational devices (called agents in this paper), i.e., each vertex/node of the graph serves as a container for the devices, and hence communicating with another device requires relocating to the same node. We study two fundamental graph level tasks, leader election, and minimum spanning tree, in the agentic model, which will enhance our understanding of distributed computation across paradigms. The objective is to minimize both time and memory complexities. Following the literature, we consider the synchronous setting in which each agent performs its operations synchronously with others, and hence the time complexity can be measured in rounds. In this paper, we present two deterministic algorithms for leader election: one for the case of $k<n$ and another for the case of $k=n$, minimizing both time and memory complexities, where $k$ and $n$, respectively, are the number of agents and number of nodes of the graph. Using these leader election results, we develop deterministic algorithms for agents to construct a minimum spanning tree of the graph, minimizing both time and memory complexities. To the best of our knowledge, this is the first study of distributed graph level tasks in the agentic model with $k\leq n$. Previous studies only considered the case of $k=n$.

cs.DC↗

On the equivariant vector bundles on $\mathbb{CP}^1$

Let $H$ be a subgroup of ${\rm PGL}(2,\mathbb C)$ (respectively, ${\rm SL}(2,\mathbb C)$) such that the Zariski closure in ${\rm PGL}(2,\mathbb C)$ (respectively, ${\rm SL}(2,\mathbb C)$) of some compact subgroup of $H$ contains $H$. We classify the $H$--equivariant holomorphic vector bundles on $\mathbb{CP}^1$. This generalizes \cite{BM} where $H$ was assumed to be a finite abelian group.

math.AG↗