BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Shubham Kumar

Shubham Kumar contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
cond-mat.stat-mechArtificial Intelligencecond-mat.softquant-ph

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

Constant Depth Digital-Analog Counterdiabatic Quantum Computing

We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware. Counterdiabatic protocols suppress diabatic excitations in finite-time adiabatic evolution, but their practical application is limited by the non-local structure of the required Hamiltonians and the resource overhead of fully digital implementations. Counterdiabatic terms can be expressed as truncated expansions of nested commutators of the adiabatic Hamiltonian and its parametric derivative. Here, we show how this algebraic structure can be efficiently realized in a digital-analog setting using commutator product formulas. Using native multi-qubit analog interactions augmented by local single-qubit rotations, this approach enables higher-order counterdiabatic protocols whose implementation requires a constant number of analog blocks for any fixed truncation order, independent of system size. We demonstrate the method for two-dimensional spin models and analyze the associated approximation errors. These results show that digital-analog quantum computing enables a qualitatively new resource scaling for counterdiabatic protocols and related quantum control primitives, with direct implications for quantum simulation, optimization, and algorithmic state preparation on current quantum devices.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Minimal, Local, Causal Explanations for Jailbreak Success in Large Language Models

Safety trained large language models (LLMs) can often be induced to answer harmful requests through jailbreak prompts. Because we lack a robust understanding of why LLMs are susceptible to jailbreaks, future frontier models operating more autonomously in higher-stakes settings may similarly be vulnerable to such attacks. Prior work has studied jailbreak success by examining the model's intermediate representations, identifying directions in this space that causally encode concepts like harmfulness and refusal. Then, they globally explain all jailbreak attacks as attempting to reduce or strengthen these concepts (e.g., reduce harmfulness). However, different jailbreak strategies may succeed by strengthening or suppressing different intermediate concepts, and the same jailbreak strategy may not work for different harmful request categories (e.g., violence vs. cyberattack); thus, we seek to give a local explanation -- i.e., why did this specific jailbreak succeed? To address this gap, we introduce LOCA, a method that gives Local, CAusal explanations of jailbreak success by identifying a minimal set of interpretable, intermediate representation changes that causally induce model refusal on an otherwise successful jailbreak request. We evaluate LOCA on harmful original-jailbreak pairs from a large jailbreak benchmark across Gemma and Llama chat models, comparing against prior methods adapted to this setting. LOCA can successfully induce refusal by making, on average, six interpretable changes; prior work routinely fails to achieve refusal even after 20 changes. LOCA is a step toward mechanistic, local explanations of jailbreak success in LLMs. Code to be released.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Examination of Boltzmann's H-Function: Dimensionality and Interaction Sensitivity Dependence, and a comment on his H-Theorem

Boltzmann's H-Theorem, formulated 150 years ago in terms of H-function that also bears his name, is one of the most celebrated theorems of science and paved the way for the development of nonequilibrium statistical mechanics. Nevertheless, quantitative studies of the H-function, denoted by H(t), in realistic systems are relatively scarce because of the difficulty of obtaining the time-dependent momentum distribution analytically. Also, the earlier attempts proceeded through the solution of Boltzmann's kinetic equation, which was hard. Here we investigate, by direct molecular dynamics simulations and analytic theory, the time dependence of H(t). We probe the sensitivity of nonequilibrium relaxation to interaction potential and dimensionality by using the H-function H(t). We evaluate H(t) for three different potentials in all three dimensions and find that it exhibits surprisingly strong sensitivity to these factors. The relaxation of H(t) is long in 1D, but short in 3D. We obtain, for the first time, a closed-form analytic expression for H(t) using the solution of the Fokker-Planck equation for the velocity space probability distribution and compare its predictions with the simulation results. Interestingly, H(t) is found to exhibit linear response when vastly different initial nonequilibrium conditions are employed. The oft-quoted relation of H-function with Clausius's entropy theorem is discussed.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Inherent structure analysis reveals origin of breakdown of Stokes-Einstein relation in aqueous binary mixtures

We show by inherent structure (IS) analysis that the sharp composition dependent breakdown of the Stokes-Einstein relation correlates surprisingly well with an equally sharp non-monotonic variation in the average inherent structure (IS) energy of these mixtures. Further IS analysis reveals the existence of a unique ground state, stabilized by the optimum number of H-bonds at this composition. The surprisingly sharp turnaround behaviour observed in the effective hydrodynamic radius can be traced back to the formation of low energy equilibrium structures at specific compositions.

0 citations0 reviewsNo code linkedOpen access