About Me
Iām a physics Ph.D. candidate at the University of Kansas doing research in particle phenomenology. I have a love for the outdoors, eccentric hobbies, writing only in lowercase, and a willingness to try anything probably at least twice... we must be wary of statistical fluctuations; after all, there was no 750 GeV bump, nor any mass or tension.
Research Interests
My interests span from quantum algorithms in general ā and their potential uses in collider analyses in specific ā to gauge theories and model building, baryon asymmetry and dark matter. I feel like a paradigm shift in our theoretical understanding is inevitable but it first requires a paradigm shift in how we actually approach theory. I will give it to string theorists: dynamic generation of fields and parameters is enticing especially when buried by the surfeit of ad hoc models.
Publications & Preprints
-
Under Review:
Hybrid quantum-classical approach for combinatorial problems at hadron colliders
AbstractIn recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete example, we consider top quark pair production in the fully hadronic channel at the Large Hadron Collider. We investigate the performance of various quantum algorithms such as the Quantum Approximation Optimization Algorithm (QAOA) and a feedback-based algorithm (FALQON). We demonstrate that the efficiency for selecting the correct pairing is greatly improved by utilizing quantum algorithms over conventional kinematic methods. Furthermore, we observe that gate-based universal quantum algorithms perform on par with machine learning techniques and either surpass or match the effectiveness of quantum annealers. Our findings reveal that quantum algorithms not only provide a substantial increase in matching efficiency but also exhibit scalability and adaptability, making them suitable for a variety of high-energy physics applications. Moreover, quantum algorithms eliminate the extensive training processes needed by classical machine learning methods, enabling real-time adjustments based on individual event data. [arXiv] [inspire hep]
-
Real Singlet Scalar Benchmarks in the Multi-TeV Resonance Regime
AbstractScalar extensions of the Standard Model are of much interest at the LHC and future colliders. In particular, these models can give rise to resonant di-Higgs production and alter the Higgs trilinear coupling. In this paper, we study di-Higgs production in the Standard Model extended by a real scalar singlet with no additional symmetries. We determine how large the resonant di-Higgs rate and variation in the Higgs trilinear coupling can be in four scenarios: current LHC results and projected results at the HL-LHC, the HL-LHC combined with a circular collider such as the CEPC or FCC-ee, and the HL-LHC combined with a linear collider such as the ILC. While these are updated results from a previous study using current LHC data, we go further and find benchmark points in the multi-TeV resonance regime for future colliders beyond the HL-LHC. Considering current LHC results, the resonant di-Higgs rate can still be an order of magnitude larger than the SM predicted di-Higgs rate. In the HL-LHC scenario, the Higgs trilinear coupling can still be a factor of three larger than the SM prediction for resonance masses in the TeV range, where resonant searches may have less reach. This enhancement is just at the projected sensitivity of the HL-LHC. We find there are resonance masses for which the change in the Higgs trilinear is maximized while the resonant rate is negligible. We provide an analytical understanding of these effects with a discussion on the interplay of various constraints on the parameter space and the Higgs trilinear coupling. [arXiv] [inspire hep]
-
Variance Reduction via Simultaneous Importance Sampling and Control Variates Techniques Using Vegas
AbstractMonte 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. [arXiv] [inspire hep]