Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.33802

Autonomous phase discovery

Shiyu Zhou, Yuxuan Zhang, Sebastian Wetzel, Roger Melko, Xiu-Zhe Luo

quant-phcond-mat.str-elcs.LGSubmitted Sep 27, 2026• Announced Sep 29, 2026• 1 citation
arXivHTMLPDF

Abstract

Understanding quantum phases of matter has long relied on physicists' intuition and mathematical tools such as symmetry and topology. Remarkably successful as these approaches have been, they provide no universal way to explore a Hamiltonian space whose organizing principle is not known in advance. In this work, we introduce a fully autonomous system combining differentiable programming and unsupervised learning for quantum phase discovery. The search evaluates ground-state data along an adaptive trajectory rather than on a predetermined parameter grid. We demonstrate the system with three different solvers and benchmark it against random sampling at equal ground-state-evaluation budgets. On a generalized cluster chain hosting up to $200$ distinct phases, the search finds up to $25$ more phases at the same budget, and matches random sampling given thirty times its budget. On a $50$-parameter Chern insulator, it reaches sectors not obtained by the simple harmonic constructions considered here, in a family whose inverse problem remains open, while recovering all sectors found by sampling. Our results establish autonomous, gradient-driven exploration of Hamiltonian space as a practical route to discovering quantum phases without phase labels or a prescribed target phase.

AI Summary

Can a search explore Hamiltonian parameter space for unfamiliar quantum phases without phase labels, target invariants, or a predetermined sweep? This paper combines a differentiable ground-state solver with an autoencoder: gradients increase distance from previously sampled states in latent space, while retraining incorporates newly visited regions. Long-horizon benchmarks additionally use parameter-space trail repulsion. Topological invariants are withheld from the search and used afterward to measure coverage. Demonstrations use exact diagonalization, imaginary-time evolution, and DMRG on small Ising, $\mathbb Z_2$ gauge, and transverse-field XXZ systems. The XXZ trajectory visits four gapped phases and registers the Luttinger-liquid line through a gradient-divergence event. Scaling tests use free-fermion representations and matched ground-state-evaluation budgets. A generalized cluster chain with up to $200$ couplings and winding sectors yields $5$–$25$ more sectors than Gaussian random sampling for $d\geq40$; $10^4$ evaluations exceed random sampling’s coverage at $3\times10^5$. In a $50$-parameter Chern-insulator family, the median coverage at $3\times10^5$ evaluations is $207$ sectors versus $139$. Pooling five runs yields $283$ versus $160$, including every randomly found sector, but does not extend known extremal Chern numbers. Stated limitations include repeated evaluations within visited sectors, retraining overhead, and dependence on phase geometry and connectivity. Large-scale evidence is restricted to free fermions; benchmark families are tuned separately. The Chern encoder’s grid misses two couplings, and evaluation labels agree with a finer-grid reference on $98.2\%$ of points. Matched evaluation counts do not establish matched computational cost.

Little sign of AI-generated textOverclaimsMissing comparisonPossible error

Error found: The Chern-sector coverage totals lack demonstrated sector-by-sector certification, and equal pointwise labeling-error rates do not establish equal bias in distinct-sector counts. Ground-truth phase coverage enters offline hyperparameter selection, so the label-free claim applies to the deployed search rather than the entire configuration-selection pipeline. The 32×32 Chern input grid makes the two highest sine-harmonic coefficients invisible to the learned novelty objective, although the physical family still has 50 parameters.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 5 figures, https://github.com/shiyu-zhou-7/diff_phase

Related papers

Gradient-based search of quantum phases: discovering unconventional fractional Chern insulators

André Grossi Fonseca, Wang, Eric, Sachin Vaidya +3 more

