SQBM+ is a quantum-inspired optimization solution based on the Simulated Bifurcation Machine (SBM) that is a combinatorial optimization solver utilizing the Simulated Bifurcation Algorithm (SB Algorithm) developed by Toshiba Corporation. We offer a lineup of optimization solvers according to the intended application, and have adopted a new SB Algorithm that greatly improves speed, accuracy, and scale.

For many social and industrial challenges, combinatorial optimization is essential for selecting the optimal items from an enormous range of choices; for example, optimizing financial transactions, the movement of industrial robots, travel and transmission routes, and molecular design for drug discovery. When using existing computers, combinatorial optimization is difficult to solve at high speeds because the number of combination patterns increases exponentially as the scale of the problem grows. For this reason, specialized combinatorial optimization computers are being actively developed in Japan and overseas.
Toshiba Group is verifying the effectiveness of SBM. For example, we are starting joint verification for the effectiveness of applying pseudo-quantum computers to high-speed and high-frequency trading in the stock market. This solution uses existing computers and utilizes SBM, which enables high-precision approximate solutions (good solutions) for complex and large-scale problems to be obtained in a short time. Additionally, the PoC (Proof-of-Concept) version of SBM was released to the world on the AWS Marketplace operated by Amazon Web Services Inc. We have been searching for real problems in order to solve social issues in a variety of fields by cooperating with research institutions such as universities, as well as with corporations aiming to solve social issues as actual problems in combinatorial optimization . We provide systematized SQBM+ as a solution by utilizing the results of business co-creation efforts aimed at developing new markets and creating new solutions by using SBM technology, as well as the knowledge gained through various verification experiments in Japan and overseas. SQBM is an acronym for “Simulated Quantum-inspired Bifurcation Machine,” which means that it is derived from SBM that implement the SB Algorithm invented in the research process for quantum computers at Toshiba's R&D centers. The “+” indicates that this solution includes various services and indicates our intention to continuously strengthen the solution.

we provide cloud services for SQBM+ in Azure Quantum, which is a full-stack public cloud ecosystem for quantum solutions published by Microsoft Corporation, and execution modules on the current AWS Marketplace. We also plan to provide on-premise versions for highly-confidential applications not suitable for cloud environments and applications that require ultra-low latency, and to embed those versions in partner applications or provide them on an OEM basis. Furthermore, we will provide professional services such as education and support for formulation.

Toshiba’s original Ising machine: Fast, Large-scale, Available Now

Quantum inspired algorithm

Totally new algorithm derived from the research of Toshiba’s quantum computer “quantum bifurcation machine”
Utilizes the new method of classical adiabatic exploration and ergodic exploration

Fast and Large-scale
- Published in “Science Advances”

Available Now

Features of SQBM+

Adopts a new algorithm that significantly improves speed, accuracy, and scale

lBallistic Simulated Bifurcation Algorithm (bSB): A high-speed algorithm for finding a good solution in a short time.
lDiscrete Simulated Bifurcation Algorithm (dSB): A high-accuracy algorithm for finding more accurate solutions at a calculation speed that surpasses that of other machines.
lIncludes a function that automatically selects and uses one of the two algorithms listed above.

Provides optimization solvers according to the intended application

In addition to an Ising solver that can be used for general purposes, we also provide solvers for specific purposes. This makes it possible to easily and directly solve specific problems.

Ising solver
lA general-purpose solver. This is the basic solver of SQBM+ which uses the SB Algorithm to solve combinatorial optimization problems expressed in the format of quadratic unconstrained binary optimization (QUBO).
TSP solver
lA solver that can directly solve a type of problem called the traveling salesman problem without expressing it in QUBO.
SHIFT solver
A solver that can directly solve shift scheduling problems such as assigning daily jobs to employees under various constraints without using QUBO.

Expansion of application range

We provide extended functions and solvers which make the Ising solver easier to use and to improve its performance.

Parameter automatic adjustment function/solver
Automates the tuning of unique SBM parameters and quickly finds better solutions without the hassle of manual adjustment. There is an automatic adjustment function for each parameter and an Ising solver that eliminates the need to adjust any of the parameters.
QP solver
A solver that can directly solve quadratic binary optimization problems with linear constraints. Compared to solving similar problems with the Ising solver, there is no need to incorporate linear constraints into QUBO and adjust penalty parameters, thus making it easier to obtain highly-accurate solutions.
Enabling high-order terms and continuous variables
Real-life combinatorial optimization problems may contain cubic or higher terms and continuous variables. Solving such problems with the Ising solver requires conversion to quadratic expressions and binary variables, which is a factor in degrading the equation solution performance. SQBM+ will utilize the features of the SB Algorithm to support these higher-order terms and continuous variables, and to achieve higher solution performance for real-life combinatorial optimization problems.