We consider the non-Hermitian Z ( N ) free parafermion model from the perspective of machine learning. By neglecting the boundary contributions, key correlation functions obtained via the Hellmann–Feynman theorem are validated numerically. We implement unsupervised learning based on principal component analysis and k-means clustering to successfully detect and classify the phase transitions from the quasienergies. We also demonstrate the capability of fully connected neural networks in learning physical observables from the free parafermion formalism. Our results suggest an optimism towards finding an explicit exact formulation of the eigenvectors for N ≥ 3 .
We consider the non-Hermitian Z ( N ) free parafermion model from the perspective of machine learning. By neglecting the boundary contributions, key correlation functions obtained via the Hellmann–Feynman theorem are validated numerically. We implement unsupervised learning based on principal component analysis and k-means clustering to successfully detect and classify the phase transitions from the quasienergies. We also demonstrate the capability of fully connected neural networks in learning physical observables from the free parafermion formalism. Our results suggest an optimism towards finding an explicit exact formulation of the eigenvectors for N ≥ 3 .
Unsupervised learning is a discipline of machine learning which aims at discovering patterns in large data sets or classifying the data into several categories without being trained explicitly. We show that unsupervised learning techniques can be readily used to identify phases and phases transitions of many-body systems. Starting with raw spin configurations of a prototypical Ising model, we use principal component analysis to extract relevant low-dimensional representations of the original data and use clustering analysis to identify distinct phases in the feature space. This approach successfully finds physical concepts such as the order parameter and structure factor to be indicators of a phase transition. We discuss the future prospects of discovering more complex phases and phase transitions using unsupervised learning techniques.
The identification and characterization of phase transitions is one of the oldest and most central problems in condensed matter physics, traditionally approached through order parameters, free-energy expansions, renormalization-group analysis, and direct numerical simulation. Over the past decade, machine learning (ML) has emerged as a complementary and, in some regimes, transformative methodology for this task. Supervised classifiers can learn to distinguish phases directly from raw configurations without an a priori order parameter; unsupervised and self-supervised techniques such as principal component analysis, autoencoders, and learning-by-confusion can locate transition points with minimal or no labeled data; and generative and variational architectures, including neural-network quantum states, now approximate ground-state wavefunctions of strongly correlated systems well beyond the reach of exact diagonalization. This paper reviews the theoretical foundations of phase transitions relevant to machine-learning applications, surveys the principal families of algorithms used to detect and classify phases, and examines their application across classical spin systems, percolation, topological and quantum phases, strongly correlated electron systems, and experimentally measured spectroscopic data. Representative case studies are discussed, including convolutional and graph-neural-network classifiers of lattice configurations, explainable-ML detection of thermodynamic transitions in photoemission spectra, and deep-learning-guided discovery of high-temperature superconductors. The review closes with a critical discussion of persistent challenges interpretability, data scarcity in correlated-electron experiments, generalization across Hamiltonians, and the reliability of learned order parameters near criticality and outlines directions for future research, including physics-informed architectures, uncertainty quantification, and closed-loop integration with autonomous experimentation.
This work aims at determining whether artificial intelligence can recognize a phase transition without prior human knowledge. If this were successful, it could be applied to, for instance, analyzing data from the quantum simulation of unsolved physical models. Toward this goal, we first need to apply the machine learning algorithm to well-understood models and see whether the outputs are consistent with our prior knowledge, which serves as the benchmark for this approach. In this work, we feed the computer data generated by the classical Monte Carlo simulation for the XY model in frustrated triangular and union jack lattices, which has two order parameters and exhibits two phase transitions. We show that the outputs of the principal component analysis agree very well with our understanding of different orders in different phases, and the temperature dependences of the major components detect the nature and the locations of the phase transitions. Our work offers promise for using machine learning techniques to study sophisticated statistical models, and our results can be further improved by using principal component analysis with kernel tricks and the neural network method.
We apply various unsupervised machine learning methods for phase classification to investigate the finite-temperature phase diagram of the spinless Falicov-Kimball model in two dimensions. Using only particle occupation snapshots from Monte Carlo simulations as input, each technique, including a straightforward classification based on principal component analysis (PCA), successfully identifies the phase boundary between ordered and disordered phases, independent of the type of phase transition. Remarkably, these techniques also distinguish between the weakly localized and Anderson-localized regimes within the disordered phase, accurately identifying their crossover, which is a challenging task for standard methods. Among the machine learning approaches used, PCA based analysis outperforms more complex methods, such as neural network predictors and autoencoders. These results underscore the effectiveness of simple unsupervised techniques in examining phase transitions and electron localization in complex correlated systems.
The recent advances in machine learning algorithms have boosted the application of these techniques to the field of condensed matter physics, in order e.g. to classify the phases of matter at equilibrium or to predict the real-time dynamics of a large class of physical models. Typically in these works, a machine learning algorithm is trained and tested on data coming from the same physical model. Here we demonstrate that unsupervised and supervised machine learning techniques are able to predict phases of a non-exactly solvable model when trained on data of a solvable model. In particular, we employ a training set made by single-particle correlation functions of a non-interacting quantum wire and by using principal component analysis, k-means clustering, t-distributed stochastic neighbor embedding and convolutional neural networks we reconstruct the phase diagram of an interacting superconductor. We show that both the principal component analysis and the convolutional neural networks trained on the data of the non-interacting model can identify the topological phases of the interacting model. Our findings indicate that non-trivial phases of matter emerging from the presence of interactions can be identified by means of unsupervised and supervised techniques applied to data of non-interacting systems.
Identifying phase boundaries of interacting systems is one of the key steps to understanding quantum many-body models. The development of various numerical and analytical methods has allowed exploring the phase diagrams of many Hermitian interacting systems. However, numerical challenges and scarcity of analytical solutions hinder obtaining phase boundaries in non-Hermitian many-body models. Recent machine learning methods have emerged as a potential strategy to learn phase boundaries from various observables without having access to the full many-body wavefunction. Here, we show that a machine learning methodology trained solely on Hermitian correlation functions allows identifying phase boundaries of non-Hermitian interacting models. These results demonstrate that Hermitian machine learning algorithms can be redeployed to non-Hermitian models without requiring further training to reveal non-Hermitian phase diagrams. Our findings establish transfer learning as a versatile strategy to leverage Hermitian physics to machine learning non-Hermitian phenomena.