The story begins with Cordeschi’s original insight, which Gagliardi revisits and reinterprets. In the 1930s and 1940s, researchers in the emerging behavioral sciences began constructing machines—mechanical and, later, electronic artifacts—that could reproduce intelligent and adaptive behavior. These were not merely engineering curiosities. They functioned as scientific models: ways of testing hypotheses about how minds and nervous systems might work. Kenneth Craik’s 1943 proposal that organisms carry internal models of external reality, Warren McCulloch and Walter Pitts’s 1943 logical calculus of neural activity, and the later cybernetic machines of Norbert Wiener’s circle all exemplified what came to be known as the “Synthetic Method.” Rather than analyzing a natural system into its components and deriving its behavior from first principles, the synthetic method proceeds in the opposite direction: it assembles an artifact from simple parts and observes whether the target behavior emerges.

Gagliardi’s central move is to pair this familiar narrative with a less obvious one from physics. In 1920, Wilhelm Lenz proposed a radically simplified model of ferromagnetism, and his student Ernst Ising worked out its properties in 1925. The Lenz–Ising model represents a magnetic material as a lattice of spins, each of which can point up or down and interacts only with its nearest neighbors. Nothing about the model resembles a real magnet in its fine detail. Yet this deliberately crude artifact turned out to capture something essential about how collective phenomena—phase transitions, critical points, cooperative behavior—arise from local interactions. Gagliardi argues that the introduction of the Ising model in the 1920s represents a methodological turning point in the physical sciences directly analogous to the one occurring at the same time in the behavioral sciences: the embrace of artificial, simulative models as legitimate instruments of scientific understanding.

Why did both fields converge on this strategy? Gagliardi’s answer lies in the mathematics of complexity. In the kinetic theory of gases, the nineteenth-century triumph of Ludwig Boltzmann and James Clerk Maxwell, it was possible to move analytically from the microscopic behavior of particles to macroscopic laws: the model could be solved in closed form, yielding the ideal gas law. But the Ising model resists such treatment. It has been formally proven, in work by Sorin Istrail published in 2000, that computing the ground state of the Ising model is computationally intractable—an NP-hard problem. Assuming the widely held conjecture that P does not equal NP, no closed-form analytical solution exists except in trivial cases. The same wall of intractability confronts cognitive modelers: Paul Thagard and Kevin Verbeurgt showed in 1998 that a connectionist model of coherence as constraint satisfaction is equivalent to the NP-complete Max-Cut problem. When exact analysis is impossible, the only route to understanding is simulation—running the model and observing its behavior.

This is where the concept of computational irreducibility enters. For complex systems, whether biological or material, there is often no shortcut from the model’s specification to its outcomes; one must simply let the dynamics unfold. Gagliardi contends that this epistemic necessity, rather than any mere fashion or convenience, explains why both cognitive science and statistical physics became what he calls “complexity sciences.” Both disciplines, in his phrase, “discovered the artificial”: they came to accept that understanding a system may require building an internal model of it whose behavior can be observed, even when no analytic derivation of that behavior is available. The artificial model becomes not a substitute for explanation but the very medium of explanation.

The philosophical stakes of this claim are considerable. Traditional accounts of scientific explanation, descending from Galileo’s famous declaration that the book of nature is written in mathematical language, privilege derivation: to explain is to deduce consequences from mathematical first principles. Gagliardi argues that the synthetic method extends rather than abandons this Galilean language. The new language of models and simulations adds to mathematical description the capacity to create and run artificial systems whose behavior can be studied. He points to Ernst Mach’s nineteenth-century observation that all science seeks to replace or economize experience through the mental reproduction of facts—reproductions that are easier to handle than experience itself and can stand in for it. Simulation, on this view, is the modern technological fulfillment of Mach’s epistemology of thought-economies, closer in spirit to a gedankenexperiment than to a laboratory measurement.

The article also engages a live debate in the philosophy of science about the epistemic status of computer simulations. Are simulations experiments, or are they theory? Gagliardi notes that observing the physical system under study belongs to the empirical verification phase of the scientific method, whereas observing a simulation pertains to theory and to the deduction of a model’s properties. He acknowledges that this distinction is contested: philosophers such as Anouk Barberousse, Cyrille Imbert and Sara Franceschelli, Claus Beisbart, and Judith Jebeile have argued for a genuine affinity between experiments and simulations, while others, including Julian McClelland and Darrell Rowbottom, treat simulations as instruments rather than faithful recreations of phenomena. Gagliardi’s historical framing gives this debate new context: the question of what simulations are is inseparable from the century-long process by which both physics and the mind sciences learned to trust artificial models.

