Ising machines are promising for solving NP-hard problems, but current implementations have power consumption and scalability challenges. Si et al. implement an Ising machine consisting of 80 superparamagnetic tunnel junctions with all-to-all connections and apply it to a large-scale travelling salesman problem.
- Jia Si
- Shuhan Yang
- Hyunsoo Yang
