Masaya Yamasaki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Masaya Yamasaki has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Kosuke Tatsumura
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
9 shared publications - Tomoya Kashimata
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
5 shared publications - Hayato Goto
RIKEN Center for Quantum Computing (RQC), Wako, Saitama 351-0198, Japan
3 shared publications - Ryo Hidaka
Corporate Research and Development Center, Toshiba Corporation, Kawasaki, Japan
3 shared publications - Yohei Hamakawa
Corporate Laboratory, Toshiba Corporation, Kawasaki, Japan
3 shared publications - Jun Nakayama
Corporate Research and Development Center, Toshiba Corporation, Kawasaki, Japan
2 shared publications
Latest Publications
- Open Access
- 3 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8085
Real-time black-box optimization for dynamic discrete environments using embedded Ising machines
Many real-time systems require the optimization of discrete variables. Black-box optimization (BBO) algorithms and multi-armed bandit (MAB) algorithms perform optimization by repeatedly taking actions and observing the corresponding immediate rewards without any prior knowledge. Recently, a BBO method using an Ising machine has been proposed to find the best action represented by a combination of discrete values and maximize the immediate reward in static environments. By contrast, real-time systems operate in dynamic environments and necessitate MAB algorithms that maximize the average reward over repeated trials. Due to the enormous number of actions resulting from the combinatorial nature of discrete optimization, conventional MAB algorithms cannot effectively optimize actions for dynamic, discrete environments. Here, we show a heuristic method to maximize the average reward for dynamic discrete environments by extending the BBO method, in which an Ising machine efficiently explores actions while accounting for interactions between variables and environmental changes. We demonstrate the adaptability to dynamic environments of the proposed method in a wireless communication system with moving users.
- 3 September 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8085
Open AccessReal-time black-box optimization for dynamic discrete environments using embedded Ising machines
Many real-time systems require the optimization of discrete variables. Black-box optimization (BBO) algorithms and multi-armed bandit (MAB) algorithms perform optimization by repeatedly taking actions and observing the corresponding immediate rewards without any prior knowledge. Recently, a BBO method using an Ising machine has been proposed to find the best action represented by a combination of discrete values and maximize the immediate reward in static environments. By contrast, real-time systems operate in dynamic environments and necessitate MAB algorithms that maximize the average reward over repeated trials. Due to the enormous number of actions resulting from the combinatorial nature of discrete optimization, conventional MAB algorithms cannot effectively optimize actions for dynamic, discrete environments. Here, we show a heuristic method to maximize the average reward for dynamic discrete environments by extending the BBO method, in which an Ising machine efficiently explores actions while accounting for interactions between variables and environmental changes. We demonstrate the adaptability to dynamic environments of the proposed method in a wireless communication system with moving users.
- Open Access
- 16 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 4877
Machine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods.
- 16 June 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 4877
Open AccessMachine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems
Quantum or quantum-inspired Ising machines have recently shown promise in solving combinatorial optimization problems in a short time. Real-world and practical applications, such as time division multiple access (TDMA) scheduling for wireless multi-hop networks, financial trading, and emerging in-vehicle systems, require solving those problems sequentially where the size and characteristics change dynamically. However, using Ising machines for practical deployment involves challenges to shorten system-wide latency due to the transfer of large Ising model or the cloud access and to determine the parameters for each problem. Here we show a combinatorial optimization method using embedded Ising machines, which enables solving diverse problems at high speed without runtime parameter tuning. We customize the algorithm and circuit architecture of the simulated bifurcation-based Ising machine to compress the Ising model and accelerate computation and then build a machine learning model to estimate appropriate parameters using extensive training data. In TDMA scheduling for wireless multi-hop networks, our demonstration shows that the sophisticated system can adapt to changes in the problem and has a speed advantage over conventional methods.
- Open Access
- 17 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Enhancing vehicle-mountable multiple object tracking systems with embeddable Ising machines
The cognitive function of tracking multiple objects, essential for autonomous mobile vehicles or autonomous robots, involves object detection and their temporal associations. While significant progress has recently been made in machine learning to elaborate the similarity matrix between the objects that have been recognized and the objects detected in the current video frame, less progress has been made on the assignment problem that ultimately determines temporal associations, which is a combinatorial optimization problem. Here we show a vehicle-mountable multiple object tracking system with a flexible assignment function for tracking through multiple long-term occlusion events. To solve the flexible assignment problem, formulated as a nondeterministic polynomial-time hard problem, the system relies on an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. Using a vehicle-mountable computing platform, we demonstrate real-time system-wide throughput of more than 20 frames per second with the enhanced functionality.
- 17 December 2025
- Published by Springer Nature in Nature Communications
- Vol. 17 (1)
Open AccessEnhancing vehicle-mountable multiple object tracking systems with embeddable Ising machines
The cognitive function of tracking multiple objects, essential for autonomous mobile vehicles or autonomous robots, involves object detection and their temporal associations. While significant progress has recently been made in machine learning to elaborate the similarity matrix between the objects that have been recognized and the objects detected in the current video frame, less progress has been made on the assignment problem that ultimately determines temporal associations, which is a combinatorial optimization problem. Here we show a vehicle-mountable multiple object tracking system with a flexible assignment function for tracking through multiple long-term occlusion events. To solve the flexible assignment problem, formulated as a nondeterministic polynomial-time hard problem, the system relies on an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. Using a vehicle-mountable computing platform, we demonstrate real-time system-wide throughput of more than 20 frames per second with the enhanced functionality.
- Open Access
- 5 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 36606-36621
Efficient and Scalable Architecture for Multiple-Chip Implementation of Simulated Bifurcation Machines
Ising machines are specialized computers for finding the lowest energy states of Ising spin models, onto which many practical combinatorial optimization problems can be mapped. Simulated bifurcation (SB) is a quantum-inspired parallelizable algorithm for Ising problems that enables scalable multi-chip implementations of Ising machines. However, the computational performance of a previously proposed multi-chip architecture tends to saturate as the number of chips increases for a given problem size because computation and communication are exclusive in the time domain. In this paper, we propose a streaming architecture for multi-chip implementations of SB-based Ising machines with full spin-to-spin connectivity. The data flow in in-chip computation is harmonized with the data flow in inter-chip communication, enabling the computation and communication to overlap and the communication time to be hidden. Systematic experiments demonstrate linear strong scaling of performance up to the vicinity of the ideal communication limit determined only by the latency of chip-to-chip communication. Our eight-FPGA (field-programmable gate array) cluster can compute a 32,768-spin problem with a high pipeline efficiency of 97.9%. The performance of a 79-FPGA cluster for a 100,000-spin problem, projected using a theoretical performance model validated on smaller experimental clusters, is comparable to that of a state-of-the-art 100,000-spin optical Ising machine.
- 5 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 36606-36621
Open AccessEfficient and Scalable Architecture for Multiple-Chip Implementation of Simulated Bifurcation Machines
Ising machines are specialized computers for finding the lowest energy states of Ising spin models, onto which many practical combinatorial optimization problems can be mapped. Simulated bifurcation (SB) is a quantum-inspired parallelizable algorithm for Ising problems that enables scalable multi-chip implementations of Ising machines. However, the computational performance of a previously proposed multi-chip architecture tends to saturate as the number of chips increases for a given problem size because computation and communication are exclusive in the time domain. In this paper, we propose a streaming architecture for multi-chip implementations of SB-based Ising machines with full spin-to-spin connectivity. The data flow in in-chip computation is harmonized with the data flow in inter-chip communication, enabling the computation and communication to overlap and the communication time to be hidden. Systematic experiments demonstrate linear strong scaling of performance up to the vicinity of the ideal communication limit determined only by the latency of chip-to-chip communication. Our eight-FPGA (field-programmable gate array) cluster can compute a 32,768-spin problem with a high pipeline efficiency of 97.9%. The performance of a 79-FPGA cluster for a 100,000-spin problem, projected using a theoretical performance model validated on smaller experimental clusters, is comparable to that of a state-of-the-art 100,000-spin optical Ising machine.
- Open Access
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 120023-120033
Real-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization
Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory. Ising machines are hardware devices that work in quantum-mechanical/quantum-inspired principles for quickly solving NP-hard optimization problems, which potentially enable making trading decisions based on NP-hard optimization in the time constraints for high-speed trading strategies. Here we report a real-time stock trading system that determines long(buying)/short(selling) positions through NP-hard portfolio optimization for improving the Sharpe ratio using an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. The Ising machine selects a balanced (delta-neutral) group of stocks from an N -stock universe according to an objective function involving maximizing instantaneous expected returns defined as deviations from volume-weighted average prices and minimizing the summation of statistical correlation factors (for diversification). It has been demonstrated in the Tokyo Stock Exchange that the trading strategy based on NP-hard portfolio optimization for N =128 is executable with the FPGA (field-programmable gate array)-based trading system with a response latency of 164 μs.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 120023-120033
Open AccessReal-Time Trading System Based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-Hard Combinatorial Optimization
Financial portfolio construction problems are often formulated as quadratic and discrete (combinatorial) optimization that belong to the nondeterministic polynomial time (NP)-hard class in computational complexity theory. Ising machines are hardware devices that work in quantum-mechanical/quantum-inspired principles for quickly solving NP-hard optimization problems, which potentially enable making trading decisions based on NP-hard optimization in the time constraints for high-speed trading strategies. Here we report a real-time stock trading system that determines long(buying)/short(selling) positions through NP-hard portfolio optimization for improving the Sharpe ratio using an embedded Ising machine based on a quantum-inspired algorithm called simulated bifurcation. The Ising machine selects a balanced (delta-neutral) group of stocks from an N -stock universe according to an objective function involving maximizing instantaneous expected returns defined as deviations from volume-weighted average prices and minimizing the summation of statistical correlation factors (for diversification). It has been demonstrated in the Tokyo Stock Exchange that the trading strategy based on NP-hard portfolio optimization for N =128 is executable with the FPGA (field-programmable gate array)-based trading system with a response latency of 164 μs.
- Open Access
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 104406-104416
Pairs-Trading System Using Quantum-Inspired Combinatorial Optimization Accelerator for Optimal Path Search in Market Graphs
Pairs-trading is a trading strategy that involves matching a long position with a short position in two stocks aiming at market-neutral profits. While a typical pairs-trading system monitors the prices of two statistically correlated stocks for detecting a temporary divergence, monitoring and analyzing the prices of more stocks would potentially lead to finding more trading opportunities. Here we report a stock pairs-trading system that finds trading opportunities for any two stocks in an N -stock universe using a combinatorial optimization accelerator based on a quantum-inspired algorithm called simulated bifurcation. The trading opportunities are detected through solving an optimal path search problem in an N -node directed graph with edge weights corresponding to the products of instantaneous price differences and statistical correlation factors between two stocks. The accelerator is one of Ising machines and operates consecutively to find multiple opportunities in a market situation with avoiding duplicate detections by a tabu search technique. It has been demonstrated in the Tokyo Stock Exchange that the FPGA (field-programmable gate array)-based trading system has a sufficiently low latency (33 μs for N =15 or 210 pairs) to execute the pairs-trading strategy based on optimal path search in market graphs.
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 104406-104416
Open AccessPairs-Trading System Using Quantum-Inspired Combinatorial Optimization Accelerator for Optimal Path Search in Market Graphs
Pairs-trading is a trading strategy that involves matching a long position with a short position in two stocks aiming at market-neutral profits. While a typical pairs-trading system monitors the prices of two statistically correlated stocks for detecting a temporary divergence, monitoring and analyzing the prices of more stocks would potentially lead to finding more trading opportunities. Here we report a stock pairs-trading system that finds trading opportunities for any two stocks in an N -stock universe using a combinatorial optimization accelerator based on a quantum-inspired algorithm called simulated bifurcation. The trading opportunities are detected through solving an optimal path search problem in an N -node directed graph with edge weights corresponding to the products of instantaneous price differences and statistical correlation factors between two stocks. The accelerator is one of Ising machines and operates consecutively to find multiple opportunities in a market situation with avoiding duplicate detections by a tabu search technique. It has been demonstrated in the Tokyo Stock Exchange that the FPGA (field-programmable gate array)-based trading system has a sufficiently low latency (33 μs for N =15 or 210 pairs) to execute the pairs-trading strategy based on optimal path search in market graphs.
- 27 July 2021
- Published by Springer Nature in Nature Electronics
- Vol. 4 (8) , 625
Author Correction: Scaling out Ising machines using a multi-chip architecture for simulated bifurcation
- 27 July 2021
- Published by Springer Nature in Nature Electronics
- Vol. 4 (8) , 625
Author Correction: Scaling out Ising machines using a multi-chip architecture for simulated bifurcation
- Top Cited Papers
- 1 March 2021
- Published by Springer Nature in Nature Electronics
- Vol. 4 (3) , 208-217
Scaling out Ising machines using a multi-chip architecture for simulated bifurcation
- 1 March 2021
- Published by Springer Nature in Nature Electronics
- Vol. 4 (3) , 208-217
Top Cited PapersScaling out Ising machines using a multi-chip architecture for simulated bifurcation
- Top Cited PapersOpen Access
- 5 February 2021
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 7 (6) , eabe7953
High-performance combinatorial optimization based on classical mechanics
Massively parallel implementations of algorithms based on classical mechanics realize high-performance combinatorial optimization.
- 5 February 2021
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 7 (6) , eabe7953
Top Cited PapersOpen AccessHigh-performance combinatorial optimization based on classical mechanics
Massively parallel implementations of algorithms based on classical mechanics realize high-performance combinatorial optimization.