Perhaps the most provocative element of the paper is its appeal to weak emergence, a concept developed by Mark Bedau, to characterize the new kind of scientific understanding that the synthetic method affords. In systems like the Ising model, there is no causal reductionism linking the internal model to macroscopic phenomena in the way that the kinetic theory analytically links molecular motion to the gas laws. Instead, macroscopic patterns depend on, but are not derivable from, the micro-dynamics—a dependence that must be exhibited through simulation rather than demonstrated through derivation. Gagliardi suggests that explanation centered on the internal functional organization of systems, in the tradition of Robert Cummins’s functional analysis, offers a shared explanatory idiom for both disciplines. Understanding becomes a matter of seeing how a system’s organization produces its capacities, a form of comprehension that simulation makes possible and that pure mathematics alone cannot deliver.

The convergence Gagliardi describes has contemporary resonance. The 2024 Nobel Prize in Physics, awarded for foundational work on artificial neural networks, underscored how deeply the physics of collective phenomena and the science of mind have become intertwined: John Hopfield’s 1982 neural networks drew explicitly on statistical-mechanical ideas, and Boltzmann machines, developed by David Ackley, Geoffrey Hinton and Terrence Sejnowski in 1985, carry the name of the great statistical physicist. Recent work by Iris van Rooij and colleagues has argued for reclaiming artificial intelligence, with its computational models and simulation techniques, as a theoretical foundation for cognitive science, with computational complexity theory playing a central role. Gagliardi’s historical analysis provides the deep background for these developments: they are not accidents of interdisciplinary fashion but expressions of a shared “Culture of the Artificial” that has been consolidating for a hundred years.

The paper, dedicated to the memory of Roberto Cordeschi, ultimately offers a vision of scientific unity that is neither reductionist nor pluralist in the usual senses. Cognitive science and statistical physics remain distinct disciplines with distinct subject matters, yet they are aligned at a deeper epistemic level: both have learned that the road to understanding complex, adaptive, collective phenomena runs through the construction of artificial models and the observation of their simulated behavior. In extending the Galilean language of mathematics into a language of model-building and simulation, twentieth-century science did not abandon rigor; it redefined what counts as explanation for a world whose systems are too complex to be solved, and rich enough to be understood only from the inside out.

Subject of Research: The historical convergence of the synthetic method and artificial modeling in cognitive science and statistical physics

Article Title: The discovery of the artificial and the use of the synthetic method in cognitive and physical sciences

Article References: Gagliardi, F. (2026). The discovery of the artificial and the use of the synthetic method in cognitive and physical sciences. AI & SOCIETY. https://doi.org/10.1007/s00146-026-03291-4

Image Credits: AI Generated

DOI: 10.1007/s00146-026-03291-4

Keywords: synthetic method, discovery of the artificial, cognitive science, statistical physics, Ising model, cybernetics, computer simulation, computational irreducibility, weak emergence, complexity science, Roberto Cordeschi, history of science

The research team recruited 459 Chinese adults with autism spectrum disorder who reported experiencing at least one type of interpersonal trauma. Participants were reached through electronic questionnaires distributed via a WeChat public platform between April 2025 and May 2026, using convenience sampling. Each respondent completed the 14-item Perceived Stress Scale, a widely used instrument that probes how unpredictable, uncontrollable, and overloaded people find their lives, along with a self-reported checklist of trauma exposure. After statistically adjusting for demographic covariates, the authors estimated a regularized partial correlation network, a technique drawn from the Gaussian graphical modeling tradition that uses the Extended Bayesian Information Criterion to prune spurious connections and reveal which variables remain associated with one another when all other variables are held constant.

Network analysis represents a conceptual departure from the latent-variable tradition that has long dominated psychology. In the older framework, conditions such as stress are assumed to reflect an underlying common cause that gives rise to observable symptoms. In the network framework, the observable components themselves are the phenomenon: they activate and sustain one another through direct connections, and the structure of those connections determines how easily distress spreads through the system. This matters clinically, because in a densely connected network, a perturbation at one node can cascade outward, whereas in a sparse network, problems tend to remain localized. The density of the perceived stress network in this sample was 0.604, meaning that a majority of all possible connections between the fourteen stress items were present after regularization, a sign of a tightly woven and mutually reinforcing system.

To gauge which nodes carried the greatest influence, the researchers computed Expected Influence, a centrality metric that sums the strength and direction of a node’s connections to every other node in the graph. Unlike betweenness or closeness centrality, Expected Influence captures not only how connected a node is but also whether those connections are activating or dampening, which makes it well suited to mixed networks containing both positive and negative associations. Three items rose to the top. The strongest was P2, describing the inability to control the important things in one’s life, with an Expected Influence of 1.168. It was followed by P6, reflecting confidence in handling personal problems, at 1.091, and P14, the sense of being unable to overcome difficulties, at 1.006. Taken together, these hubs paint a coherent picture: what holds the stress network together in this population is not any single stressful event but the felt capacity, or incapacity, to exert control over circumstances.

A critical question for any network study is whether the estimated structure is trustworthy or merely an artifact of sampling noise. The authors addressed this with a case-dropping bootstrap procedure, which repeatedly re-estimates the network after discarding increasing proportions of participants and checks whether centrality rankings remain stable. The network achieved a correlation stability coefficient of 0.749, comfortably above the conventional threshold of 0.5 and indicative of high robustness. In practical terms, a researcher would need to discard roughly three quarters of the sample before the centrality estimates began to wobble, a level of stability that lends considerable weight to the identification of the control-related hubs.

