HIGHLIGHTS
- who: Yunuo Cen from the DepartmentNational University have published the paper: A tree search algorithm towards solving Ising formulated combinatorial optimization problems, in the Journal: Scientific Reports Scientific Reports
- what: The authors demonstrate that CITS tradeoffs an acceptable spatial complexity to accelerate the search to find better solutions to MAX-CUT problems (as compared to SA or CIM) with graph sizes ranging from 36 nodes to 230 nodes. In Fig 3b, the authors show the time evolution of amplitudes corresponding to the 10-by-10 square lattice graph (Fig 3a) of the two exploration schemes . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.