Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yasuaki Ito has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    GANSU lite: A zero-install, browser-based quantum chemistry platform

    by Yasuaki Ito, Haruto Fujii, Satoki Tsuji, Koji Nakano, Akihiko Kasagi

  • Open Access

    MOrbVis: Browser-Based Molecular Orbital Visualization with WebGPU-Accelerated On-the-Fly Evaluation

    by Yasuaki Ito, Satoki Tsuji, Koji Nakano, Akihiko Kasagi

    MOrbVis is an open-source web application that visualizes molecular orbitals directly in the browser without precomputed Gaussian Cube files. Reading only a Molden file, it evaluates Gaussian-type basis functions (s through g shells) on a three-dimensional grid through WebGPU compute shaders. Benchmarks on five devices─from a smartphone to a desktop with an NVIDIA RTX 5090─show that single-orbital evaluation on grids exceeding 106 points finishes within 100 ms, up to 3 orders of magnitude faster than the single-threaded CPU path. The tool requires no installation and is available at https://yasuaki-ito.github.io/morbvis/.


  • Open Access

    GANSU: A GPU-Native Quantum Chemistry Framework for Efficient Hartree–Fock and Post-HF Calculations

    by Yasuaki Ito, Satoki Tsuji, Koji Nakano, Akihiko Kasagi

    GPU-accelerated quantum chemistry programs can dramatically reduce the time required for electronic structure calculations, yet most existing implementations either retrofit GPU kernels onto legacy CPU codebases or optimize individual kernels without addressing workflow-level integration overhead. We present GANSU (GPU Accelerated Numerical Simulation Utility), an open-source quantum chemistry framework written entirely in CUDA/C++ that integrates GPU-accelerated kernels for electron repulsion integrals, Fock matrix construction, and post-Hartree–Fock (post-HF) methods into a unified, GPU-resident execution pipeline. The key design principle is to eliminate host–device data transfers between computational stages by keeping all intermediate data, including density matrices, integral buffers, and Fock matrix replicas, on the GPU throughout the self-consistent field (SCF) iteration, combined with runtime-selectable integral strategies (stored ERI, resolution-of-the-identity, and Direct-SCF) that adapt to system size and available memory. On an NVIDIA H200 GPU, GANSU achieves end-to-end speedups of up to 52× over PySCF for SCF, 45× for MP2 on molecules with up to 470 basis functions, and 44× for FCI, while outperforming GPU4PySCF by up to 34× for FCI, across a range of molecular systems with up to 650 basis functions. The framework further provides analytical energy gradients and geometry optimization with nine algorithms, all operating within the same GPU-resident data flow. These results demonstrate that workflow-aware kernel integration, not just kernel-level optimization, is essential for realizing the full potential of GPU acceleration in scientific computing. GANSU is publicly available under the BSD-3-Clause license.


  • GPU ‐Accelerated One‐Electron Integral Computation for Quantum Chemistry

    by Nobuya Yokogawa, Yasuaki Ito, Satoki Tsuji, Haruto Fujii, Kanta Suzuki, Koji Nakano, Victor Parque, Akihiko Kasagi

    In Quantum chemical computation, numerical schemes such as the Hartree–Fock (HF) and density functional theory (DFT) are widely used to solve the Schrödinger equation numerically, to realize experiment‐free prediction and analysis of key molecular properties such as structure and energy. Computing one‐electron integrals, such as kinetic energy integrals and nuclear attraction integrals, is essential in both HF and DFT to characterize the molecular electronic states. However, as molecules of practical interest grow in size and angular momentum, computing one‐electron orbitals becomes computationally expensive in most cases. Although computing kinetic energy integrals on CPUs is straightforward, bottlenecks in CPU‐GPU data transfer have often been overlooked. In this study, we propose an efficient method to compute both the kinetic‐energy and nuclear‐attractive integrals on GPUs. First, we explicitly and symbolically expand recurrence relations based on the Obara–Saika and McMurchie–Davidson methods to eliminate redundant operations, thus improving computational efficiency. Second, we implemented a hybrid method that selects the best/fastest of both methods depending on the integration task. Third, we achieved further speedups by using CUDA streams to parallelize the execution of multiple kernels and efficiently utilize multiprocessor resources on the GPU. Computational experiments using NVIDIA A100 GPUs and Intel Xeon Gold 6338 CPU on relevant molecules of interest demonstrated the superiority of our one‐electron integral GPU implementations, achieving a speedup of 20.2 times over PySCF, and a speedup of 132.6 times over GPU4PySCF.


  • Open Access

    Predicting the Cooling Rate in Steel-Part Heat Treatment via Random Forests

    by Ikuto Nakatsukasa, Victor Parque, Yasuaki Ito, Koji Nakano

    Heat treatment is a thermal-processing method involving controlled heating and cooling cycles designed to achieve the desired properties of materials. Among these steps, the cooling rate in heat treatment plays a crucial role, as it significantly influences the resulting material properties. In this paper, we investigated the feasibility of random forests in estimating the cooling-rate parameters for the steel-part heat treatment process. Random forests are particularly appealing in modeling an ensemble of expressive decision trees from which cooling can be modeled and estimated from the interaction of metal features. Our computational experiments using real-world data from industrial-scale operations demonstrated the advantageous properties of random forest regression models, particularly when combined with a random oversampling scheme. We also found that the chemical composition—specifically carbon and chromium content—as well as the weight of the steel parts, are key features that predict the cooling rate of steel parts. Furthermore, our validation using real-world cooling scenarios aligned closely with the practical insights of seasoned operators who routinely recommend cooling parameters for the metal-normalizing process. Our results highlight the effectiveness of the ensemble approach of random forest for practical applicability in industrial-scale heat treatment.

  • Open Access

    Optimizing Heat Treatment Schedules via QUBO Formulation

    by Ikuto Nakatsukasa, Koji Nakano, Victor Parque, Yasuaki Ito

    Quadratic Unconstrained Binary Optimization (QUBO) is the problem of finding binary variable assignments that minimize a given quadratic objective function. Many combinatorial optimization problems can be transformed into equivalent QUBO formulations, and significant research efforts have been devoted to developing efficient QUBO solvers. This paper presents a method for converting a real-world, industrial-scale scheduling problem arising in the heat treatment process of metal parts into an equivalent QUBO formulation. In current operations, two experienced operators manually spend about two hours each day to create a 24 h schedule for two furnaces, considering various constraints and processing priorities. We have developed a C++-based scheduling system that automatically converts this problem into a QUBO instance and solves it using QUBO++, a high-performance toolkit we have recently developed and released. The experimental results on actual scheduling instances show that QUBO++ consistently produces high-quality solutions in a short time, leveraging the computational merits of the QUBO formulation. The system reduces the labor equivalent to two hours of expert work per day, indicating that automated scheduling via QUBO++ is a promising approach for improving efficiency and accuracy in factory operations.

  • Open Access

    GPU-Accelerated Fock Matrix Computation with Efficient Reduction

    by Satoki Tsuji, Yasuaki Ito, Haruto Fujii, Nobuya Yokogawa, Kanta Suzuki, Koji Nakano, Victor Parque, Akihiko Kasagi

    In quantum chemistry, constructing the Fock matrix is essential to compute Coulomb interactions among atoms and electrons and, thus, to determine electron orbitals and densities. In the fundamental framework of quantum chemistry such as the Hartree–Fock method, the iterative computation of the Fock matrix is a dominant process, constituting a critical computational bottleneck. Although the Fock matrix computation has been accelerated by parallel processing using GPUs, the issue of performance degradation due to memory contention remains unresolved. This is due to frequent conflicts of atomic operations accessing the same memory addresses when multiple threads update the Fock matrix elements concurrently. To address this issue, we propose a parallel algorithm that efficiently and suitably distributes the atomic operations; and significantly reduces the memory contention by decomposing the Fock matrix into multiple replicas, allowing each GPU thread to contribute to different replicas. Experimental results using a relevant set/configuration of molecules on an NVIDIA A100 GPU show that our approach achieves up to a 3.75× speedup in Fock matrix computation compared to conventional high-contention approaches. Furthermore, our proposed method can also be readily combined with existing implementations that reduce the number of atomic operations, leading to a 1.98× improvement.


  • A GPU Implementation of McMurchie-Davidson Algorithm for Two-Electron Repulsion Integral Computation

    by Haruto Fujii, Yasuaki Ito, Nobuya Yokogawa, Kanta Suzuki, Satoki Tsuji, Koji Nakano, Akihiko Kasagi


  • Open Access

    Efficient GPU Implementation of the McMurchie–Davidson Method for Shell-Based ERI Computations

    by Haruto Fujii, Yasuaki Ito, Nobuya Yokogawa, Kanta Suzuki, Satoki Tsuji, Koji Nakano, Victor Parque, Akihiko Kasagi

    Quantum chemistry offers the formal machinery to derive molecular and physical properties arising from (sub)atomic interactions. However, as molecules of practical interest are largely polyatomic, contemporary approximation schemes such as the Hartree–Fock scheme are computationally expensive due to the large number of electron repulsion integrals (ERIs). Central to the Hartree–Fock method is the efficient computation of ERIs over Gaussian functions (GTO-ERIs). Here, the well-known McMurchie–Davidson method (MD) offers an elegant formalism by incrementally extending Hermite Gaussian functions and auxiliary tabulated functions. Although the MD method offers a high degree of versatility to acceleration schemes through Graphics Processing Units (GPUs), the current GPU implementations limit the practical use of supported values of the azimuthal quantum number. In this paper, we propose a generalized framework capable of computing GTO-ERIs for arbitrary azimuthal quantum numbers, provided that the intermediate terms of the MD method can be stored. Our approach benefits from extending the MD recurrence relations through shells, batches, and triple-buffering of the shared memory, and ordering similar ERIs, thus enabling the effective parallelization and use of GPU resources. Furthermore, our approach proposes four GPU implementation schemes considering the suitable mappings between Gaussian basis and CUDA blocks and threads. Our computational experiments involving the GTO-ERI computations of molecules of interest on an NVIDIA A100 Tensor Core GPU (NVIDIA, Santa Clara, CA, USA) have revealed the merits of the proposed acceleration schemes in terms of computation time, including up to a 72× improvement over our previous GPU implementation and up to a 4500× speedup compared to a naive CPU implementation, highlighting the effectiveness of our method in accelerating ERI computations for both monatomic and polyatomic molecules. Our work has the potential to explore new parallelization schemes of distinct and complex computation paths involved in ERI computation.


  • Ising Models for Solving the N‐Queens Puzzle Based on the Domain‐Wall Vectors

    by Shunsuke Tsukiyama, Koji Nakano, Yasuaki Ito, Takumi Kato, Yuya Kawamata

    An Ising model is a mathematical model defined by an objective function comprising a quadratic formula of multiple spin variables, each taking values of either or . The task of determining a spin value assignment to these variables that minimizes the resulting value of an Ising model is a challenging optimization problem. Recently, quantum annealers, consisting of qubit cells interconnected according to principles of quantum mechanics, have emerged as a solution for tackling such problems. Ising models characterized by fewer quadratic terms are preferable as they reduce the resource requirements of quantum annealers. Additionally, it is advantageous for the absolute values of coefficients associated with linear and quadratic terms to be small to facilitate the discovery of good solutions, given the inherent limitations in the resolution of quantum annealers. The primary contribution of this article lies in presenting Ising models tailored for solving the ‐Queens puzzle. The conventional Ising model for this puzzle involves quadratic terms, with the maximum absolute value of coefficients being . Our novel Ising model significantly reduces the number of quadratic terms to only , with a maximum absolute coefficient of 6. Furthermore, we provide embedding results for a quantum annealer D‐Wave Advantage utilizing a Pegasus graph . We succeeded in embedding our novel Ising model for up to the 21‐Queens puzzle, while the conventional Ising model can be embedded only for up to the 14‐Queens puzzle.