The team then asked whether cumulative trauma exposure reshapes the stress network. Using the Network Comparison Test, they split the sample into high- and low-trauma groups and compared both the overall connectivity of the networks, known as global strength, and the individual edge weights connecting specific pairs of items. The comparison detected no significant differences in either global strength or network structure between the two groups. However, the authors are careful to flag an important caveat: the study was underpowered to detect small-to-moderate differences, and the null findings should therefore be interpreted as inconclusive rather than as evidence that trauma leaves the stress architecture untouched. This is a methodologically honest position, and it underscores a broader lesson for the growing field of psychological network science, where negative findings are sometimes overinterpreted as demonstrations of structural invariance.

Perhaps the most forward-looking component of the study is its use of simulated interventions on binarized Ising network models. The Ising model, borrowed from statistical physics where it describes interacting spins in a magnet, treats each variable as a binary state and models the probability of that state flipping as a function of its neighbors. By activating or deactivating individual nodes within this simulated system, researchers can estimate how a hypothetical intervention targeting one component would propagate through the network. In the primary analysis, the simulations suggested that P4, the successful handling of daily hassles, emerged as a potential aggravation target with a delta of +0.737, while P10, the sense of mastery, appeared as a potential alleviation target with a delta of −1.806. In the strict analysis, however, the targets shifted: P6, confidence in handling personal problems, became the aggravation target at +1.870, and P2, the inability to control important things, became the alleviation target at −1.454.

The instability of these simulated targets across perturbation magnitudes and binarization cut-offs is one of the study’s most instructive results. The authors explicitly state that the identified targets should be regarded as exploratory statistical predictions rather than stable clinical intervention targets. This candor matters, because network-based intervention planning has attracted enormous enthusiasm in recent years, with clinicians eager to identify the single node whose modification would produce the largest downstream benefit. The present findings suggest that such enthusiasm should be tempered: the identity of the most promising target can depend on technical analytic choices, and a target identified under one set of parameters may vanish under another. Replication across independent samples, longitudinal designs that track how networks evolve over time, and more refined measurements of trauma exposure are all needed before any of these statistical predictions can inform real-world therapy.

Even with those caveats, the convergence between the centrality findings and the simulation results is noteworthy. Both lines of analysis point toward the same thematic territory: perceived control and self-efficacy. This convergence carries potential implications for how clinicians think about stress in autistic adults with trauma histories. Interventions that build problem-solving capacity, strengthen the sense of mastery, and restore feelings of control over important life domains may, if the network logic holds, produce benefits that ripple across the wider stress system. Such an approach would be consistent with established therapeutic frameworks, including cognitive behavioral therapy and problem-solving therapy, but the network perspective offers a novel theoretical rationale for why these approaches might be especially potent in this population: they target the hubs rather than the periphery.

The study also contributes to a broader scientific conversation about the intersection of autism and trauma. Adults on the spectrum face elevated rates of adverse experiences, including interpersonal victimization, and perceived stress is thought to interact with dysregulation of the hypothalamic-pituitary-adrenal axis in ways that may compound vulnerability to post-traumatic stress disorder. By mapping the fine-grained structure of perceived stress in this population, the Xiamen team has provided a foundation on which future longitudinal and experimental work can build. The picture that emerges is neither simple nor settled, but it is concrete: a highly stable, densely connected stress network organized around control and self-efficacy, whose most influential nodes can now be named, measured, and, ultimately, tested as candidates for intervention. For a field that has often treated stress in autistic adults as an undifferentiated burden, that level of specificity is a meaningful step forward.

Subject of Research: Network analysis of perceived stress in trauma-exposed adults with autism spectrum disorder

Article Title: A network analysis and simulated intervention study of perceived stress in trauma-exposed adults with autism spectrum disorder

Article References: A network analysis and simulated intervention study of perceived stress in trauma-exposed adults with autism spectrum disorder. (n.d.). https://doi.org/10.1186/s12888-026-08690-x

Image Credits: AI Generated

DOI: 10.1186/s12888-026-08690-x

Keywords: autism spectrum disorder, perceived stress, network analysis, interpersonal trauma, self-efficacy, Expected Influence, Ising model, simulated intervention, BMC Psychiatry, cumulative trauma, psychological networks, mental health

The new method, called SymLQA, is described in a paper published in Quantum Information Processing by Wenjie Sun, Zhigang Wang, and colleagues at the University of Electronic Science and Technology of China, Tsinghua University, and partner institutions. Rather than attacking the higher-order terms head-on, the researchers exploit a structural property of the problems they target: planar face-flux optimization. These problems arise naturally in lattice gauge models, where spins live on the edges of a graph and the physically meaningful quantities are fluxes around closed loops, or faces. In such settings, the seemingly complicated HUBO energy function hides a much simpler structure that only becomes visible when the graph is treated as a geometric object rather than a bag of coupled variables.

