arXiv subjects

Junichi Tanaka

Publications and source records attributed to Junichi Tanaka.

15 recordsLinked to original sources

arXiv2026

Development of an LLM-Based System for Automatic Code Generation from HEP Publications

Ensuring the reproducibility of physics results is one of the crucial challenges in high-energy physics (HEP). In this study, we develop a proof-of-concept system that uses large language models (LLMs) to extract analysis procedures from HEP publications and generate executable analysis code for reproducing published results. Our method consists of two stages. In the first stage, open-weight LLMs extract event selection criteria, object definitions, and other relevant analysis information from a target paper and, when necessary, from its referenced publications, and then produce a structured selection list. In the second stage, the structured selection list is used to generate analysis code, which is then executed and validated iteratively. As a benchmark, we use the ATLAS $H \to ZZ^{*} \to 4\ell$ analysis based on proton-proton collision data recorded in 2015 and 2016 and released as ATLAS Open Data. This benchmark allows direct comparison between the generated results and the published analysis, as well as comparison with a manually developed baseline implementation. We separately evaluate selection extraction and code generation in order to clarify the current capabilities and limitations of open-weight LLMs for HEP analysis reproduction. Our initial results show that recent open-weight models can recover many documented selection criteria from papers and references, and that in some runs they can generate event selections fully matching a baseline implementation at the event level. At the same time, stochasticity, hallucination, and execution failure remain significant challenges. These results suggest that LLMs are already promising as human-in-the-loop tools for reproducibility support, although they are not yet reliable as fully autonomous HEP analysis agents. In this paper, we report the design of the prototype system and its initial performance evaluation.

physics.data-an↗

arXiv2026

Comprehensive Numerical Studies of Barren Plateau and Overparametrization in Variational Quantum Algorithm

The variational quantum algorithm (VQA) with a parametrized quantum circuit is widely applicable to near-term quantum computing, but its fundamental issues that limit optimization performance have been reported in the literature. For example, VQA optimization often suffers from vanishing gradients called barren plateau (BP) and the presence of local minima in the landscape of the cost function. Numerical studies have shown that the trap in local minima is significantly reduced when the circuit is overparametrized (OP), where the number of parameters exceeds a certain threshold. Theoretical understanding of the BP and OP phenomena has advanced over the past years, however, comprehensive studies of both effects in the same setting are not fully covered in the literature. In this paper, we perform a comprehensive numerical study in VQA, quantitatively evaluating the impacts of BP and OP and their interplay on the optimization of a variational quantum circuit, using concrete implementations of one-dimensional transverse and longitudinal field quantum Ising model. The numerical results are compared with the theoretical diagnostics of BP and OP phenomena. The framework presented in this paper will provide a guiding principle for designing VQA algorithms and ansatzes with theoretical support for behaviors of parameter optimization in practical settings.

quant-ph↗

arXiv2024

Signal model parameter scan using Normalizing Flow

This paper presents a parameter scan technique for BSM signal models based on normalizing flow. Normalizing flow is a type of deep learning model that transforms a simple probability distribution into a complex probability distribution as an invertible function. By learning an invertible transformation between a complex multidimensional distribution, such as experimental data observed in collider experiments, and a multidimensional normal distribution, the normalizing flow model gains the ability to sample (or generate) pseudo experimental data from random numbers and to evaluate a log-likelihood value from multidimensional observed events. The normalizing flow model can also be extended to take multidimensional conditional variables as arguments. Thus, the normalizing flow model can be used as a generator and evaluator of pseudo experimental data conditioned by the BSM model parameters. The log-likelihood value, the output of the normalizing flow model, is a function of the conditional variables. Therefore, the model can quickly calculate gradients of the log-likelihood to the conditional variables. Following this property, it is expected that the most likely set of conditional variables that reproduce the experimental data, i.e. the optimal set of parameters for the BSM model, can be efficiently searched. This paper demonstrates this on a simple dataset and discusses its limitations and future extensions.

physics.data-an↗

arXiv2023

Pre-training strategy using real particle collision data for event classification in collider physics

