Toshiba’s New Algorithms Quickly Deliver Highly Accurate Solutions to Complex Problems

Toshiba Corporation and Toshiba Digital Solutions Corporation, industry leaders in solutions for large-scale optimization problems, announced the Ballistic Simulated Bifurcation Algorithm and the Discrete Simulated Bifurcation Algorithm, new algorithms that far surpass the performance of Toshiba’s previous Simulated Bifurcation Algorithm.

Feb. 4, 2021 13:00 UTC
  • Breaks the limitations of classical mechanics by introducing a quasi-quantum effect
  • Expected to accelerate complex problem-solving in finance, pharmaceuticals and logistics.

TOKYO--(BUSINESS WIRE)-- Toshiba Corporation (TOKYO: 6502) and Toshiba Digital Solutions Corporation (collectively Toshiba), industry leaders in solutions for large-scale optimization problems, today announced the Ballistic Simulated Bifurcation Algorithm (bSB) and the Discrete Simulated Bifurcation Algorithm (dSB), new algorithms that far surpass the performance of Toshiba’s previous Simulated Bifurcation Algorithm (SB). The new algorithms will be applied to finding solutions to highly complex problems in areas as diverse as portfolio management, drug development and logistics management.

This press release features multimedia. View the full release here: https://www.businesswire.com/news/home/20210204005362/en/

Fig. 1: The bSBM is approximately 10x faster than the aSBM in solving a 2000-bit problem(*2). (Graphic: Business Wire)

Fig. 1: The bSBM is approximately 10x faster than the aSBM in solving a 2000-bit problem(*2). (Graphic: Business Wire)

Introduced in April 2019, the previous SB broke new ground as a platform for finding solutions to combinatorial optimization problems, surpassing other approaches by a factor of 10*1. Toshiba has now extended this achievement with two new algorithms that apply innovative approaches, such as a quasi-quantum tunneling effect, to performance improvement, allowing them to acquire optimal solutions (exact solutions) for large-scale combinatorial optimization problems that challenge the capabilities of their predecessor. Implemented on a 16-GPU machine, dSB can find a nearly optimal solution of a one-million-bit problem, the world’s largest scale combinatorial problem yet reported in scientific papers, in 30 minutes—a computation that would take 14 months on a typical CPU-based computer. The research results were published in the online academic journal, Science Advances, on February 3 (EST)*2.

The new algorithms have different characteristics. 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)*3, 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) (Figure 1).

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 (Figure 2).

Implemented on a 16-GPU machine, the dSBM solved a one-million-bit problem, the largest yet reported in scientific papers, and arrived at a nearly optimal solution in 30 minutes—20,000 times faster than a CPU-based simulated annealing machine, which would take 14 months to carry out the computation (Figure 3).

In applying the two algorithms to real-world problems, Toshiba proposes bSB for applications that require an immediate response, and dSB for applications that require high accuracy, even if it takes a little longer time.

Toshiba expects the new algorithms to bring higher efficiencies to industry, business and complex decision-making by addressing combinatorial optimization problems in fields including investment portfolios, drug development, and delivery route planning.

Commenting on the algorithms, Hayato Goto, Chief Research Scientist at Toshiba Corporation’s Corporate Research & Development Center, said: “We face many real-world problems where we must find the optimal solution among a huge number of choices, and we must also deal with combinatorial explosion, where the number of combination patterns increases exponentially as a problem increases in scale. This is why research into special-purpose computers for combinatorial optimization is being carried out worldwide. Our aim is to develop a software solution—algorithms that can solve large-scale combinatorial optimization problems quickly and accurately, and contribute to the realization of higher efficiencies.”

Toshiba will offer the newly developed simulated bifurcation algorithms as a GPU-based cloud service and as an on-premises version implemented on an FPGA within 2021.

(Notes)

*1

H. Goto, K. Tatsumura, A. R. Dixon, Science Advances 5, eaav2372 (2019). https://advances.sciencemag.org/content/5/4/eaav2372

*2

H. Goto et al., Science Advances Vol. 7, no. 6, eabe7953 (2021)

https://advances.sciencemag.org/content/7/6/eabe7953

*3

Adiabatic Simulated Bifurcation (aSB): uses the adiabatic process in classical mechanics as a principle*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).

About Toshiba Corporation

Toshiba Corporation leads a global group of companies that combines knowledge and capabilities from over 140 years of experience in a wide range of businesses—from energy and social infrastructure to electronic devices—with world-class capabilities in information processing, digital and AI technologies. These distinctive strengths support Toshiba’s continued evolution toward becoming an Infrastructure Services Company that promotes data utilization and digitization, and one of the world’s leading cyber-physical-systems technology companies. Guided by the Basic Commitment of the Toshiba Group, “Committed to People, Committed to the Future,” Toshiba contributes to society’s positive development with services and solutions that lead to a better world. The Group and its 130,000 employees worldwide secured annual sales surpassing 3.4 trillion yen (US$31.1 billion) in fiscal year 2019. www.toshiba.co.jp/worldwide/about/index.html

About Toshiba Digital Solutions Corporation

As the driver of Toshiba Group’s digital solutions business, Toshiba Digital Solutions Corporation delivers system integration and digital service solutions that support companies in accelerating their digital transformation, and also plays a central role in Toshiba’s transition to become one of the world’s leading cyber-physical technology companies, with advanced capabilities extending from manufacturing to AI. https://www.global.toshiba/ww/company/digitalsolution.html

Business website of Toshiba Simulated Bifurcation Machine: https://www.toshiba-sol.co.jp/en/pro/sbm/index.htm

View source version on businesswire.com: https://www.businesswire.com/news/home/20210204005362/en/

Contacts

Media Contact
KOBAYASHI Itaru
Corporate Communication Division, Toshiba Corporation
media.relations@toshiba.co.jp

Source: Toshiba

Smart Multimedia Gallery

Fig. 1: The bSBM is approximately 10x faster than the aSBM in solving a 2000-bit problem(*2). (Graphic: Business Wire)

Fig. 2: dSBM benchmarked against other machines for computation times to obtain optimal solutions for various problems(*2). (Graphic: Business Wire)

Figure 3: Computation times for a one-million-bit problem(*2). (Graphic: Business Wire)

Powered by Business Wire

View this news release and multimedia online at:
http://www.businesswire.com/news/home/20210204005362/en

MORE ON THIS TOPIC