Try Our SQBM+

What is SQBM+?

SQBM+ is a quantum-inspired optimization solution based on the Simulated Bifurcation Machine that is a combinatorial optimization solver utilizing the Simulated Bifurcation Algorithm developed by Toshiba Corporation.   > About SQBM+

With SQBM+, you can solve large-scale "combinatorial optimization problems" at high speed. SQBM+ can be implemented on general-purpose computers using GPUs and FPGAs, so you can now work on solving combinatorial optimization problems in various situations in society and industry.

The quantum-inspired is a new classical mechanical method derived from or directly inspired by a calculation method based on the principles of quantum mechanics. Also known as "pseudo-quantum".

SQBM is an acronym for “Simulated Quantum-inspired Bifurcation Machine”, which means that it is derived from the Simulated Bifurcation Machine (SBM) that implement the Simulation Bifurcation Algorithm (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.

A combinatorial optimization problem is a problem for finding the best combination among an exponential number of candidates. With an increase in the problem size, i.e., the number of combinations in total, it is practically impossible to exhaustively test every combination and arrive at a good solution, which is one of the limitations of traditional computing.　＞What is a combinatorial optimization problem?

Combinatorial optimization problems exist in various fields in society and industry, such as financial transactions, industrial robots, transportation routes, and power transmission routes. In addition, even problems that do not seem to be combinatorial optimization problems, such as molecular design for drug discovery, can sometimes be settled into combinatorial optimization problems. Combinatorial optimization problems are difficult to solve at high speed with computers because the number of combination patterns increases exponentially as the scale of the problem increases. Evolving quantum technology has made it possible to solve combinatorial optimization problems at high speed, so it is being investigated in various fields.

You can use SQBM+ for research and development in various fields in society and industry. You can use the license for R&D use. Try it before commercial use. You can also use the PoC edition. We are also looking for companies that can co-create new businesses using SQBM+ as partners, so please contact us. 　＞ Contact us

Yes. The Learn & Development Plan (Hourly with Free Trial) of SQBM+ for AWS can run exactly one instance of the software without incurring a charge. A PoC (proof of concept) edition is also available for free on the AWS Marketplace. Please try our SQBM+.　＞ Try our SQBM+

An AWS subscription is required to use SQBM+ on the cloud. For on-premise environments, please contact us.

SQBM+ is provided software modules for the cloud environments and for the on-premise environments. Furthermore, we will provide professional services such as education and support for formulation.

Two SQBM+ for AWS plans are available: Learn & Development is limited to use for familiarization; Business Standard is designed to support business operations. Both plans have hourly and monthly pricing models. > SQBM+ for AWS pricing
Please contact us for software modules for the on-premise environments pricing.

You develop using the SQBM+ API. First, you define a combinatorial optimization problem in a mathematical model. The application program generates matrix data according to the mathematical model and sends the matrix data to SQBM+ according to the SQBM+ API to calculate the best solution.

Partner licenses are available to provide end users with value-added services using SQBM+. Please contact us for details.

It is often due to how the Ising model is formulated; please go back to see if this is the case. 

Currently, we do not offer any consulting services regarding the Ising model. Contact other experts in the field.

That is because processing did not complete within the time specified by MaxWait. Consider adjusting the MaxWait timeout value.

SQBM+ offers you purpose-specific solvers (TSP solver, SHIFT solver) in addition to the general-purpose Ising solver. Specific problems can be solved directly and easily by the purpose-specific solvers.

The Ising slover is a solver for quadratic unconstrained binary optimization problems based on the Ising model (a model in statistical mechanics that explains the magnetization behavior of a magnetic material by a lattice of spinning atoms).

The TSP solver is a solver that can directly solve a type of problem called "traveling salesman problem" without expressing it in QUBO.

The SHIFT solver is a solver that can directly solve shift scheduling problems such as assigning daily jobs to employees under various constraints without using QUBO.

QP solver is 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.

“SQBM+ Cloud on Azure Quantum” is a cloud service of SQBM+ for Azure Quantum, a full-stack open cloud quantum computing ecosystem published by Microsoft Corporation.
Azure Quantum brings together the most innovative quantum computing and optimization solutions into a single cloud service. SQBM+ is positioned as one of the optimization solutions provided by Azure Quantum.

"SQBM+ Cloud on Azure Quantum" is a pay-as-you-go billing according to the calculation time. You will be billed according to your computing time.

The Adiabatic Simulated Bifurcation (aSB) uses the adiabatic process in classical mechanics as a principle(Note 1). The adiabatic process is a phenomenon that continues to stay in a low-energy state when the parameters of the system change slowly in a dynamic system. A computer implementing an aSB is an adiabatic Simulated Bifurcation Machine (aSBM).

(Note 1) H. Goto, K. Tatsumura, A. R. Dixon, Science Advances 5, eaav2372 (2019).
https://advances.sciencemag.org/content/5/4/eaav2372 (American Association for the Advancement of Science.)

The Ballistic Simulated Bifurcation Algorithm ( bSB) is optimized and named for speed of operation, and finds good approximate solutions in a short time. It generates fewer errors than a previously reported Adiabatic Simulated Bifurcation Algorithm (aSB), and so returns faster, more accurate results. Implemented on a field programmable gate array (FPGA), dubbed the ballistic simulated bifurcation machine (bSBM), it obtains a good solution to a 2,000-bit problem approximately 10 times faster than the previous aSB machine (aSBM) .

The Discrete Simulated Bifurcation Algorithm (dSB) is a high-accuracy algorithm. Although implemented in a classical computer, it nonetheless arrives at optimal solutions faster than current quantum machines. Its name is derived from the replacement of continuous variables with discrete variables in equations of motion. This exhibits a quasi-quantum tunneling effect that breaks through the limits of approaches grounded in classical mechanics, reaching the optimal solution of the 2000-bit problem. Toshiba has implemented dSB on a FPGA and built a discrete simulated bifurcation machine (dSBM) that achieves a higher speed than other machines in terms of computation times required to obtain optimal solutions for various problems.