This study aims to improve the performance of event classification in collider physics by introducing a pre-training strategy. Event classification is a typical problem in collider physics, where the goal is to distinguish the signal events of interest from background events as much as possible to search for new phenomena in nature. A pre-training strategy with feasibility to efficiently train the target event classification using a small amount of training data has been proposed. Real particle collision data were used in the pre-training phase as a novelty, where a self-supervised learning technique to handle the unlabeled data was employed. The ability to use real data in the pre-training phase eliminates the need to generate a large amount of training data by simulation and mitigates bias in the choice of physics processes in the training data. Our experiments using CMS open data confirmed that high event classification performance can be achieved by introducing a pre-trained model. This pre-training strategy provides a potential approach to save computational resources for future collider experiments and introduces a foundation model for event classification.

hep-ex↗

arXiv2022

Decay-aware neural network for event classification in collider physics

The goal of event classification in collider physics is to distinguish signal events of interest from background events to the extent possible to search for new phenomena in nature. We propose a decay-aware neural network based on a multi-task learning technique to effectively address this event classification. The proposed model is designed to learn the domain knowledge of particle decays as an auxiliary task, which is a novel approach to improving learning efficiency in the event classification. Our experiments using simulation data confirmed that an inductive bias was successfully introduced by adding the auxiliary task, and significant improvements in the event classification were achieved compared with boosted decision tree and simple multi-layer perceptron models.

hep-ex↗

arXiv2021

Measurement-Free Ultrafast Quantum Error Correction by Using Multi-Controlled Gates in Higher-Dimensional State Space

Quantum error correction is a crucial step beyond the current noisy-intermediate-scale quantum device towards fault-tolerant quantum computing. However, most of the error corrections ever demonstrated rely on post-selection of events or post-correction of states, based on measurement results repeatedly recorded during circuit execution. On the other hand, real-time error correction is supposed to be performed through classical feedforward of the measurement results to data qubits. It provides unavoidable latency from conditional electronics that would limit the scalability of the next-generation quantum processors. Here we propose a new approach to real-time error correction that is free from measurement and realized by using multi-controlled gates based on higher-dimensional state space. Specifically, we provide a series of novel decompositions of a Toffoli gate by using the lowest three energy levels of a transmon that significantly reduce the number of two-qubit gates and discuss their essential features, such as extendability to an arbitrary number of control qubits, the necessity of exclusively controlled NOT gates, and usefulness of their incomplete variants. Combined with the recently demonstrated schemes of fast two-qubit gates and all-microwave qubit reset, it would substantially shorten the time required for error correction and resetting ancilla qubits compared to a measurement-based approach and provide an error correction rate of $\gtrsim1$~MHz with high accuracy for three-qubit bit- and phase-flip errors.

quant-ph↗

arXiv2021

Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications

There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce two separate ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. The first ingredient is a technique to recognize repeated patterns of quantum gates, opening up the possibility of future hardware co-optimization. The second ingredient is an approach to reduce circuit complexity by identifying zero- or low-amplitude computational basis states and redundant gates. As a demonstration, AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. For this algorithm, our optimization scheme brings a significant reduction in the gate count without losing any accuracy compared to the original circuit. Additionally, we have investigated whether this can be demonstrated on a quantum computer using polynomial resources. Our technique is generic and can be useful for a wide variety of quantum algorithms.

quant-ph↗

arXiv2021

Event Classification with Multi-step Machine Learning

The usefulness and value of Multi-step Machine Learning (ML), where a task is organized into connected sub-tasks with known intermediate inference goals, as opposed to a single large model learned end-to-end without intermediate sub-tasks, is presented. Pre-optimized ML models are connected and better performance is obtained by re-optimizing the connected one. The selection of an ML model from several small ML model candidates for each sub-task has been performed by using the idea based on Neural Architecture Search (NAS). In this paper, Differentiable Architecture Search (DARTS) and Single Path One-Shot NAS (SPOS-NAS) are tested, where the construction of loss functions is improved to keep all ML models smoothly learning. Using DARTS and SPOS-NAS as an optimization and selection as well as the connections for multi-step machine learning systems, we find that (1) such a system can quickly and successfully select highly performant model combinations, and (2) the selected models are consistent with baseline algorithms, such as grid search, and their outputs are well controlled.

cs.LG↗

arXiv2021

An Improvement of Object Detection Performance using Multi-step Machine Learnings

Connecting multiple machine learning models into a pipeline is effective for handling complex problems. By breaking down the problem into steps, each tackled by a specific component model of the pipeline, the overall solution can be made accurate and explainable. This paper describes an enhancement of object detection based on this multi-step concept, where a post-processing step called the calibration model is introduced. The calibration model consists of a convolutional neural network, and utilizes rich contextual information based on the domain knowledge of the input. Improvements of object detection performance by 0.8-1.9 in average precision metric over existing object detectors have been observed using the new model.

