YMYuta Mizuno

Yuta Mizuno

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yuta Mizuno has a total of 62 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Size of Biomolecular Condensates Dictates Fate in Liquid–Solid Phase Transitions through Amorphous–Amyloid Competition

    by Junka Kawakami, Taiki Ozawa, Yoko Maruyama, Honoka Ishikawa, Yuto Oshita, Kota Yamauchi, Koichi Kobayashi, Shinji Kajimoto, Takakazu Nakabayashi, Shunsuke Tomita, et al.

    Proteins function not only through intramolecular folding and intermolecular complex formation but also through phase transitions driven by intermolecular interactions. Such phases, including liquid-like condensates, amorphous aggregates (AAs), and amyloid fibrils, are linked to distinct biological functions and pathologies. Although the transition from liquid-like condensates to amyloids has been extensively studied, the kinetic relationships between amyloids and other metastable solid states under cell-sized confinement remain unclear, which may hinder the establishment of effective therapeutic strategies. This knowledge gap arises because bulk-scale experiments inevitably lead to the conversion of metastable phases into the most stable phase. We developed a droplet-based microfluidic system that quantifies amyloid nucleation and metastable AA formation. Using the yeast prion protein Sup35, we found that condensates convert into both amyloids and AAs and that AA formation imposes a kinetic barrier that suppresses amyloid formation in a size-dependent manner at the micrometer scale, highlighting the importance of size effects in condensate-to-amyloid transitions. Furthermore, we demonstrated that the well-known amyloid inhibitor (−)-epigallocatechin-3-gallate paradoxically promoted amyloid formation at low concentrations by modulating the AA and amyloid nucleation kinetics. This phenomenon cannot, in principle, be observed in bulk-scale experiments and became apparent only under micrometer-scale confinement in the present system. These findings provide fundamental insights into protein phase transitions in cellular environments and may guide the development of novel therapeutic strategies targeting the metastable aggregates of amyloidogenic proteins.


  • Open Access

    Droplet-based microfluidics uncovers hidden kinetic pathways of protein condensates: divergent routes to amyloids and amorphous aggregates.

    by Junka Kawakami, Taiki Ozawa, Yoko Maruyama, Honoka Ishikawa, Kota Yamauchi, Koichi Kobayashi, Shinji Kajimoto, Takakazu Nakabayashi, Shunsuke Tomita, Tanushree Agarwal, et al.

    Proteins occupy various states, including liquid-like condensates, amorphous aggregates, and amyloid fibrils, each linked to distinct biological functions and pathologies. While the transition from liquid-like condensates to amyloids has been extensively studied, kinetic relationship between amyloid and other metastable solid states remain unclear, as bulk-scale experiments inevitably lead to the conver-sion of metastable phases into the most stable phase. We developed a droplet-based microfluidic sys-tem that quantifies amyloid nucleation and metastable amorphous aggregate (AA) formation. Using the yeast prion protein Sup35, we found that condensates convert into both amyloids and AAs, and that AA formation suppresses amyloid formation in size-dependent manner at the micrometer scale. Further-more, we demonstrated the well-known amyloid inhibitor (−)-epigallocatechin-3-gallate paradoxically promoted amyloid formation at low concentrations by modulating AA and amyloid nucleation kinetics. These findings provide fundamental insights into protein phase transitions in vivo and may inform nov-el therapeutic strategies targeting metastable aggregates of amyloidogenic proteins.

  • Open Access

    Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing

    by Mohammad Ali, Yuta Mizuno, Seiji Akiyama, Yuuya Nagata, Tamiki Komatsuzaki

    Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long time. Atom-to-atom mapping (AAM) is a procedure that establishes such correspondence(s) between the atoms of reactants and products in a chemical reaction. Currently, automatic AAM tools play a pivotal role in various chemoinformatics tasks. However, achieving accurate automatic AAM for complex or unknown reactions within a reasonable computation time remains a significant challenge due to the combinatorial nature of the problem and the difficulty in applying appropriate reaction rules. In this study, we propose a rule-free AAM algorithm, which enumerates all atom-to-atom correspondences that minimize the number of bond cleavages and formations during the reaction. To reduce the computational burden associated with the combinatorial optimization (i.e., minimizing bond changes), we introduce Ising computing, a computing paradigm that has gained significant attention for its efficiency in solving hard combinatorial optimization problems. We found that our Ising computing framework outperforms conventional combinatorial optimization algorithms in terms of computation times, making it feasible to solve the AAM problem without reaction rules in an acceptable time. Furthermore, our AAM algorithm successfully found the correct AAM solution for all problems in a benchmark data set. In contrast, conventional AAM algorithms based on chemical heuristics failed for several problems. Specifically, these algorithms either failed to find the optimal solution in terms of bond changes, or they identified only one optimal solution, which was incorrect when multiple optimal solutions exist. These results emphasize the importance of enumerating all optimal correspondences that minimize bond changes, which is effectively achieved by our Ising-computing framework.


  • Open Access

    Enumeration Approach to Atom-to-Atom Mapping Accelerated by Ising Computing

    by Mohammad Ali, Yuta Mizuno, Seiji Akiyama, Yuuya Nagata, Tamiki Komatsuzaki

    Chemical reactions are regarded as transformations of chemical structures, and the question of which atoms in the reactants correspond to which atoms in the products has attracted chemists for a long time. Atom-to-atom mapping (AAM) is a procedure that establishes such correspondence(s) between the atoms of reactants and products in a chemical reaction. Currently, automatic AAM tools play a pivotal role in various chemoinformatics tasks. However, achieving accurate automatic AAM for complex or unknown reactions within a reasonable computation time remains a significant challenge due to the combinatorial nature of the problem and the difficulty in applying appropriate reaction rules. In this study, we propose a rule-free AAM algorithm, which enumerates all atom-to-atom correspondences that minimize the number of bond cleavages and formations during the reaction. To reduce the computational burden associated with the combinatorial optimization (i.e., minimizing bond changes), we introduce Ising computing, a novel computing paradigm that has gained significant attention for its efficiency in solving hard combinatorial optimization problems. We found that our Ising computing framework outperforms conventional combinatorial optimization algorithms in terms of computation times, making it feasible to solve the AAM problem without reaction rules in an acceptable time. Furthermore, our AAM algorithm successfully found the correct AAM solution for all problems in a benchmark dataset. In contrast, conventional AAM algorithms based on chemical heuristics failed for several problems. Specifically, these algorithms either failed to find the optimal solution in terms of bond changes, or they identified only one optimal solution, which was incorrect when multiple optimal solutions exist. These results emphasize the importance of enumerating all optimal correspondences that minimize bond changes, which is effectively achieved by our Ising-computing framework.

  • Low-dimensional projection of reactivity classes in chemical reaction dynamics using supervised dimensionality reduction

    by Ryoichi Tanaka, Yuta Mizuno, Takuro Tsutsumi, Mikito Toda, Tetsuya Taketsugu, Tamiki Komatsuzaki

    Transition state theory (TST) provides a framework to estimate the rate of chemical reactions. Despite its great success with many reaction systems, the underlying assumptions such as local equilibrium and nonrecrossing do not necessarily hold in all cases. Although dynamical systems theory can provide the mathematical foundation of reaction tubes existing in phase space that enables us to predict the fate of reactions free from the assumptions of TST, numerical demonstrations for large systems have been yet one of the challenges. Here, we propose a dimensionality reduction algorithm to demonstrate structures in phase space (called reactive islands) that predict reactivity in systems with many degrees of freedom. The core of this method is the application of supervised principal component analysis, where a coordinate transformation is performed to preserve the dynamical information on reactivity (i.e., to which potential basin the system moves from a region of interest) as much as possible. The reactive island structures are expected to be reflected in the transformed, low-dimensional phase space. As an illustrative example, the algorithm is scrutinized using a modified Hénon–Heiles Hamiltonian system extended to many degrees of freedom, which has three channels leading to three different products from one stable potential basin. It is shown that our algorithm can predict the reactivity in the transformed, low-dimensional coordinate system better than a naïve coordinate system and that the reactivity distribution in the transformed low-dimensional space is considered to reflect the underlying reactive islands.

  • Open Access

    Quantum algorithm for dynamic mode decomposition integrated with a quantum differential equation solver

    by Yuta Mizuno, Tamiki Komatsuzaki

    We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of a dynamic mode decomposition algorithm used in diverse fields such as fluid dynamics, molecular dynamics, and epidemiology. Our quantum algorithm can also compute matrix eigenvalues and eigenvectors by analyzing the corresponding linear dynamical system. Our algorithm handles a broad range of matrices, particularly those with complex eigenvalues. The complexity of our quantum algorithm is O(polylogN) for an N-dimensional system. This is an exponential speedup over known classical algorithms with at least O(N) complexity. Thus, our quantum algorithm is expected to enable high-dimensional dynamical systems analysis and large matrix eigenvalue decomposition, intractable for classical computers.


  • Open Access

    A Quantum Algorithm for Dynamic Mode Decomposition Integrated with a Quantum Differential Equation Solver

    by Yuta Mizuno, Tamiki Komatsuzaki

    We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid dynamics and epidemiology. Our quantum algorithm can also compute matrix eigenvalues and eigenvectors by analyzing the corresponding linear dynamical system. Our algorithm handles a broad range of matrices, in particular those with complex eigenvalues. The complexity of our quantum algorithm is $O(\operatorname{poly}\log N)$ for an $N$-dimensional system. This is an exponential speedup over known classical algorithms with at least $O(N)$ complexity. Thus, our quantum algorithm is expected to enable high-dimensional dynamical systems analysis and large matrix eigenvalue decomposition, intractable for classical computers.

  • Open Access

    Low-Dimensional Projection of Reactive Islands in Chemical Reaction Dynamics Using a Supervised Dimensionality Reduction Method

    by Ryoichi Tanaka, Yuta Mizuno, Takuro Tsutsumi, Mikito Toda, Tetsuya Taketsugu, Tamiki Komatsuzaki

    Transition state theory is a standard framework for predicting the rate of a chemical reaction. Although the transition state theory has been successfully applied to numerous chemical reaction analyses, many experimental and theoretical studies have reported chemical reactions with a reactivity which cannot be explained by the transition state theory due to dynamic effects. Dynamical systems theory provides a theoretical framework for elucidating dynamical mechanisms of such chemical reactions. In particular, reactive islands are essential phase space structures revealing dynamical reaction patterns. However, the numerical computation of reactive islands in a reaction system of many degrees of freedom involves an intrinsic challenge -- the curse of dimensionality. In this paper, we propose a dimensionality reduction algorithm for computing reactive islands in a reaction system of many degrees of freedom. Using the supervised principal component analysis, the proposed algorithm projects reactive islands into a low-dimensional phase space with preserving the dynamical information on reactivity as much as possible. The effectiveness of the proposed algorithm is examined by numerical experiments for Hénon-Heiles systems extended to many degrees of freedom. The numerical results indicate that our proposed algorithm is effective in terms of the quality of reactivity prediction and the clearness of the boundaries of projected reactive islands. The proposed algorithm is a promising elemental technology for practical applications of dynamical systems analysis to real chemical systems.

  • Open Access

    Finding optimal pathways in chemical reaction networks using Ising machines

    by Yuta Mizuno, Tamiki Komatsuzaki

    Finding optimal pathways in chemical reaction networks is essential for elucidating and designing chemical processes, with significant applications such as synthesis planning and metabolic pathway analysis. Such a chemical pathway-finding problem can be formulated as a constrained combinatorial optimization problem, aiming to find an optimal combination of chemical reactions connecting starting materials to target materials in a given network. Due to combinatorial explosion, the computation time required to find an optimal pathway increases exponentially with the network size. Ising machines, including quantum and simulated annealing devices, are promising novel computers dedicated to such hard combinatorial optimization. However, to the best of our knowledge, there has yet to be an attempt to apply Ising machines to chemical pathway-finding problems. In this article, we present the Ising/quantum computing application for chemical pathway-finding problems. The Ising model, translated from a chemical pathway-finding problem, involves several types of penalty terms for violating constraints. It is not obvious how to set appropriate penalty strengths of different types. To address this challenge, we employ Bayesian optimization for parameter tuning. Furthermore, we introduce a technique that enhances tuning performance by grouping penalty terms according to the underlying problem structure. The performance evaluation and analysis of the proposed algorithm were conducted using a D-Wave Advantage system and simulated annealing. The benchmark results reveal challenges in finding exact optimal pathways. Concurrently, the results indicate the feasibility of finding approximate optimal pathways, provided that a certain degree of relative error in cost value is acceptable. Published by the American Physical Society 2024