The first step of the SymLQA pipeline is a careful topological extraction. Using a rotation system, a standard combinatorial device that records the cyclic order of edges around each vertex, together with half-edge traversal, the algorithm identifies all the bounded faces of an embedded planar graph. This is the computational equivalent of tracing every enclosed region of a map drawn on a flat sheet. The implementation is rigorous enough that it satisfies Euler’s identity, the classic relation among vertices, edges, and faces, on every embedding tested, and it successfully extracts irregular faces containing up to sixteen boundary edges. That robustness matters because real-world planar instances are rarely neat square grids; they are irregular, lopsided, and full of awkward boundary shapes.

Once the faces are known, the transformation at the heart of SymLQA begins. Each face is assigned a new binary variable defined as the product of the edge spins along its boundary, a quantity the authors call a classical face-flux variable. This move mirrors a deep idea from lattice gauge theory, where fluxes around plaquettes, rather than the underlying link variables, often carry the essential physics. In the face-flux variables, the original edge-spin HUBO, with its face fields and face-flux interaction terms, becomes a sparse objective containing only one-body and two-body terms. Crucially, this reduction requires no auxiliary variables at all, which distinguishes it from the usual penalty-based encodings that inflate problem size and introduce fragile constraint weights.

The reduction would be of limited use if solutions in the new variables could not be translated back. SymLQA handles this with a reconstruction step based on arithmetic over the finite field GF(2), the two-element field where addition is equivalent to exclusive-or. For connected open planar embeddings, the GF(2) reconstruction maps every assignment of the dual, or face, variables back to a consistent assignment of the original edge spins, and the mapping preserves the objective value exactly. The consequence is mathematically clean: the minimum of the primal problem and the minimum of the dual problem coincide. The annealer can therefore search the transformed, quadratic landscape with the full confidence that whatever optimum it finds corresponds to a genuine optimum of the original hard problem.

To find out whether this elegant reformulation actually pays off in practice, the team benchmarked SymLQA against three formidable baselines: a momentum-based native local quantum annealing applied directly to the HUBO, a gauged variant of local quantum annealing, and classical simulated annealing on the primal formulation. The test bed consisted of independently generated certified frustrated-loop instances, a family of benchmark problems whose ground states are known in advance, which allows success or failure to be verified without ambiguity. Frustrated loops are notoriously treacherous for annealers because competing interactions create rugged energy landscapes riddled with local minima, making them a demanding and honest yardstick for any new solver.

The results are striking. On regular grids up to 32 by 32 and on irregular planar grids, SymLQA reached the known ground state in every tested run, maintaining a perfect success probability. The baselines told a very different story: their success probabilities fell rapidly as the instances grew, a familiar signature of gradients drowning in higher-order terms and of generic thermal dynamics failing to navigate the landscape. SymLQA’s advantage was not confined to a single coupling regime either. Across four independently sampled coupling regimes, the method retained unit success probability, suggesting that the improvement stems from the structural reformulation itself rather than from a lucky interaction between the algorithm and one particular class of random instances.

The speedup numbers are equally dramatic. At a grid size of 12 by 12, SymLQA achieved a batch time to solution at the 99 percent confidence level, abbreviated TTS99, of just 0.137 seconds. Native local quantum annealing needed 22.35 seconds to reach the same reliability, roughly 160 times slower, while primal simulated annealing required 8.85 seconds, about 65 times slower. Time to solution is a standard metric in the annealing community because it combines the probability of finding the optimum with the cost of each run, rewarding algorithms that are both accurate and consistently repeatable. A two-order-of-magnitude gap on this metric is not an incremental gain; it is the kind of separation that changes which problems are considered practically solvable.

What makes SymLQA especially interesting is that it is, at its core, a classical pipeline. The face extraction, the flux-variable transformation, and the GF(2) reconstruction are all classical preprocessing and postprocessing steps wrapped around an annealing solver. This positions the work squarely within the growing field of quantum-inspired optimization, where insights from physics and from quantum hardware motivate classical algorithms that can run on ordinary computers today. The connection to quantum Z2 lattice gauge formulations of HUBO problems, explored in recent work by other groups, shows that gauge-theoretic structure is emerging as a general resource for taming higher-order optimization, and SymLQA demonstrates how to exploit that structure with full topological awareness on planar graphs.

The implications extend beyond a single benchmark family. Planar optimization structures appear in routing and network design, in grid-based physical models, and in any setting where constraints or costs are naturally associated with regions rather than individual links. By converting edge-spin HUBO models with polynomially suppressed gradients into sparse Ising objectives with clean one- and two-body terms, SymLQA makes an entire problem class friendly to the growing ecosystem of Ising machines, digital annealers, and quantum annealers. The work also carries a broader lesson for the field: before throwing more hardware or more sophisticated dynamics at a hard optimization problem, it can pay enormously to ask whether the problem’s hidden topology already contains the key to simplifying it. In this case, a map’s faces turned out to be the secret ingredient that turned an intractable-feeling search into one solved, reliably, in a fraction of a second.