cs.CV↗

arXiv2021

Event Classification with Quantum Machine Learning in High-Energy Physics

We present studies of quantum algorithms exploiting machine learning to classify events of interest from background events, one of the most representative machine learning applications in high-energy physics. We focus on variational quantum approach to learn the properties of input data and evaluate the performance of the event classification using both simulators and quantum computing devices. Comparison of the performance with standard multi-variate classification techniques based on a boosted-decision tree and a deep neural network using classical computers shows that the quantum algorithm has comparable performance with the standard techniques at the considered ranges of the number of input variables and the size of training samples. The variational quantum algorithm is tested with quantum computers, demonstrating that the discrimination of interesting events from background is feasible. Characteristic behaviors observed during a learning process using quantum circuits with extended gate structures are discussed, as well as the implications of the current performance to the application in high-energy physics experiments.

physics.comp-ph↗

arXiv2019

Studying gaugino masses in supersymmetric model at future 100 TeV $pp$ collider

We discuss prospects of studying supersymmetric model at future $pp$ circular collider (FCC) with its centre-of-mass energy of $\sim 100\ {\rm TeV}$. We pay particular attention to the model in which Wino is lighter than other supersymmetric particles and all the gauginos are within the kinematical reach of the FCC, which is the case in a large class of so-called pure gravity mediation model based on anomaly mediated supersymmetry breaking. In such a class of model, charged Wino becomes long-lived with its decay length of $\sim 6\ {\rm cm}$, and the charged Wino tracks may be identified in particular by the inner pixel detector; the charged Wino tracks can be used not only for the discrimination of standard model backgrounds but also for the event reconstructions. We show that precise determinations of the Bino, Wino, and gluino masses are possible at the FCC. For such measurements, information about the charged Wino tracks, including the one about the velocity of the charged Wino using the time of the hit at the pixel detector, is crucial. With the measurements of the gaugino masses in the pure gravity mediation model, we have an access to more fundamental parameters like the gravitino mass.

hep-ph↗

arXiv2017

Report by the Committee on the Scientific Case of the ILC Operating at 250 GeV as a Higgs Factory

This document is the final report by the Committee on the Scientific Case of the ILC Operating at 250 GeV as a Higgs Factory. This committee was commissioned by the Japan Association of High Energy Physicists. The purpose of this committee is to investigate and compare the capability to determine the energy scale of new phenomena and new principles and the capability to uncover the origin of matter-antimatter asymmetry.

hep-ex↗

arXiv2011

Drell-Yan Production of Z' in the Three-Site Higgsless Model at the LHC

In the Higgsless models, there are extra gauge bosons which keep the perturbative unitarity of a longitudinally polarized gauge boson. The three-site Higgsless model is a minimal Higgsless model and contains three extra gauge bosons, $W^{\prime \pm}$ and Z'. In this paper, we report the discovery potential of the Z' gauge boson via Drell-Yan production with Z'(mass=380, 500, 600 GeV) $\rightarrow WW \rightarrow \ellνqq$ ($\ell=e$, $μ$) at the LHC ($\sqrt{s}$=14 TeV).

hep-ph↗

arXiv2004

Study of Black Holes with the ATLAS detector at the LHC

We evaluate the potential of the ATLAS detector for discovering black holes produced at the LHC, as predicted in models with large extra dimensions where quantum gravity is at the TeV scale. We assume that black holes decay by Hawking evaporation to all Standard Model particles democratically. We comment on the possibility to estimate the Planck scale.

hep-ph↗

arXiv2003

A data Grid testbed environment in Gigabit WAN with HPSS

For data analysis of large-scale experiments such as LHC Atlas and other Japanese high energy and nuclear physics projects, we have constructed a Grid test bed at ICEPP and KEK. These institutes are connected to national scientific gigabit network backbone called SuperSINET. In our test bed, we have installed NorduGrid middleware based on Globus, and connected 120TB HPSS at KEK as a large scale data store. Atlas simulation data at ICEPP has been transferred and accessed using SuperSINET. We have tested various performances and characteristics of HPSS through this high speed WAN. The measurement includes comparison between computing and storage resources are tightly coupled with low latency LAN and long distant WAN.

cs.DC↗