Papers › Unsupervised learning of topological phase diagram using topological data analysis
Unsupervised learning of topological phase diagram using topological data analysis
Sungjoon Park, Yoonseok Hwang, Bohm-Jung Yang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Topology and machine learning are two actively researched topics not only in condensed matter physics, but also in data science. Here, we propose the use of topological data analysis in unsupervised learning of the topological phase diagrams. This is possible because the quantum distance can capture the shape of the space formed by the Bloch wavefunctions as we sweep over the Brillouin zone. Therefore, if we minimize the volume of the space formed by the wavefunction through a continuous deformation, the wavefunctions will end up forming distinct spaces which depend on the topology of the wavefunctions. Combining this observation with the topological data analysis, which provides tools such as the persistence diagram to capture the topology of the space formed by the wavefunctions, we can cluster together Hamiltonians that give rise to similar persistence diagrams after the deformation. By examining these clusters as well as representative persistence diagrams in the clusters, we can draw the phase diagram as well as distinguish between topologically trivial and nontrivial phases. Our proposal to minimize the volume can be interpreted as finding geodesics in 1D Brillouin zone, and minimal surfaces in 2D and higher-dimensional Brillouin zones. Using this interpretation, we can guarantee the convergence of the minimization under certain conditions, which is an outstanding feature of our algorithm. We demonstrate the working principles of our machine learning algorithm using various models.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections