arXiv subjects

Prasanth Shyamsundar

Publications and source records attributed to Prasanth Shyamsundar.

At least 19 recordsLinked to original sources

arXiv2026

HEPTAPOD: Orchestrating High Energy Physics Workflows Towards Autonomous Agency

Many theoretical and experimental workflows in high-energy-physics (HEP) stand to benefit from recent advances in transformer-based large language models (LLMs). While early applications of LLMs focused on text generation and code completion, modern LLMs now support orchestrated agency: the coordinated execution of complex, multi-step tasks through tool use, structured context, and iterative reasoning. We introduce the HEP Toolkit for Agentic Planning, Orchestration, and Deployment (HEPTAPOD), an orchestration framework designed to integrate external LLMs into general HEP workflows spanning theoretical calculations, simulation, and data analysis. The framework enables LLMs to interface with domain-specific tools and to construct and manage diverse HEP pipelines while preserving transparency, reproducibility, and human oversight. To demonstrate these capabilities, we present a representative case study in the context of a Beyond the Standard Model (BSM) Monte Carlo signal validation that spans model generation, event simulation, and analysis within an established, reproducible workflow. HEPTAPOD provides a structured and auditable layer between human researchers, LLMs, and computational infrastructure, establishing a foundation for human-in-the-loop, agent-assisted workflows across high-energy physics.

hep-ph↗

arXiv2025

A Quantum Algorithm for Model-Independent Searches for New Physics

We propose a novel quantum technique to search for unmodeled anomalies in multidimensional binned collider data. We propose associating an Ising lattice spin site with each bin, with the Ising Hamiltonian suitably constructed from the observed data and a corresponding theoretical expectation. In order to capture spatially correlated anomalies in the data, we introduce spin-spin interactions between neighboring sites, as well as self-interactions. The ground state energy of the resulting Ising Hamiltonian can be used as a new test statistic, which can be computed either classically or via adiabatic quantum optimization. We demonstrate that our test statistic outperforms some of the most commonly used goodness-of-fit tests. The new approach greatly reduces the look-elsewhere effect by exploiting the typical differences between statistical noise and genuine new physics signals.

hep-ph↗

arXiv2025

Comment on "An implementation of neural simulation-based inference for parameter estimation in ATLAS''

The paper titled "An implementation of neural simulation-based inference for parameter estimation in ATLAS" by the ATLAS collaboration (arXiv:2412.01600v1 [hep-ex]) describes the implementation of neural simulation-based inference for a measurement analysis performed by ATLAS. The uncertainties in the analysis arising from the finiteness of the simulated datasets are estimated using a novel double-bootstrapping technique described in that work. In the present comment, it is claimed and demonstrated, using a toy example, that the double-bootstrapping technique does not actually capture the aforementioned uncertainties.

stat.ME↗

arXiv2025

ARCANE Reweighting: A Monte Carlo Technique to Tackle the Negative Weights Problem in Collider Event Generation

Negatively weighted events, which appear in the Monte Carlo (MC) simulation of particle collisions, significantly increases the computational resource requirements of current and future collider experiments. This paper introduces and theoretically discusses an MC technique called ARCANE reweighting for reducing or eliminating negatively weighted events. The technique works by redistributing (via an additive reweighting) the contributions of different pathways within an event generator that lead to the same final event. The technique is exact and does not introduce any biases in the distributions of physical observables. A companion paper demonstrates the technique for a physics example.

hep-ph↗

arXiv2025

A Demonstration of ARCANE Reweighting: Reducing the Sign Problem in the MC@NLO Generation of $e^+ e^- \rightarrow q \bar{q} + 1\, jet$ Events

Negatively weighted events, which appear in the simulation of particle collisions, significantly increase the computational requirements of collider experiments. A new technique called ARCANE reweighting has been introduced in a companion paper to tackle this problem. This paper demonstrates the technique for the next-to-leading-order generation of $e^+ e^- \rightarrow q \bar{q} + 1\, jet$ events. By redistributing the contributions of "standard" and "hard remainder" pathways in the generator that lead to the same final event, ARCANE reweighting almost completely eliminates the negative weights problem for this process. Some thoughts on implementing the technique in other scenarios are provided.

hep-ph↗

arXiv2025

CV4Quantum: Reducing the Sampling Overhead in Probabilistic Error Cancellation Using Control Variates

Quasiprobabilistic decompositions (QPDs) play a key role in maximizing the utility of near-term quantum hardware. For example, Probabilistic Error Cancellation (PEC) (an error mitigation technique) and circuit cutting (which enables large quantum computations to be performed on quantum hardware with a limited number of qubits) both involve QPDs. Computations based on QPDs typically incur large sampling overheads that grow exponentially, e.g., with the number of error-terms mitigated or the number of circuit-cuts employed, limiting their practical feasibility. In this work, we adapt the control variates variance reduction technique from the statistics literature in order to reduce the sampling overhead in QPD-based computations. We demonstrate our method, dubbed CV4Quantum, using simulation experiments that mimic a realistic PEC scenario. In more than 50% of the PEC-based estimations performed in the study, we observed a more than 50% reduction in the number of samples needed to achieve a given precision when using our technique. We discuss how future research on constructing good control variates can lead to even stronger sampling overhead reduction.

quant-ph↗

arXiv2024

EFT Workshop at Notre Dame

The LPC EFT workshop was held April 25-26, 2024 at the University of Notre Dame. The workshop was organized into five thematic sessions: "how far beyond linear" discusses issues of truncation and validity in interpretation of results with an eye towards practicality; "reconstruction-level results" visits the question of how best to design analyses directly targeting inference of EFT parameters; "logistics of combining likelihoods" addresses the challenges of bringing a diverse array of measurements into a cohesive whole; "unfolded results" tackles the question of designing fiducial measurements for later use in EFT interpretations, and the benefits and limitations of unfolding; and "building a sample library" addresses how best to generate simulation samples for use in data analysis. This document serves as a summary of presentations, subsequent discussions, and actionable items identified over the course of the workshop.

hep-ex↗

arXiv2024

Fermion determinants on a quantum computer

We present a quantum algorithm to compute the logarithm of the determinant of the fermion matrix, assuming access to a classical lattice gauge field configuration. The algorithm uses the quantum eigenvalue transform, and quantum mean estimation, giving a query complexity that scales like $O(V\log(V))$ in the matrix dimension $V$.

hep-lat↗

arXiv2024

Variance Reduction via Simultaneous Importance Sampling and Control Variates Techniques Using Vegas

Monte Carlo (MC) integration is an important calculational technique in the physical sciences. Practical considerations require that the calculations are performed as accurately as possible for a given set of computational resources. To improve the accuracy of MC integration, a number of useful variance reduction algorithms have been developed, including importance sampling and control variates. In this work, we demonstrate how these two methods can be applied simultaneously, thus combining their benefits. We provide a python wrapper, named CoVVVR, which implements our approach in the Vegas program. The improvements are quantified with several benchmark examples from the literature.

hep-ph↗

arXiv2023

Optimal Mass Variables for Semivisible Jets

Strongly coupled hidden sector theories predict collider production of invisible, composite dark matter candidates mixed with standard model hadrons in the form of semivisible jets. Classical mass reconstruction techniques may not be optimal for these unusual topologies, in which the missing transverse momentum comes from massive particles and has a nontrivial relationship to the visible jet momentum. We apply the artificial event variable network, a semisupervised, interpretable machine learning technique that uses an information bottleneck, to derive superior mass reconstruction functions for several cases of resonant semivisible jet production. We demonstrate that the technique can extrapolate to unknown signal model parameter values. We further demonstrate the viability of conducting an actual search for new physics using this method, by applying the learned functions to standard model background events from quantum chromodynamics.

hep-ph↗

arXiv2023

Quantum circuit fidelity estimation using machine learning

The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the computation has been performed. In this work we introduce a machine-learning-based technique to estimate the fidelity between the state produced by a noisy quantum circuit and the target state corresponding to ideal noise-free computation. Our machine learning model is trained in a supervised manner, using smaller or simpler circuits for which the fidelity can be estimated using other techniques like direct fidelity estimation and quantum state tomography. We demonstrate that, for simulated random quantum circuits with a realistic noise model, the trained model can predict the fidelities of more complicated circuits for which such methods are infeasible. In particular, we show the trained model may make predictions for circuits with higher degrees of entanglement than were available in the training set, and that the model may make predictions for non-Clifford circuits even when the training set included only Clifford-reducible circuits. This empirical demonstration suggests classical machine learning may be useful for making predictions about beyond-classical quantum circuits for some non-trivial problems.

quant-ph↗

arXiv2023

New Machine Learning Techniques for Simulation-Based Inference: InferoStatic Nets, Kernel Score Estimation, and Kernel Likelihood Ratio Estimation

We propose an intuitive, machine-learning approach to multiparameter inference, dubbed the InferoStatic Networks (ISN) method, to model the score and likelihood ratio estimators in cases when the probability density can be sampled but not computed directly. The ISN uses a backend neural network that models a scalar function called the inferostatic potential $φ$. In addition, we introduce new strategies, respectively called Kernel Score Estimation (KSE) and Kernel Likelihood Ratio Estimation (KLRE), to learn the score and the likelihood ratio functions from simulated data. We illustrate the new techniques with some toy examples and compare to existing approaches in the literature. We mention en passant some new loss functions that optimally incorporate latent information from simulations into the training procedure.

stat.ML↗

arXiv2023

Qubit assignment using time reversal

As the number of qubits available on noisy quantum computers grows, it will become necessary to efficiently select a subset of physical qubits to use in a quantum computation. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We approach this problem using simulated annealing with a cost function based on the Loschmidt Echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google's superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt Echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.

quant-ph↗

arXiv2022

Kinematic Variables and Feature Engineering for Particle Phenomenology

Kinematic variables have been playing an important role in collider phenomenology, as they expedite discoveries of new particles by separating signal events from unwanted background events and allow for measurements of particle properties such as masses, couplings, spins, etc. For the past 10 years, an enormous number of kinematic variables have been designed and proposed, primarily for the experiments at the Large Hadron Collider, allowing for a drastic reduction of high-dimensional experimental data to lower-dimensional observables, from which one can readily extract underlying features of phase space and develop better-optimized data-analysis strategies. We review these recent developments in the area of phase space kinematics, summarizing the new kinematic variables with important phenomenological implications and physics applications. We also review recently proposed analysis methods and techniques specifically designed to leverage the new kinematic variables. As machine learning is nowadays percolating through many fields of particle physics including collider phenomenology, we discuss the interconnection and mutual complementarity of kinematic variables and machine learning techniques. We finally discuss how the utilization of kinematic variables originally developed for colliders can be extended to other high-energy physics experiments including neutrino experiments.

hep-ph↗

arXiv2022

Uncertainties associated with GAN-generated datasets in high energy physics

Recently, Generative Adversarial Networks (GANs) trained on samples of traditionally simulated collider events have been proposed as a way of generating larger simulated datasets at a reduced computational cost. In this paper we point out that data generated by a GAN cannot statistically be better than the data it was trained on, and critically examine the applicability of GANs in various situations, including a) for replacing the entire Monte Carlo pipeline or parts of it, and b) to produce datasets for usage in highly sensitive analyses or sub-optimal ones. We present our arguments using information theoretic demonstrations, a toy example, as well as in the form of a formal statement, and identify some potential valid uses of GANs in collider simulations.

hep-ph↗

arXiv2021

Deep-Learned Event Variables for Collider Phenomenology

The choice of optimal event variables is crucial for achieving the maximal sensitivity of experimental analyses. Over time, physicists have derived suitable kinematic variables for many typical event topologies in collider physics. Here we introduce a deep learning technique to design good event variables, which are sensitive over a wide range of values for the unknown model parameters. We demonstrate that the neural networks trained with our technique on some simple event topologies are able to reproduce standard event variables like invariant mass, transverse mass, and stransverse mass. The method is automatable, completely general, and can be used to derive sensitive, previously unknown, event variables for other, more complex event topologies.

hep-ph↗

arXiv2021

Non-Boolean Quantum Amplitude Amplification and Quantum Mean Estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-boolean oracles. The action of a non-boolean oracle $U_φ$ on an eigenstate $|x\rangle$ is to apply a state-dependent phase-shift $φ(x)$. Unlike boolean oracles, the eigenvalues $\exp(iφ(x))$ of a non-boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-boolean oracles are introduced. The first is the non-boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $φ(x)$. Starting from a given initial superposition state $|ψ_0\rangle$, the basis states with lower values of $\cos(φ)$ are amplified at the expense of the basis states with higher values of $\cos(φ)$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\langleψ_0|U_φ|ψ_0\rangle$, i.e., the expected value of $\exp(iφ(x))$ for a random $x$ sampled by making a measurement on $|ψ_0\rangle$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

quant-ph↗

arXiv2021

Finding Wombling Boundaries in LHC Data with Voronoi and Delaunay Tessellations

We address the problem of finding a wombling boundary in point data generated by a general Poisson point process, a specific example of which is an LHC event sample distributed in the phase space of a final state signature, with the wombling boundary created by some new physics. We discuss the use of Voronoi and Delaunay tessellations of the point data for estimating the local gradients and investigate methods for sharpening the boundaries by reducing the statistical noise. The outcome from traditional wombling algorithms is a set of boundary cell candidates with relatively large gradients, whose spatial properties must then be scrutinized in order to construct the boundary and evaluate its significance. Here we propose an alternative approach where we simultaneously form and evaluate the significance of all possible boundaries in terms of the total gradient flux. We illustrate our method with several toy examples of both straight and curved boundaries with varying amounts of signal present in the data.

hep-ph↗