The discovery and understanding of new quantum phases has time and again transformed both fundamental physics and technology, yet progress often relies on slow, intuition-based theoretical considerations or experimental serendipity. Here, we introduce a general gradient-based framework for targeted phase discovery. We define a differentiable function, dubbed "target-phase loss function", which encodes fingerprints of a quantum state, thereby recasting phase search as a tractable optimization problem in Hamiltonian space. The method is broadly applicable to a wide range of symmetry-broken and topological orders and can be interfaced with most many-body numerical solvers. As a demonstration, we apply it to spinless fermions on the kagome lattice using exact diagonalization and discover two distinctive fractional Chern insulators (FCIs): (i) at filling $ν= 1/3$, a "non-ideal" Abelian FCI whose band geometry lies far beyond the Landau-level mimicry paradigm and all recent generalizations; and (ii) at $ν= 1/2$, a non-Abelian FCI stabilized purely by finite-range two-body interactions. These results provide the first explicit realization of such types of FCIs and establish a versatile paradigm for systematic quantum-phase discovery.

arXiv:2509.10438•Sep 12, 2025•13 citations

QuantumMatterExplorer: An Autonomous Agent for the Discovery of Quantum Many-Body Phases of Matter

Jannes Nys, Andrew Jreissaty, Juan Carrasquilla

Mapping the phase diagram of a new quantum Hamiltonian demands expert judgement at every step: which observables to measure, where in parameter space to compute, or how to separate genuine order from finite-size artefacts. We introduce QuantumMatterExplorer, an autonomous agent that takes only a Hamiltonian and its parameter ranges as input and returns a phase diagram obtained from its own numerical simulations. The agent is built on a large language model and is designed to reason over a long horizon, maintain a persistent written plan, and drive a set of computational tools, with density-matrix renormalization group (DMRG) calculations cross-checked against independent exact diagonalization. The agent combines a large language model with persistent planning, a library of expert computational-physics skills, and density-matrix renormalization group calculations validated against independent exact diagonalization. It adaptively selects quantities to evaluate, refines parameter scans, and performs finite-size analyses as evidence accumulates. After validating the approach on Hamiltonians with known transitions, we challenge it with a frustrated bilinear-biquadratic spin-1 chain with single-ion anisotropy, whose two-dimensional phase diagram was published only recently and is unlikely to appear in any training corpus. Given no hint about the expected physics, the agent proposes which observables to probe, and identifies candidate Néel, Haldane and dimerized phases, in broad agreement with the reference phase diagram. It also detects incommensurate correlations and infers the frustration-dependent geometry of the phase boundaries, all within an eight-hour compute budget. These results open a practical route to the autonomous computational discovery of new phases of quantum matter.

quant-pharXiv:2610.32001•Oct 26, 2026•0 citations

Unsupervised classification of non-Hermitian topological phases under symmetries

Yang Long, Haoran Xue, Baile Zhang

The integration of machine learning into fundamental science has opened new avenues for addressing long-standing challenges rooted in mathematical limitations. For instance, while topological invariants are essential for characterizing topological phases of matter, no single invariant is universally applicable. This limitation explains why, over decades of classifying topological phases-primarily in Hermitian systems-many phases initially deemed 'trivial' were later recognized as topological. Recently, the discovery of non-Hermitian band topology has driven substantial efforts in non-Hermitian topological classification, leading to the development of new topological invariants. However, these invariants still fail to capture all non-Hermitian topological features. Here, without relying on any topological invariant, we develop a machine-learning algorithm for the unsupervised classification of symmetry-protected non-Hermitian topological phases. By utilizing random Hamiltonians, we unsupervisedly construct a topological periodic table without requiring advanced mathematical knowledge. Furthermore, based on the learning results, we derive a formula that reveals the impact of parity transformation on periodicity. Our algorithm can also account for boundary effects, enabling the exploration of open-boundary influences on the topological phase diagram. These findings establish an unsupervised approach for classifying symmetry-protected non-Hermitian topological phases, uncover previously unnoticed topological features in non-Hermitian systems, and provide valuable guidance for both theoretical advancements and experimental realizations.

arXiv:2412.20882•National Science Review•Nov 26, 2025•0 citations

Unsupervised identification of topological phase transitions using predictive models

Eliška Greplová, Agnes Valenti, Gregor Boschung +3 more

