We solve the anharmonic oscillator using physics-informed renormalisation group (PIRG) flows, focusing on the weak coupling regime dominated by instanton-induced tunnelling processes. We demonstrate that the instanton physics underlying the exponential suppression of the energy gap is already captured at the first order of the derivative expansion within the PIRG framework. The key advances of this work are the implementation of a ground-state expansion in the PIRG flow and the adoption of high-precision Galerkin-based numerics. Our determination of the decay constant, $ a_{} = 1.910(2) $, agrees quantitatively with the analytic value $ a_{} = 1.886 $, differing by only 1\% 1 % . While the present formulation relies on a heuristic mapping that will be systematically refined in future extensions of the PIRG approach, these results already highlight the remarkable ability of the method to capture non-perturbative quantum phenomena within relatively simple truncations.
The physics of strongly correlated systems offers some of the most intriguing physics challenges such as competing orders or the emergence of dynamical composite degrees of freedom. Often, the resolution of these physics challenges is computationally hard, but can be simplified enormously by a formulation in terms of the dynamical degrees of freedom and within an expansion about the physical ground state. Importantly, such a formulation does not only reduce or minimise the computational challenges, it also facilitates the access to the physics mechanisms at play. The tasks of finding the dynamical degrees of freedom and the physical ground state can be systematically addressed within the functional renormalisation group approach with flowing fields which accommodates both, emergent composites as well as the physical ground state. In the present work we use this approach to set up physics-informed renormalisation group flows (PIRG flows): Scale-dependent coordinate transformations in field space induce emergent composites, and the respective flows for the effective action generate a large set of target actions, formulated in these emergent composite fields. This novel perspective on RG flows bears a great potential both for conceptual as well as computational applications: to begin with, PIRG flows allow for a systematic search of the dynamical degrees of freedom and the respective ground state that leads to the most rapid convergence of expansion schemes, thus minimising the computational effort. Secondly, the resolution of the remaining computational tasks within a given expansion scheme can be further reduced by optimising the physics content within a given approximation. Thirdly, the maximal variability of PIRG flows can be used to reduce the analytic and numerical effort of solving the flows within a given approximation.
We train machine learning algorithms to infer the entanglement structure of disordered long-range interacting quantum spin chains by learning from the strong disorder renormalisation group (SDRG) method. The system consists of
S=1/2-quantum spins coupled by antiferromagnetic power-law interactions with decay exponent
α at random positions on a one-dimensional chain. Using SDRG as a physics-informed teacher, we compare a Random Forest classifier as a classical baseline with a graph neural network (GNN) that operates directly on the interaction graph and learns a bond-ranking rule mirroring the SDRG decimation policy. The GNN achieves a disorder-averaged pairing accuracy close to one and reproduces the entanglement entropy
S(ℓ) in excellent quantitative agreement with SDRG across all subsystem sizes and interaction exponents. RG flow heat maps confirm that the GNN learns the sequential decimation hierarchy rather than merely fitting final-state observables. Finite-temperature entanglement properties are incorporated via the SDRGX framework through a two-stage strategy, using the zero-temperature GNN to generate the RG flow and sampling thermal occupations from the canonical ensemble, yielding results in agreement with both numerical SDRGX and analytical predictions without retraining.