.png){kind=icon}
.png){kind=icon}
Return
Complex complex landscapes
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.3.023064.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the saddle points of the p-spin model-the best understood example of a complex (rugged) landscape-when its N variables are complex. These points are the solutions to a system of N random equations of degree p - 1. We solve for (N) over bar, the number of solutions averaged over randomness in the N -> infinity limit. We find that it saturates the Bezout bound ln (N) over bar similar to N ln (p - 1) The Hessian of each saddle is given by a random matrix of the form C+C, where C is a complex symmetric Gaussian matrix with a shift to its diagonal. Its spectrum has a transition where a gap develops that generalizes the notion of threshold level well known in the real problem. The results from the real problem are recovered in the limit of real parameters. In this case, only the square root of the total number of solutions are real. In terms of the complex energy, the solutions are divided into sectors where the saddles have different topological properties.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.