Subject of Research: Topology-aware local quantum annealing for planar face-flux HUBO optimization problems

Article Title: SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems

Article References: Sun, W., Wang, Z., Hu, J., Yu, L., Chen, G., Wang, L., Liu, H., & Li, X. (2026). SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems. Quantum Information Processing, 25(10), Article 323. https://doi.org/10.1007/s11128-026-05345-4

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05345-4

Keywords: quantum annealing, HUBO, Ising model, lattice gauge theory, combinatorial optimization, planar graphs, face-flux variables, simulated annealing, topology, GF(2) reconstruction, time to solution, spin glass

Network analysis has transformed how psychologists think about mental disorders over the past decade. Rather than treating conditions like anxiety as underlying diseases that cause visible symptoms, the network approach views each symptom — worry, restlessness, irritability, sleep disturbance — as a node in a web of mutually reinforcing connections. When connections between symptoms grow strong, activation can cascade through the network, making it harder to calm down once it has been triggered. In this framework, psychopathology is not a hidden cause but an emergent property of the network itself, a perspective championed by researchers such as Denny Borsboom and elaborated in methodological reviews that have made network psychometrics a staple of modern mental health research.

Network temperature extends this idea by borrowing a metaphor from statistical physics. Just as the temperature of a physical system reflects how energetic and disordered its particles are, the temperature of a psychological network quantifies its dynamic stability. A low-temperature network is rigid and settled: its nodes tend to remain in stable states, and disturbances die out quickly. A high-temperature network is volatile: nodes flip between states more freely, activations propagate, and the whole system is prone to sudden reorganization. The metric was originally proposed in the engineering literature as a general statistical index for measuring and managing networks, and it has recently been adapted to depression symptoms across adolescence in work published in Nature Mental Health. The new study is the first to apply it to a network spanning both childhood trauma and anxiety symptoms.

To build that network, the researchers used the Ising model, a statistical framework developed for magnetism that has become a workhorse of psychological network analysis for binary data. Each node in the model represents a dichotomous symptom or trauma indicator, and the edges represent the statistical tendency of pairs of nodes to co-occur, controlling for all other nodes. Trauma was measured with items reflecting the major domains of childhood maltreatment — physical abuse, emotional abuse, sexual abuse, physical neglect, and emotional neglect — while anxiety was assessed with the seven-item Generalized Anxiety Disorder scale, a widely validated screening instrument in Chinese adolescent populations. The resulting network joined the two clusters into a single connected system whose overall temperature could be computed and compared across developmental stages.

The team divided adolescence into three conventional phases — early, middle, and late — and estimated the network separately within each stage, repeating the analysis for males and females. Because the sample was so large, the estimates were unusually stable, an important consideration in network psychometrics, where small samples can produce unreliable edge weights. The researchers also computed centrality and bridge statistics, which identify which nodes are most influential within the network as a whole and which serve as the strongest conduits between otherwise distinct clusters of nodes.

Two findings stood out. First, physical abuse emerged as the most globally central node in the entire trauma–anxiety network, meaning it maintained the strongest and most numerous connections to other symptoms across developmental stages. Second, emotional abuse was identified as the most critical bridging node — the element that most tightly coupled the trauma cluster to the anxiety cluster. This distinction matters clinically. Central nodes are candidates for interventions aimed at reducing overall symptom load, while bridge nodes are the pathways through which problems in one domain spill over into another. If emotional abuse is the strongest bridge, then the psychological residue of verbal aggression, humiliation, and rejection in childhood may be the primary channel through which early adversity continues to feed anxious symptoms years later.

The developmental pattern was equally striking. At the population level, network temperature peaked during middle adolescence and declined thereafter. In other words, the trauma–anxiety system was most volatile — most prone to activation spreading and state changes — in the middle of the teenage years, and became more stable and settled as adolescents moved into late adolescence. This aligns with a broad body of developmental neuroscience describing adolescence, and especially the mid-teen years, as a period of heightened emotional reactivity and ongoing maturation of emotion regulation capacities, when the social-affective circuits of the brain are remodelled faster than the cognitive control systems that regulate them.

But the population-level curve concealed a profound sex difference. When the analyses were stratified, girls and boys followed divergent trajectories. Among females, network temperature continued to rise after middle adolescence, indicating that the trauma–anxiety network became progressively more unstable as girls moved into their later teens. Among males, by contrast, temperature dropped sharply after middle adolescence, suggesting a settling of the system. This divergence echoes epidemiological patterns showing that anxiety disorders become markedly more prevalent in girls during adolescence, and it suggests that the instability of the underlying symptom network may be one mechanism contributing to that widening gap.

