Recently, Toshiba announced an algorithm inspired by quantum computers. According to Toshiba, this new algorithm allows ordinary computers to achieve computational speed superior to similar algorithms being applied on supercomputers.
This new algorithm is called “Branching Simulation Algorithm,” created by researcher Goto Hayato at Toshiba. According to Hayato, during the research, he realized that the properties of some complex computing systems changed after adjusting the input, leading to branching. As a result, he was able to create an optimal algorithm to filter out the branches that could return true results, helping to minimize the resources that computers need to use.
This idea was invented by Goto Hayato in 2015, but it took him two years to find an algorithm that could select the optimal possibilities between the many possible cases. This optimal algorithm is inspired by the way quantum computers work, but can completely run on ordinary computers.
In addition, Mr. Hayato also cooperated with another researcher, Tatsumura Kosuke, to apply this algorithm to computer assemblies and FPGA integrated circuit assemblies. Specifically, when operating on an FPGA cluster, Toshiba’s new algorithm can solve a complex optimization problem 10 times faster than a laser quantum computer.
At the present time, when quantum computers are not strong enough and not yet widely applicable, Toshiba is expected to provide new algorithms for financial and securities trading companies, as well as large scale manufacturing companies. Toshiba believes that this algorithm will be of great help in solving problems associated with optimizing combinations, at a higher speed and at a much cheaper cost.
According to tomshardware