Shu Tanaka
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
Research Subjects
Shu Tanaka has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Nozomu Togawa
Department of Computer Science and Communications Engineering, Waseda University, Shinjuku, Tokyo, Japan
6 shared publications - Ryo Tamura
National Institute for Materials Science
4 shared publications - Shuta Kikuchi
Graduate School of Science and Technology, Keio University, Yokohama, Kanagawa, Japan
4 shared publications - Tomohiro Hattori
Keio University
4 shared publications Yoshiki Matsuda
Fixstars Tokyo Japan
4 shared publications- Yuya Seki
Graduate School of Science and Technology, Keio University 2 , 3-14-1 Hiyoshi, Kouhoku-ku, Yokohama, Kanagawa 223-8522
4 shared publications
Latest Publications
- Open Access
- 15 October 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (10)
Effectiveness of Cardinality-Return Weighted Maximum Independent Set Approach for Financial Portfolio Optimization
Markowitz’s mean-variance model has fundamental limitations, including the assumption of normal return distributions and sensitivity to parameter estimation errors. To address these, we propose a novel graph-theoretic approach: the cardinality-return weighted maximum independent set (CR-WMIS) model. CR-WMIS integrates the risk diversification of the maximum independent set (MIS) model, selecting the largest number of weakly correlated stocks, with the expected return weighting of the weighted maximum independent set (WMIS) model. We validated the return and risk performance of this method through a five-year backtesting simulation (April 2019–March 2024) using S&P 500 data and a simulated-bifurcation-based solver. Importantly, we conducted a comprehensive risk assessment, a facet insufficiently explored in previous studies. Results demonstrate that CR-WMIS exhibits superior return and risk characteristics compared to conventional MIS, WMIS, and the S&P 500 index. This study provides a practical portfolio optimization method that overcomes the mean-variance model’s theoretical limitations, contributing to both academic theory and investment decision-making.
- 15 October 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (10)
Open AccessEffectiveness of Cardinality-Return Weighted Maximum Independent Set Approach for Financial Portfolio Optimization
Markowitz’s mean-variance model has fundamental limitations, including the assumption of normal return distributions and sensitivity to parameter estimation errors. To address these, we propose a novel graph-theoretic approach: the cardinality-return weighted maximum independent set (CR-WMIS) model. CR-WMIS integrates the risk diversification of the maximum independent set (MIS) model, selecting the largest number of weakly correlated stocks, with the expected return weighting of the weighted maximum independent set (WMIS) model. We validated the return and risk performance of this method through a five-year backtesting simulation (April 2019–March 2024) using S&P 500 data and a simulated-bifurcation-based solver. Importantly, we conducted a comprehensive risk assessment, a facet insufficiently explored in previous studies. Results demonstrate that CR-WMIS exhibits superior return and risk characteristics compared to conventional MIS, WMIS, and the S&P 500 index. This study provides a practical portfolio optimization method that overcomes the mean-variance model’s theoretical limitations, contributing to both academic theory and investment decision-making.
- 15 September 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (9)
Evaluating the Solution Performance of the Augmented Lagrangian Function on Ising Machines
We apply the augmented Lagrangian function (ALF) as a formulation for Ising machines and evaluate its performance by time-to-epsilon (TTε). The ALF has been well studied in continuous optimization for its numerical stability and convergence, and its advantage over the penalty function formulation is demonstrated here through the following results. Using the quadratic knapsack problem as a benchmark, we examine the dependence of TTε on the hyperparameters, namely the penalty coefficient μ and the Lagrange multiplier λ. The augmented Lagrangian formulation reduces TTε by roughly an order of magnitude compared with the penalty function formulation, keeping μ small while obtaining feasible solutions and, for representative parameter settings, reaching high-precision solutions earlier in the search. These findings indicate that the augmented Lagrangian function is a promising formulation for improving the solution performance of Ising machines.
- 15 September 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (9)
Evaluating the Solution Performance of the Augmented Lagrangian Function on Ising Machines
We apply the augmented Lagrangian function (ALF) as a formulation for Ising machines and evaluate its performance by time-to-epsilon (TTε). The ALF has been well studied in continuous optimization for its numerical stability and convergence, and its advantage over the penalty function formulation is demonstrated here through the following results. Using the quadratic knapsack problem as a benchmark, we examine the dependence of TTε on the hyperparameters, namely the penalty coefficient μ and the Lagrange multiplier λ. The augmented Lagrangian formulation reduces TTε by roughly an order of magnitude compared with the penalty function formulation, keeping μ small while obtaining feasible solutions and, for representative parameter settings, reaching high-precision solutions earlier in the search. These findings indicate that the augmented Lagrangian function is a promising formulation for improving the solution performance of Ising machines.
- Open Access
- 2 September 2026
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 127 (17) , e70414
Development of Hamiltonian for Structural Applications by Quantum Annealing Assuming Finite Element Method
Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers. Two formulations are compared: one derived from the stiffness equation and another from the minimum total potential energy. Benchmarks show the energy‐based QUBO matches finite‐element displacements and stresses more closely and avoids the rapid term‐count growth that slows the stiffness‐based form. The numerical demonstrations reported here include deformation analysis of a 100‐element plate model and topology optimization of cantilever beams discretized with up to 60 triangular elements or 32 rectangular elements. These examples are intended as proof‐of‐concept demonstrations under current hardware and encoding limitations rather than as large‐scale industrial benchmarks. Leveraging this model, a single QUBO embedding density variables–implemented with combinatorial random‐number sums and a quadratic volume penalty–yields two‐dimensional beam layouts that are quantitatively compared with those obtained using the classical Optimality Criteria (OC) method.
- 2 September 2026
- Published by Wiley in International Journal for Numerical Methods in Engineering
- Vol. 127 (17) , e70414
Open AccessDevelopment of Hamiltonian for Structural Applications by Quantum Annealing Assuming Finite Element Method
Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers. Two formulations are compared: one derived from the stiffness equation and another from the minimum total potential energy. Benchmarks show the energy‐based QUBO matches finite‐element displacements and stresses more closely and avoids the rapid term‐count growth that slows the stiffness‐based form. The numerical demonstrations reported here include deformation analysis of a 100‐element plate model and topology optimization of cantilever beams discretized with up to 60 triangular elements or 32 rectangular elements. These examples are intended as proof‐of‐concept demonstrations under current hardware and encoding limitations rather than as large‐scale industrial benchmarks. Leveraging this model, a single QUBO embedding density variables–implemented with combinatorial random‐number sums and a quadratic volume penalty–yields two‐dimensional beam layouts that are quantitatively compared with those obtained using the classical Optimality Criteria (OC) method.
- Open Access
- 31 August 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (2) , 022470
Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.
- 31 August 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (2) , 022470
Open AccessFrustration-enhanced quantum annealing correction models with additional inter-replica interactions
Quantum annealing correction (QAC) models provide a promising approach for mitigating errors in quantum annealers. Previous studies have established that QAC models are crucial for ensuring the robustness of the ground state of the Ising model on hardware. In this work, the effects of QAC models incorporating replicas with additional interactions, specifically, the and the , are investigated for problems characterized by a small energy gap between the ground and first excited states during quantum annealing, a well-known bottleneck to reaching the ground state. The results demonstrate that these QAC models can obtain the optimal solution within short annealing times by exploiting diabatic transitions, even for problems with a small energy gap. These findings highlight the potential of QAC models as practical near-term algorithms for hardware subject to runtime limitations and control noise.
- 15 August 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (8)
Fair Sampling with Temperature-Targeted QAOA Based on Quantum–Classical Correspondence Theory
- 15 August 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (8)
Fair Sampling with Temperature-Targeted QAOA Based on Quantum–Classical Correspondence Theory
- 15 July 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (7)
Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model
Error-mitigation methods for Ising machines are reexamined not merely as noise-suppression techniques but as a structural design problem of replica-coupled Ising models. Using simulated annealing a...
- 15 July 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (7)
Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model
Error-mitigation methods for Ising machines are reexamined not merely as noise-suppression techniques but as a structural design problem of replica-coupled Ising models. Using simulated annealing a...
- 15 June 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (6)
Factorization Machine from a Random Matrix Theory Perspective
Factorization Machine with Quadratic-optimization Annealing (FMQA) is a promising technique for solving black-box optimization problems efficiently. Recently, warm-starting FMQA has been proposed t...
- 15 June 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (6)
Factorization Machine from a Random Matrix Theory Perspective
Factorization Machine with Quadratic-optimization Annealing (FMQA) is a promising technique for solving black-box optimization problems efficiently. Recently, warm-starting FMQA has been proposed t...
- 15 May 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (5)
Utilizing Intermediate States in Quantum Annealing for Multi-objective Optimization
- 15 May 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (5)
Utilizing Intermediate States in Quantum Annealing for Multi-objective Optimization
- Open Access
- 14 April 2026
- Published by AIP Publishing in Applied Physics Reviews
- Vol. 13 (2)
Black-box optimization using factorization and Ising machines
Black-box optimization (BBO) is used in materials design, drug discovery, and hyperparameter tuning in machine learning. The world is experiencing several of these problems. In this review, a factorization machine with quantum annealing or with quadratic-optimization annealing (FMQA) algorithm to realize fast computations of BBO using Ising machines (IMs) is discussed. The FMQA algorithm uses a factorization machine (FM) as a surrogate model for BBO. The FM model can be directly transformed into a quadratic unconstrained binary optimization model that can be solved using IMs. This makes it possible to optimize the acquisition function in BBO, which is a difficult task using conventional methods without IMs. Consequently, it has the advantage of handling large BBO problems. To be able to perform BBO with the FMQA algorithm immediately, we introduce the FMQA algorithm along with Python packages to run it. In addition, we review examples of applications of the FMQA algorithm in various fields, including physics, chemistry, materials science, and social sciences. These successful examples include binary and integer optimization problems, as well as more general optimization problems involving graphs, networks, and strings, using a binary variational autoencoder. We believe that BBO using the FMQA algorithm will become a key technology in IMs, including quantum annealers.
- 14 April 2026
- Published by AIP Publishing in Applied Physics Reviews
- Vol. 13 (2)
Open AccessBlack-box optimization using factorization and Ising machines
Black-box optimization (BBO) is used in materials design, drug discovery, and hyperparameter tuning in machine learning. The world is experiencing several of these problems. In this review, a factorization machine with quantum annealing or with quadratic-optimization annealing (FMQA) algorithm to realize fast computations of BBO using Ising machines (IMs) is discussed. The FMQA algorithm uses a factorization machine (FM) as a surrogate model for BBO. The FM model can be directly transformed into a quadratic unconstrained binary optimization model that can be solved using IMs. This makes it possible to optimize the acquisition function in BBO, which is a difficult task using conventional methods without IMs. Consequently, it has the advantage of handling large BBO problems. To be able to perform BBO with the FMQA algorithm immediately, we introduce the FMQA algorithm along with Python packages to run it. In addition, we review examples of applications of the FMQA algorithm in various fields, including physics, chemistry, materials science, and social sciences. These successful examples include binary and integer optimization problems, as well as more general optimization problems involving graphs, networks, and strings, using a binary variational autoencoder. We believe that BBO using the FMQA algorithm will become a key technology in IMs, including quantum annealers.
- 15 March 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (3)
Quantitative Analysis of the Effectiveness of Mid-anneal Measurement in Quantum Annealing
- 15 March 2026
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 95 (3)
Quantitative Analysis of the Effectiveness of Mid-anneal Measurement in Quantum Annealing