The authors emphasize that network temperature offers something that conventional comparisons of symptom means cannot: a system-level characterization of stability. Two groups might report similar average levels of anxiety, yet differ dramatically in how tightly coupled and volatile their symptom networks are — and that difference could determine who recovers from a bad week and who spirals into a persistent disorder. By quantifying temperature across developmental stages, the study provides a way of asking not just how much distress adolescents report, but how dynamically precarious the architecture beneath that distress happens to be at each age.

Several caveats temper the conclusions. The data are cross-sectional, so each developmental stage was assessed in different individuals rather than the same individuals followed over time; cohort effects cannot be excluded, and true within-person trajectories may differ. The sample was drawn from a single country, and cultural context shapes both the experience and the reporting of trauma and anxiety. The trauma measures were retrospective self-reports, which are subject to recall biases. Even so, the scale of the sample, the novelty of the temperature metric, and the consistency of the sex-specific patterns make this a landmark demonstration. If the findings hold up in longitudinal designs, they point toward a concrete clinical implication: screening and preventive efforts for adolescents with trauma histories may need to be timed and tailored differently for boys and girls, with the middle teenage years representing a window of maximal instability — and, perhaps, of maximal opportunity for intervention before a volatile network hardens into a stable one.

Subject of Research: Developmental and sex differences in the network dynamics linking childhood trauma to adolescent anxiety, measured with network temperature

Article Title: Developmental Stage Differences in the Childhood Trauma–Adolescent Anxiety Network: A Large-Scale Cross-Sectional Application of Network Temperature

Article References: Developmental Stage Differences in the Childhood Trauma–Adolescent Anxiety Network: A Large-Scale Cross-Sectional Application of Network Temperature. (n.d.). https://doi.org/10.1007/s10578-026-02102-7

Image Credits: AI Generated

DOI: 10.1007/s10578-026-02102-7

Keywords: childhood trauma, adolescent anxiety, network analysis, network temperature, Ising model, physical abuse, emotional abuse, adolescence, sex differences, psychopathology networks, mental health, developmental psychology

The Ising model, borrowed from statistical physics, describes a collection of spins that can each point up or down, with interactions that either favor alignment or anti-alignment between neighboring spins. Finding the lowest-energy spin configuration of such a system is mathematically equivalent to a broad class of hard combinatorial problems, a correspondence that Andrew Lucas laid out systematically in a widely cited 2014 paper in Frontiers of Physics. Because of this equivalence, researchers have long been interested in building physical systems, so-called Ising machines, whose natural dynamics drive them toward low-energy states, allowing the hardware itself to perform the search that would otherwise demand enormous computational effort from conventional digital machines.

Several approaches to Ising machines have been explored over the past decade. In 2016, two landmark demonstrations appeared in Science: a team led by T. Inagaki and colleagues at NTT built a coherent Ising machine using a network of optical parametric oscillators, while Peter McMahon and collaborators at Stanford University demonstrated a similar photonic architecture with improved scaling and solution quality. These photonic systems showed that physical analog hardware could indeed compete with digital algorithms on certain problem instances, sparking a worldwide effort to find faster, cheaper and more compact physical substrates for Ising-style computation.

Magnetic devices entered this race for compelling reasons. A magnetic tunnel junction consists of two ferromagnetic layers separated by a thin insulating barrier, and its resistance depends on the relative orientation of the two magnetizations, parallel or antiparallel. Those two resistance states map naturally onto the two states of an Ising spin, up or down. Furthermore, each magnetic tunnel junction is, in effect, a tiny bar magnet with genuine thermal fluctuations, a property that Kerem Camsari, Rafatul Faria, Brian Sutton and Supriyo Datta exploited in 2017 in Physical Review X to propose stochastic units called p-bits, probabilistic bits that fluctuate between states with tunable bias and can implement powerful sampling-based optimization and inference algorithms when networked together.

The work highlighted in the new perspective, an article by S. Li and colleagues in Nature Electronics, advances this program by using voltage-controlled magnetic anisotropy to switch and modulate the magnetic tunnel junctions in an integrated array. Voltage-controlled magnetic anisotropy, first demonstrated prominently by W.-G. Wang, M. Li, S. Hageman and C. L. Chien in Nature Materials in 2012, allows the magnetic anisotropy of an ultrathin ferromagnetic film, and hence its energy barrier and preferred magnetization direction, to be tuned by applying a voltage across an adjacent gate dielectric. Because this mechanism acts through an electric field rather than a current, it promises dramatically lower energy per operation than current-based switching schemes, addressing one of the central bottlenecks for scaling magnetic logic and memory technologies.

In the architecture described by the perspective, the integrated array of magnetic tunnel junctions serves as a physical realization of Ising spins, while the coupling between spins, the analog of the exchange interactions in the Ising model, encodes the structure of the optimization problem being solved. By driving the array with appropriate voltage control, the system explores the configuration space and relaxes toward low-energy states that correspond to good, and in favorable cases optimal, solutions of the encoded problem. Crucially, the perspective emphasizes that this can be done quickly and with low energy consumption, two figures of merit that determine whether such hardware can move beyond laboratory demonstrations and into practical use for real workloads in logistics, finance, drug discovery and chip design.

