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