Abstract Machine-learning driven models have proven to be powerful tools for the identification of phases of matter. In particular, unsupervised methods hold the promise to help discover new phases of matter without the need for any prior theoretical knowledge. While for phases characterized by a broken symmetry, the use of unsupervised methods has proven to be successful, topological phases without a local order parameter seem to be much harder to identify without supervision. Here, we use an unsupervised approach to identify boundaries of the topological phases. We train artificial neural nets to relate configurational data or measurement outcomes to quantities like temperature or tuning parameters in the Hamiltonian. The accuracy of these predictive models can then serve as an indicator for phase transitions. We successfully illustrate this approach on both the classical Ising gauge theory as well as on the quantum ground state of a generalized toric code.

arXiv:1910.10124•New Journal of Physics•Feb 18, 2020•76 citations

Identifying quantum phase transitions with adversarial neural networks

Patrick Huembeli, Alexandre Dauphin, Péter Wittek

The identification of phases of matter is a challenging task, especially in quantum mechanics, where the complexity of the ground state appears to grow exponentially with the size of the system. Traditionally, physicists have to identify the relevant order parameters for the classification of the different phases. We here follow a radically different approach: we address this problem with a state-of-the-art deep learning technique, adversarial domain adaptation. We derive the phase diagram of the whole parameter space starting from a fixed and known subspace using unsupervised learning. This method has the advantage that the input of the algorithm can be directly the ground state without any ad hoc feature engineering. Furthermore, the dimension of the parameter space is unrestricted. More specifically, the input data set contains both labeled and unlabeled data instances. The first kind is a system that admits an accurate analytical or numerical solution, and one can recover its phase diagram. The second type is the physical system with an unknown phase diagram. Adversarial domain adaptation uses both types of data to create invariant feature extracting layers in a deep learning architecture. Once these layers are trained, we can attach an unsupervised learner to the network to find phase transitions. We show the success of this technique by applying it on several paradigmatic models: the Ising model with different temperatures, the Bose-Hubbard model, and the Su-Schrieffer-Heeger model with disorder. The method finds unknown transitions successfully and predicts transition points in close agreement with standard methods. This study opens the door to the classification of physical systems where the phase boundaries are complex such as the many-body localization problem or the Bose glass phase.

arXiv:1710.08382•Physical review. B./Physical review. B•Apr 11, 2018•128 citations

Unsupervised Machine Learning and Band Topology

Mathias S. Scheurer, Robert-Jan Slager

The study of topological band structures is an active area of research in condensed matter physics and beyond. Here, we combine recent progress in this field with developments in machine learning, another rising topic of interest. Specifically, we introduce an unsupervised machine learning approach that searches for and retrieves paths of adiabatic deformations between Hamiltonians, thereby clustering them according to their topological properties. The algorithm is general, as it does not rely on a specific parametrization of the Hamiltonian and is readily applicable to any symmetry class. We demonstrate the approach using several different models in both one and two spatial dimensions and for different symmetry classes with and without crystalline symmetries. Accordingly, it is also shown how trivial and topological phases can be diagnosed upon comparing with a generally designated set of trivial atomic insulators.