The new report builds on a series of recent advances in magnetic Ising and probabilistic computing hardware. In 2023, Y. Shao and colleagues published work in Nanotechnology on magnetic tunnel junction-based approaches to Ising computation, and in 2024, J. Si and collaborators reported in Nature Communications on magnetic tunnel junction arrays for such applications. More recently, in 2026, M. A. Iftakher and colleagues described related stochastic magnetic computing concepts in Nature Communications. Together, these studies trace a rapid trajectory from single-device physics toward integrated, array-scale systems, and the Li and colleagues work reported in Nature Electronics represents an important consolidation of that progress into a functional, integrated platform for model optimization problems.

What makes the magnetic approach particularly attractive is its compatibility with existing semiconductor manufacturing. Magnetic tunnel junctions are already embedded in billions of consumer devices as memory cells, and the materials and process technology for fabricating them at scale is mature. A computing architecture that repurposes these devices as stochastic optimization elements could, in principle, be fabricated alongside conventional CMOS circuitry, opening a path toward hybrid chips in which a conventional processor offloads hard combinatorial kernels to a dense magnetic Ising fabric. The low switching energies enabled by voltage-controlled magnetic anisotropy further strengthen the case, since the energy cost of each spin update is a key determinant of overall system efficiency at scale.

Challenges nonetheless remain before magnetic Ising machines can challenge state-of-the-art algorithms and specialized processors on production-scale problems. The quality of solutions found by physical relaxations depends on the fidelity of the implemented couplings, the stability and controllability of the stochastic dynamics, the number of spins that can be integrated, and the efficiency of reading out and verifying results. Problems of practical interest often involve far more variables than any near-term chip can host, requiring embedding techniques that inflate problem size, and the performance of Ising machines against the best classical solvers continues to be debated. The authors of the perspective, who are affiliated with the George Washington University and the Physical Measurement Laboratory of the National Institute of Standards and Technology, note that demonstrating clear, reproducible advantages on benchmark problems will be essential for the field’s credibility.

Even so, the demonstration that an integrated array of magnetic tunnel junctions can rapidly and efficiently solve Ising-model optimization problems marks a significant milestone at the intersection of magnetism, memory technology and unconventional computing. It suggests that the devices built to remember bits may also be enlisted to search for them, turning the physics of nanoscale magnetism into a computational resource. As the hardware matures and couples more tightly with conventional electronics, magnetic Ising machines could become a practical accelerator for some of the hardest, most economically consequential computational problems that society routinely faces.

Subject of Research: Using integrated arrays of magnetic tunnel junctions with voltage-controlled magnetic anisotropy to accelerate Ising-model-based combinatorial optimization.

Article Title: Magnetic memory accelerates combinatorial optimization

Article References: Zhang, H., Borders, W. A., & Stiles, M. D. (2026). Magnetic memory accelerates combinatorial optimization. Nature Electronics. https://doi.org/10.1038/s41928-026-01713-1

Image Credits: AI Generated

DOI: 10.1038/s41928-026-01713-1

Keywords: magnetic tunnel junctions, Ising machines, combinatorial optimization, voltage-controlled magnetic anisotropy, Nature Electronics, probabilistic computing, spintronics, low-power computing, p-bits, statistical physics, MRAM, unconventional computing

The core idea behind the new scheme is simple to state but technically demanding to implement. In a second-order Ising model, every term in the energy function involves at most two spins, and reduction algorithms can look for groups of spins that are locked together — for example, spins that always take opposite values, or spins whose joint behavior is fully determined by a single effective variable. Such groups are called non-separable, because the spins inside them cannot be treated independently without changing the problem. Merging a non-separable group into one variable reduces the number of spins the solver must handle, often without any loss of accuracy. Until now, however, this machinery had been developed almost exclusively for quadratic Hamiltonians, leaving the many problems that naturally involve three-body, four-body, or even higher-order interactions without an equivalent tool.

Higher-order interactions are not an exotic curiosity; they are the rule rather than the exception in many formulations. When engineers express constraints such as all-different, cardinality limits, or logical clauses in pseudo-Boolean form, terms coupling three or more binary variables appear almost immediately. The authors of the new study generalize the notion of non-separable groups so that it applies to these arbitrary-order Hamiltonians. Their framework iteratively scans the Hamiltonian, detects clusters of spins that are constrained to move as a unit, and merges each cluster into a single variable, updating the energy function at every step so that the reduced problem remains an exact representation of the original. Because the procedure is iterative, reductions found early in the process can trigger further reductions later, compounding the savings in problem size.

Technically, the scheme must contend with subtleties that do not arise in the quadratic case. With higher-order terms, the energy landscape can contain degeneracies and symmetries that make it nontrivial to decide which spins are truly inseparable and which merely appear coupled at first glance. The researchers’ algorithm carefully tracks the structure of interactions across the hypergraph of the problem, where hyperedges connect groups of spins of any size. By examining how these hyperedges overlap, the algorithm identifies minimal constrained groups whose internal degrees of freedom can be fixed or absorbed. The team has released a reference implementation, called GH_minimal, as open-source code, allowing other researchers to integrate the reduction step into existing optimization pipelines.

To evaluate the method, the authors benchmarked it on synthetic hypergraphs as well as on real higher-order network datasets, including structures modeled on scientific collaboration networks and other empirically observed systems. These benchmarks matter because the performance of any reduction technique depends on the topology of the problem: sparse, tree-like structures tend to offer many opportunities for merging, while dense random structures may resist reduction. By testing across a spectrum of graph densities and higher-order interaction patterns, the team could characterize when their approach delivers large gains and when it offers more modest improvements. They also examined how well the reduced Hamiltonians integrate with downstream workflows, including order-reduction procedures that convert high-order terms into quadratic form and heuristic solvers such as simulated annealing, quantum annealing, and related quantum heuristic algorithms.

The results establish, for the first time, a systematic foundation for Hamiltonian reduction in higher-order Ising-like optimization. This matters practically because modern hardware solvers impose strict constraints. Quantum annealers such as D-Wave’s machines natively implement only quadratic interactions on a fixed chip topology, so any high-order term must be replaced by auxiliary spins and couplings — a gadget construction that inflates the qubit count. Every spin removed before this step translates directly into hardware resources saved. Similarly, coherent Ising machines and simulated bifurcation algorithms, which have recently been extended to handle higher-order cost functions directly, still benefit from smaller effective problem sizes, since solution quality and convergence speed typically degrade as problem dimension grows.

The new work connects to a rich history. Andrew Lucas’s influential 2014 catalog showed that a wide range of NP-hard problems admit Ising formulations, while Boros and Hammer’s theory of pseudo-Boolean optimization provided the mathematical language for handling nonlinear binary objectives. Preprocessing techniques for quadratic unconstrained binary optimization, such as those developed by Gueye and Michelon, and the FastHARE reduction algorithm for large-scale quantum annealing, demonstrated the practical value of shrinking Hamiltonians before solving. The contribution of Mao and colleagues is to lift this entire toolkit into the higher-order regime, where the combinatorial structure is richer and the potential savings are correspondingly larger. Their generalization of non-separable groups provides a unified lens: what previously required separate analyses for pairwise couplings now follows from a single framework that treats interactions of any order on equal footing.

The implications extend to some of the most active frontiers in quantum computing research. Quantum approximate optimization algorithms have recently been demonstrated on higher-order Ising models, including whole-chip QAOA experiments on heavy-hex lattices, and alternative formulations based on quantum Z2 lattice gauge theory have shown speedups for high-order unconstrained binary optimization. All of these approaches face the same fundamental bottleneck: the gap between the natural high-order formulation of a problem and the limited connectivity and interaction order of available hardware. A preprocessing layer that reduces the effective problem size before compilation could improve the resource efficiency of the entire pipeline, potentially allowing larger, more realistic optimization instances to be tackled on near-term quantum and quantum-inspired platforms.

There are, of course, limits to what any reduction scheme can achieve. The computational complexity of Ising spin glass problems guarantees that no preprocessing step will make hard instances universally easy — Barahona’s classic results showed that even planar spin glasses are computationally hard in general. The value of reduction lies instead in the substantial fraction of practical instances that contain exploitable structure. Real-world optimization problems, unlike worst-case adversarial constructions, frequently encode constraints that force groups of variables to move together, and it is precisely this structure that the new algorithm harvests. The benchmark results on synthetic and real higher-order networks suggest that the technique can yield meaningful reductions on problems with realistic topology, though the authors note that raw benchmark data cannot be fully released due to intellectual property and confidentiality policies.

The research was supported by the National Natural Science Foundation of China and the Chinese Academy of Sciences, and the code is freely available for the community to build upon. As quantum heuristic solvers mature — from superconducting annealers running thousands of qubits to optical parametric oscillator networks and digital simulated-bifurcation chips — the surrounding software ecosystem of problem formulation, reduction, and compilation becomes just as important as the hardware itself. By extending Hamiltonian reduction to arbitrary-order Ising-like models, this work fills a conspicuous gap in that ecosystem, and it may well become a standard preprocessing step in the workflows that carry combinatorial optimization problems onto the quantum and quantum-inspired machines of the coming decade.

Subject of Research: Hamiltonian reduction for arbitrary-order Ising-like optimization problems in quantum heuristic solvers

Article Title: A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers

Article References: Mao, C., Mosharev, P., Wang, Y., & Yung, M.-H. (2026). A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers. Quantum Information Processing, 25(10), Article 319. https://doi.org/10.1007/s11128-026-05339-2

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05339-2

Keywords: Ising model, combinatorial optimization, Hamiltonian reduction, quantum annealing, pseudo-Boolean optimization, quantum heuristic algorithms, higher-order interactions, non-separable groups, QUBO, quantum computing, simulated annealing, network datasets