High-performance combinatorial optimization based on classical mechanics.

Area of Science:

• Computational Science
• Physics
• Computer Science

Background:

• Combinatorial optimization problems are crucial but computationally challenging.
• Specialized hardware for optimization is an active research area.
• Existing methods like quantum annealers and coherent Ising machines show promise but have limitations.

Purpose of the Study:

• To develop a high-performance algorithm for solving large-scale combinatorial optimization problems.
• To enhance existing optimization algorithms using principles of classical mechanics.
• To demonstrate superior performance compared to current state-of-the-art optimization machines.

Main Methods:

• Modification of the simulated bifurcation algorithm using classical mechanics.
• Implementation leveraging massively parallel computing.
• Benchmarking against quantum annealers, coherent Ising machines, and digital processors.

Main Results:

• The proposed classical mechanics algorithm achieves high speed through parallelization.
• The algorithm demonstrates high solution accuracy for problems with up to one million binary variables.
• The developed machine significantly outperforms existing quantum and digital optimization hardware.

Conclusions:

• Massively parallel implementation of the classical mechanics algorithm offers a high-performance solution for combinatorial optimization.
• This approach provides a viable and efficient alternative to quantum computing for certain optimization tasks.
• The algorithm represents a significant advancement in specialized hardware for complex computational problems.