E-Mail IMAGE: The bSBM is approximately10x faster than the aSBM in solving a 2000-bit problem*2. view more Credit: Toshiba Corporation TOKYO --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. 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,