Role of magnetic skyrmions for the solution of the shortest path problem

TL;DR

This paper explores the use of magnetic skyrmions in solving the shortest path problem, demonstrating their potential for optimization and self-reinforcement in neuromorphic computing applications.

Contribution

It introduces a novel approach utilizing skyrmions to solve shortest path problems, aligning physical properties with computational optimization.

Findings

Skyrmions can find shortest paths with the same length as traditional algorithms.

Skyrmions exhibit positive feedback, reinforcing optimal paths.

Potential for skyrmion-based neuromorphic computing applications.

Abstract

Magnetic skyrmions are emerging as key elements of unconventional operations having unique properties such as small size and low current manipulation. In particular, it is possible to design skyrmion-based neurons and synapses for neuromorphic computing in devices where skyrmions move along the current direction (zero skyrmion Hall angle). Here, we show that, for a given graph, skyrmions can be used in optimization problems facing the calculation of the shortest path. Our tests show a solution with the same path length as computed with Algorithm. In addition, we also discuss how skyrmions act as positive feedback on this type of problem giving rise to a self-reinforcement of the path which is a possible solution.