JWJuntao Wang

Juntao Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Juntao Wang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimality and annealing path planning of dynamical analog solvers

    by Shu Zhou, K. Y. Michael Wong, Juntao Wang, David Shui Wing Hui, Daniel Ebler, Jie Sun

    Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground-state energy of the Sherrington-Kirkpatrick (SK) model of spin glasses and identify mechanisms that enable rapid convergence to provably near-optimal energies. For a fixed target energy density E c , we show that solutions are typically reached within O ( 1 ) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the coherent Ising machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground-state energy of the SK model.

  • Open Access

    Phase analysis of Ising machines and their implications on optimization

    by Shu Zhou, K. Y. Michael Wong, Juntao Wang, David Shui Wing Hui, Daniel Ebler, Jie Sun

    Ising machines, which are dynamical systems designed to operate in a parallel and iterative manner, have emerged as a paradigm for solving combinatorial optimization problems. Despite computational advantages, the quality of solutions depends heavily on the form of dynamics and tuning of parameters, which are, in general, set heuristically due to the lack of systematic insights. Here, we focus on optimal Ising machine design by analyzing phase diagrams of spin distributions in the Sherrington-Kirkpatrick model. We find that the ground state can be achieved in the phase where the spin distribution becomes binary, and optimal solutions are produced where the binary phase and gapless phase coexist. Our analysis shows that such coexistence phase region can be expanded by carefully placing a digitization operation, giving rise to a family of superior Ising machines, as illustrated by the proposed algorithm digCIM.


  • Open Access

    Bifurcation behaviors shape how continuous physical dynamics solves discrete Ising optimization

    by Juntao Wang, Daniel Ebler, K. Y. Michael Wong, David Shui Wing Hui, Jie Sun

    Simulating physical dynamics to solve hard combinatorial optimization has proven effective for medium- to large-scale problems. The dynamics of such systems is continuous, with no guarantee of finding optimal solutions of the original discrete problem. We investigate the open question of when simulated physical solvers solve discrete optimizations correctly, with a focus on coherent Ising machines (CIMs). Having established the existence of an exact mapping between CIM dynamics and discrete Ising optimization, we report two fundamentally distinct bifurcation behaviors of the Ising dynamics at the first bifurcation point: either all nodal states simultaneously deviate from zero (synchronized bifurcation) or undergo a cascade of such deviations (retarded bifurcation). For synchronized bifurcation, we prove that when the nodal states are uniformly bounded away from the origin, they contain sufficient information for exactly solving the Ising problem. When the exact mapping conditions are violated, subsequent bifurcations become necessary and often cause slow convergence. Inspired by those findings, we devise a trapping-and-correction (TAC) technique to accelerate dynamics-based Ising solvers, including CIMs and simulated bifurcation. TAC takes advantage of early bifurcated “trapped nodes” which maintain their sign throughout the Ising dynamics to reduce computation time effectively. Using problem instances from open benchmark and random Ising models, we validate the superior convergence and accuracy of TAC.


  • Spin Model of Two Random Walkers in Complex Networks

    by Wenshuo Guo, Juntao Wang, Kwok Yip Szeto


  • Open Access

    Optimization of financial network stability by genetic algorithm

    by Juntao Wang, Wenshuo Guo, Kwok Yip Szeto

    Directed network with flow dynamics is an important topic in realistic complex systems such as banking systems. We study the stability of these financial networks using a homogeneous and a more general inhomogeneous model. The nodes of the networks are banks and they are under four different kinds of disturbance that may lead to bankruptcy, which is defined by the condition that the capital value of the bank is below a critical value, such as zero. The stability of this network is measured by the minimum value of capital of the nodes after a fixed time of money flow in the network. The smaller the minimum value, the higher the probability of the first bankruptcy. By means of genetic algorithm with networks as the chromosome, the edges between nodes as genes, we can perform evolutionary computation using rewiring of edges as the genetic operators to search for a network topology with high stability. Our analytical results on flow dynamics are based on the linear relation between net change and PageRank centrality under small damping factor. Our numerical analysis shows that genetic algorithm can be very efficient in finding network with given connectivity that is stable against four categories of disturbance, namely under internal (and external) perturbation that is cumulative or noncumulative. Our results show that a banking network with each bank with similar relative wealth (thus small Gini coefficient in wealth distribution) is more stable than one with highly unequal wealth distribution. We also find our optimization method works for delaying the second bankruptcy after the first. These results may be useful in practical applications for the prevention of the first failure, as well as cascade failures in real complex systems.