Multiscale structural complexity of natural patterns.

Complexity of patterns is key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal machine method for estimating structural (effective) complexity of two-dimensional and three-dimensional patterns that can be straightforwardly generalized onto other classes of objects. It is based on multistep renormalization of the pattern of interest and computing the overlap between neighboring renormalized layers. This way, we can define a single number characterizing the structural complexity of an object. We apply this definition to quantify complexity of various magnetic patterns and demonstrate that not only does it reflect the intuitive feeling of what is "complex" and what is "simple" but also, can be used to accurately detect different phase transitions and gain information about dynamics of nonequilibrium systems. When employed for that, the proposed scheme is much simpler and numerically cheaper than the standard methods based on computing correlation functions or using machine learning techniques.

Detecting quantum critical points in the t-[Formula: see text] Fermi-Hubbard model via complex network theory.

A considerable success in phenomenological description of [Formula: see text] superconductors has been achieved within the paradigm of Quantum Critical Point (QCP)-a parental state of a variety of exotic phases that is characterized by dense entanglement and absence of well-defined quasiparticles. However, the microscopic origin of the critical regime in real materials remains an open question. On the other hand, there is a popular view that a single-band t-[Formula: see text] Hubbard model is the minimal model to catch the main relevant physics of superconducting compounds. Here, we suggest that emergence of the QCP is tightly connected with entanglement in real space and identify its location on the phase diagram of the hole-doped t-[Formula: see text] Hubbard model. To detect the QCP we study a weighted graph of inter-site quantum mutual information within a four-by-four plaquette that is solved by exact diagonalization. We demonstrate that some quantitative characteristics of such a graph, viewed as a complex network, exhibit peculiar behavior around a certain submanifold in the parametric space of the model. This method allows us to overcome difficulties caused by finite size effects and to identify precursors of the transition point even on a small lattice, where long-range asymptotics of correlation functions cannot be accessed.

Generalization properties of neural network approximations to frustrated magnet ground states.

Neural quantum states (NQS) attract a lot of attention due to their potential to serve as a very expressive variational ansatz for quantum many-body systems. Here we study the main factors governing the applicability of NQS to frustrated magnets by training neural networks to approximate ground states of several moderately-sized Hamiltonians using the corresponding wave function structure on a small subset of the Hilbert space basis as training dataset. We notice that generalization quality, i.e. the ability to learn from a limited number of samples and correctly approximate the target state on the rest of the space, drops abruptly when frustration is increased. We also show that learning the sign structure is considerably more difficult than learning amplitudes. Finally, we conclude that the main issue to be addressed at this stage, in order to use the method of NQS for simulating realistic models, is that of generalization rather than expressibility.