arXiv:2001.01711•Physical Review Letters•Jun 1, 2020•160 citations
Understanding quantum phases of matter has long relied on physicists' intuition and mathematical tools such as symmetry and topology. Remarkably successful as these approaches have been, they provide no universal way to explore a Hamiltonian space whose organizing principle is not known in advance. In this work, we introduce a fully autonomous system combining differentiable programming and unsupervised learning for quantum phase discovery. The search evaluates ground-state data along an adaptive trajectory rather than on a predetermined parameter grid. We demonstrate the system with three different solvers and benchmark it against random sampling at equal ground-state-evaluation budgets. On a generalized cluster chain hosting up to 200200200 distinct phases, the search finds up to 252525 more phases at the same budget, and matches random sampling given thirty times its budget. On a 505050-parameter Chern insulator, it reaches sectors not obtained by the simple harmonic constructions considered here, in a family whose inverse problem remains open, while recovering all sectors found by sampling. Our results establish autonomous, gradient-driven exploration of Hamiltonian space as a practical route to discovering quantum phases without phase labels or a prescribed target phase.
Can a search explore Hamiltonian parameter space for unfamiliar quantum phases without phase labels, target invariants, or a predetermined sweep? This paper combines a differentiable ground-state solver with an autoencoder: gradients increase distance from previously sampled states in latent space, while retraining incorporates newly visited regions. Long-horizon benchmarks additionally use parameter-space trail repulsion. Topological invariants are withheld from the search and used afterward to measure coverage.
Demonstrations use exact diagonalization, imaginary-time evolution, and DMRG on small Ising, Z2\mathbb Z_2Z2​ gauge, and transverse-field XXZ systems. The XXZ trajectory visits four gapped phases and registers the Luttinger-liquid line through a gradient-divergence event. Scaling tests use free-fermion representations and matched ground-state-evaluation budgets. A generalized cluster chain with up to 200200200 couplings and winding sectors yields 555–252525 more sectors than Gaussian random sampling for d≥40d\geq40d≥40; 10410^4104 evaluations exceed random sampling’s coverage at 3×1053\times10^53×105. In a 505050-parameter Chern-insulator family, the median coverage at 3×1053\times10^53×105 evaluations is 207207207 sectors versus 139139139. Pooling five runs yields 283283283 versus 160160160, including every randomly found sector, but does not extend known extremal Chern numbers.
Stated limitations include repeated evaluations within visited sectors, retraining overhead, and dependence on phase geometry and connectivity. Large-scale evidence is restricted to free fermions; benchmark families are tuned separately. The Chern encoder’s grid misses two couplings, and evaluation labels agree with a finer-grid reference on 98.2%98.2\%98.2% of points. Matched evaluation counts do not establish matched computational cost.
The discovery and understanding of new quantum phases has time and again transformed both fundamental physics and technology, yet progress often relies on slow, intuition-based theoretical considerations or experimental serendipity. Here, we introduce a general gradient-based framework for targeted phase discovery. We define a differentiable function, dubbed "target-phase loss function", which encodes fingerprints of a quantum state, thereby recasting phase search as a tractable optimization problem in Hamiltonian space. The method is broadly applicable to a wide range of symmetry-broken and topological orders and can be interfaced with most many-body numerical solvers. As a demonstration, we apply it to spinless fermions on the kagome lattice using exact diagonalization and discover two distinctive fractional Chern insulators (FCIs): (i) at filling ν=1/3ν= 1/3ν=1/3, a "non-ideal" Abelian FCI whose band geometry lies far beyond the Landau-level mimicry paradigm and all recent generalizations; and (ii) at ν=1/2ν= 1/2ν=1/2, a non-Abelian FCI stabilized purely by finite-range two-body interactions. These results provide the first explicit realization of such types of FCIs and establish a versatile paradigm for systematic quantum-phase discovery.
Mapping the phase diagram of a new quantum Hamiltonian demands expert judgement at every step: which observables to measure, where in parameter space to compute, or how to separate genuine order from finite-size artefacts. We introduce QuantumMatterExplorer, an autonomous agent that takes only a Hamiltonian and its parameter ranges as input and returns a phase diagram obtained from its own numerical simulations. The agent is built on a large language model and is designed to reason over a long horizon, maintain a persistent written plan, and drive a set of computational tools, with density-matrix renormalization group (DMRG) calculations cross-checked against independent exact diagonalization. The agent combines a large language model with persistent planning, a library of expert computational-physics skills, and density-matrix renormalization group calculations validated against independent exact diagonalization. It adaptively selects quantities to evaluate, refines parameter scans, and performs finite-size analyses as evidence accumulates. After validating the approach on Hamiltonians with known transitions, we challenge it with a frustrated bilinear-biquadratic spin-1 chain with single-ion anisotropy, whose two-dimensional phase diagram was published only recently and is unlikely to appear in any training corpus. Given no hint about the expected physics, the agent proposes which observables to probe, and identifies candidate Néel, Haldane and dimerized phases, in broad agreement with the reference phase diagram. It also detects incommensurate correlations and infers the frustration-dependent geometry of the phase boundaries, all within an eight-hour compute budget. These results open a practical route to the autonomous computational discovery of new phases of quantum matter.
The integration of machine learning into fundamental science has opened new avenues for addressing long-standing challenges rooted in mathematical limitations. For instance, while topological invariants are essential for characterizing topological phases of matter, no single invariant is universally applicable. This limitation explains why, over decades of classifying topological phases-primarily in Hermitian systems-many phases initially deemed 'trivial' were later recognized as topological. Recently, the discovery of non-Hermitian band topology has driven substantial efforts in non-Hermitian topological classification, leading to the development of new topological invariants. However, these invariants still fail to capture all non-Hermitian topological features. Here, without relying on any topological invariant, we develop a machine-learning algorithm for the unsupervised classification of symmetry-protected non-Hermitian topological phases. By utilizing random Hamiltonians, we unsupervisedly construct a topological periodic table without requiring advanced mathematical knowledge. Furthermore, based on the learning results, we derive a formula that reveals the impact of parity transformation on periodicity. Our algorithm can also account for boundary effects, enabling the exploration of open-boundary influences on the topological phase diagram. These findings establish an unsupervised approach for classifying symmetry-protected non-Hermitian topological phases, uncover previously unnoticed topological features in non-Hermitian systems, and provide valuable guidance for both theoretical advancements and experimental realizations.
Abstract Machine-learning driven models have proven to be powerful tools for the identification of phases of matter. In particular, unsupervised methods hold the promise to help discover new phases of matter without the need for any prior theoretical knowledge. While for phases characterized by a broken symmetry, the use of unsupervised methods has proven to be successful, topological phases without a local order parameter seem to be much harder to identify without supervision. Here, we use an unsupervised approach to identify boundaries of the topological phases. We train artificial neural nets to relate configurational data or measurement outcomes to quantities like temperature or tuning parameters in the Hamiltonian. The accuracy of these predictive models can then serve as an indicator for phase transitions. We successfully illustrate this approach on both the classical Ising gauge theory as well as on the quantum ground state of a generalized toric code.
The identification of phases of matter is a challenging task, especially in quantum mechanics, where the complexity of the ground state appears to grow exponentially with the size of the system. Traditionally, physicists have to identify the relevant order parameters for the classification of the different phases. We here follow a radically different approach: we address this problem with a state-of-the-art deep learning technique, adversarial domain adaptation. We derive the phase diagram of the whole parameter space starting from a fixed and known subspace using unsupervised learning. This method has the advantage that the input of the algorithm can be directly the ground state without any ad hoc feature engineering. Furthermore, the dimension of the parameter space is unrestricted. More specifically, the input data set contains both labeled and unlabeled data instances. The first kind is a system that admits an accurate analytical or numerical solution, and one can recover its phase diagram. The second type is the physical system with an unknown phase diagram. Adversarial domain adaptation uses both types of data to create invariant feature extracting layers in a deep learning architecture. Once these layers are trained, we can attach an unsupervised learner to the network to find phase transitions. We show the success of this technique by applying it on several paradigmatic models: the Ising model with different temperatures, the Bose-Hubbard model, and the Su-Schrieffer-Heeger model with disorder. The method finds unknown transitions successfully and predicts transition points in close agreement with standard methods. This study opens the door to the classification of physical systems where the phase boundaries are complex such as the many-body localization problem or the Bose glass phase.
The study of topological band structures is an active area of research in condensed matter physics and beyond. Here, we combine recent progress in this field with developments in machine learning, another rising topic of interest. Specifically, we introduce an unsupervised machine learning approach that searches for and retrieves paths of adiabatic deformations between Hamiltonians, thereby clustering them according to their topological properties. The algorithm is general, as it does not rely on a specific parametrization of the Hamiltonian and is readily applicable to any symmetry class. We demonstrate the approach using several different models in both one and two spatial dimensions and for different symmetry classes with and without crystalline symmetries. Accordingly, it is also shown how trivial and topological phases can be diagnosed upon comparing with a generally designated set of trivial atomic insulators.