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:2607.10656

Learning Topological Quantum Phases from Limited Subsystems

Mehran Khosrojerdi, Sougato Bose, Alessandro Cuccoli, Paola Verrucchi, Abolfazl Bayat, Leonardo Banchi

quant-phcond-mat.stat-mechcond-mat.str-elcs.LGSubmitted Jul 12, 2026• Announced Jul 14, 2026• 0 citations
arXivHTMLPDF

Abstract

Characterizing quantum topological phases requires measuring non-local string order parameters, demanding access to the full system, which is often experimentally unfeasible. In this work, we introduce a data-efficient supervised learning framework that circumvents this limitation by recognizing quantum phases from small subsystems. Our protocol utilizes a quantum kernel constructed from the reduced density matrices of these subsystems, which can be efficiently estimated experimentally. We benchmark our framework with the classification of the phase diagrams of two spin models on one-dimensional lattices, namely the generalized cluster-Ising spin-1/2 chain and the anisotropic Haldane spin-1 chain. Remarkably, our approach achieves high accuracy in phase classification when operations are limited to as few as one to four sites, and it also generalizes to longer chains even when trained on moderate system sizes. These findings demonstrate that local reduced density matrices preserve vital signatures of global topological phases, offering a practical route to characterize rich phase diagrams of quantum many-body systems.

AI Summary

The paper asks whether phases in one-dimensional spin systems, including symmetry-protected topological (SPT) phases, can be recognized when measurements are restricted to a small subsystem rather than nonlocal string observables. It studies supervised classification within known phase diagrams, using local information to distinguish phases without directly measuring their topological order. The method feeds the reduced-density-matrix overlap $K(x,x')=\mathrm{Tr}[\rho_A(x)\rho_A(x')]$ into a classical support-vector machine. Training examples are ground states labeled using established phase diagrams; reduced states are calculated from matrix-product-state simulations. Benchmarks cover the generalized cluster-Ising spin-$1/2$ chain and an anisotropic spin-$1$ Haldane chain. Subsystems comprise one to four contiguous sites, located either centrally or at an edge. For the cluster-Ising model, three-site central blocks identify the phases accurately, with four sites improving their resolution. A single central site separates the SPT region from alternatives but fails to distinguish antiferromagnetic and paramagnetic regions. For the Haldane model, even one central site reproduces much of the phase structure, while identifying Néel phases improves with block size. Central blocks generally outperform edge blocks. Training on chains of length $31$ and testing on length $51$ gives results comparable to training and testing at length $51$. The stated qualification is that recognition relies on prior phase labels and model-specific differences between local reduced states: single-site data do not directly capture nonlocal topological correlations. Experimental overlap-estimation methods are discussed, but the reported demonstrations are numerical.

Little sign of AI-generated textIncrementalMissing comparisonOverclaims

Error found: The paper claims data and experimental efficiency without reporting training-set sizes, measurement-cost estimates, or finite-shot performance. Matching classification accuracies at chain lengths 31 and 51 does not establish the claimed convergence or system-size independence of subsystem density matrices. The stated soft-margin SVM prediction rule uses an incorrect general formula for the intercept, although the paper does not establish whether its numerical implementation used that formula.

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

Related papers

Quantum Data Learning of Topological-to-Ferromagnetic Phase Transitions in the 2+1D Toric Code Loop Gas Model

Shamminuj Aktar, Rishabh Bhardwaj, Andreas Bärtschi +2 more

Quantum data learning (QDL) provides a framework for extracting physical insights directly from quantum states, bypassing the need for any identification of the classical observable of the theory. A central challenge in many-body physics is that the identity of quantum phases, especially those with topological order, are often inaccessible through local observables or simple symmetry-breaking diagnostics. Here, we apply QDL techniques to the 2+1-dimensional toric-code loop-gas model in a magnetic field. Ground states are generated across multiple lattice sizes using a parametrized loop-gas circuit (PLGC) with a variational quantum-eigensolver (VQE) approach. We then train a quantum convolutional neural network (QCNN) across the full field-parameter range to perform phase classification and capture the overall phase structure. We also employ a physics-aware training protocol that excludes the near-critical region (0.2 <= x <= 0.4)) around (x_c = 0.25), the phase-transition point estimated by quantum Monte Carlo, reserving this window for testing to evaluate the ability of the model to learn the phase transition. In parallel, we implement an unsupervised quantum k-means method based on state overlaps, which partitions the dataset into two phases without prior labeling. Our supervised QDL approach recovers the phase structure and accurately locates the phase transition, in close agreement with previously reported values; the unsupervised QDL approach recovers the phase structure and locates the phase transition with a small offset as expected in finite volumes; both QDL methods outperform classical alternatives. These findings establish QDL as an effective framework for characterizing topological quantum matter, studying finite volume effects, and probing phase diagrams of higher-dimensional systems.

quant-pharXiv:2511.16851•Physical review. D/Physical review. D.•Nov 24, 2025•0 citations

Unveiling phase transitions with machine learning

Askery Canabarro, F. F. Fanchini, André Luiz Malvezzi +2 more

The classification of phase transitions is a central and challenging task in condensed matter physics. Typically, it relies on the identification of order parameters and the analysis of singularities in the free energy and its derivatives. Here, we propose an alternative framework to identify quantum phase transitions, employing both unsupervised and supervised machine learning techniques. Using the axial next-nearest-neighbor Ising (ANNNI) model as a benchmark, we show how unsupervised learning can detect three phases (ferromagnetic, paramagnetic, and a cluster of the antiphase with the floating phase) as well as two distinct regions within the paramagnetic phase. Employing supervised learning we show that transfer learning becomes possible: a machine trained only with nearest-neighbor interactions can learn to identify a new type of phase occurring when next-nearest-neighbor interactions are introduced. All our results rely on few- and low-dimensional input data (up to twelve lattice sites), thus providing a computational friendly and general framework for the study of phase transitions in many-body systems.

arXiv:1904.01486•Physical review. B./Physical review. B•Jul 22, 2019•96 citations

Realizing quantum convolutional neural networks on a superconducting quantum processor to recognize quantum phases

J. Herrmann, Sergi Masot-Llima, Ants Remm +15 more

Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct measurements and classically computed correlations become computationally expensive when increasing the system size. Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. Here, we realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological (SPT) phases of a spin model characterized by a non-zero string order parameter. We benchmark the performance of the QCNN based on approximate ground states of a family of cluster-Ising Hamiltonians which we prepare using a hardware-efficient, low-depth state preparation circuit. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.

arXiv:2109.05909•Nature Communications•Jul 16, 2022•111 citations

Probing quantum phase transitions via short depth quantum circuits for estimating quantum coherence and discrete Berry phases

Dhiman Bowmick, Deren Liu, Pinaki Sengupta +1 more

Abstract Classical techniques for the simulation of complex many-body systems can be severely limited by the exponentially increasing dimensions of quantum systems, and prior assumptions are often required to efficiently extract information about non-local quantum properties. Short depth quantum algorithms are proposed that efficiently estimate non-local quantum properties such as the quantum coherence and discrete Berry phases to probe the quantum phase transitions in many body systems. The gate complexities of these algorithms scale linearly while the depth complexity scale logarithmically with system size. These algorithms are applied to probe the well-known Haldane to quantum paramagnetic phase transitions in spin-1 Heisenberg antiferromagnetic chains, which are topological phase transitions that cannot be identified via local order parameters. The algorithms are shown to be able to extract non-local information about the system give the correct signatures of topological phase transitions near critical points.

•Jun 2, 2023•0 citations

Bootstrap certification of string order in quantum spin chains

Sagnik Banerjee, Haoyu Guo, Debanjan Chowdhury

The many-body bootstrap certifies ground-state properties by minimizing energy over correlators constrained only by positivity, without any variational wavefunction. Its cost, however, grows exponentially with the size of the operators involved, placing the long-range string correlators that diagnose topological phases out of reach. We overcome this by treating string operators as primary objects: bare and endpoint-dressed strings satisfy a closed operator algebra with one another and with local words, yielding a semidefinite program whose cost grows only polynomially with string length. A single computation then yields estimates of string correlators of all lengths. Rigorous two-sided bounds are obtained for each target string once the ground-state energy is pinned within a window. When benchmarked against density-matrix renormalization group computations on the cluster Ising and spin$-1$ Heisenberg chains, the method certifies the nonlocal string order of the cluster and Haldane phases directly from the Hamiltonian. Our rigorous certification of string order parameters reveal that the sharpness of the bounds is set by which operators enter the calculation, not by their length alone. By exploiting algebraic closure of strings and local words, our framework lifts spatially extended observables into polynomially tractable bootstrap variables, opening up a route to wavefunction-free certification of nonlocal order in quantum many-body systems.

cond-mat.str-elCross-listedarXiv:2609.22420•Sep 22, 2026•0 citations

Learning ground state observables from quantum computing experiments

Ben Jaderberg, Freya Shah, Minjun Jeon +3 more

Recent theoretical progress has established conditions under which machine learning models can efficiently predict ground-state properties of gapped local Hamiltonians when trained on quantum-generated data. Previous experimental demonstrations in this paradigm, however, have largely been limited to small systems or highly structured states, due to the difficulty of preparing many-body ground states on quantum processors. In this work, we demonstrate learning from experimental quantum data generated from approximate ground states of the two-dimensional Heisenberg XXZ model with system sizes up to 115 qubits. We construct a dataset of single-site expectation values, two-point correlations, and 12-body loop correlations across the antiferromagnetic phase. We then train neural networks on this data and show that they can accurately predict spatially resolved observables for previously unseen Hamiltonian parameters, both within the training distribution and in an out-of-distribution regime approaching the phase boundary. Our results demonstrate the practical realization of learning from quantum data for an interacting two-dimensional many-body system at scale, motivating a path toward regimes where quantum processors could provide training data beyond the reach of classical approximation methods.

quant-pharXiv:2606.15983•Jun 16, 2026•0 citations
Characterizing quantum topological phases requires measuring non-local string order parameters, demanding access to the full system, which is often experimentally unfeasible. In this work, we introduce a data-efficient supervised learning framework that circumvents this limitation by recognizing quantum phases from small subsystems. Our protocol utilizes a quantum kernel constructed from the reduced density matrices of these subsystems, which can be efficiently estimated experimentally. We benchmark our framework with the classification of the phase diagrams of two spin models on one-dimensional lattices, namely the generalized cluster-Ising spin-1/2 chain and the anisotropic Haldane spin-1 chain. Remarkably, our approach achieves high accuracy in phase classification when operations are limited to as few as one to four sites, and it also generalizes to longer chains even when trained on moderate system sizes. These findings demonstrate that local reduced density matrices preserve vital signatures of global topological phases, offering a practical route to characterize rich phase diagrams of quantum many-body systems.
The paper asks whether phases in one-dimensional spin systems, including symmetry-protected topological (SPT) phases, can be recognized when measurements are restricted to a small subsystem rather than nonlocal string observables. It studies supervised classification within known phase diagrams, using local information to distinguish phases without directly measuring their topological order.
The method feeds the reduced-density-matrix overlap K(x,x′)=Tr[ρA(x)ρA(x′)]K(x,x')=\mathrm{Tr}[\rho_A(x)\rho_A(x')]K(x,x′)=Tr[ρA​(x)ρA​(x′)] into a classical support-vector machine. Training examples are ground states labeled using established phase diagrams; reduced states are calculated from matrix-product-state simulations. Benchmarks cover the generalized cluster-Ising spin-1/21/21/2 chain and an anisotropic spin-111 Haldane chain. Subsystems comprise one to four contiguous sites, located either centrally or at an edge.
For the cluster-Ising model, three-site central blocks identify the phases accurately, with four sites improving their resolution. A single central site separates the SPT region from alternatives but fails to distinguish antiferromagnetic and paramagnetic regions. For the Haldane model, even one central site reproduces much of the phase structure, while identifying Néel phases improves with block size. Central blocks generally outperform edge blocks. Training on chains of length 313131 and testing on length 515151 gives results comparable to training and testing at length 515151.
The stated qualification is that recognition relies on prior phase labels and model-specific differences between local reduced states: single-site data do not directly capture nonlocal topological correlations. Experimental overlap-estimation methods are discussed, but the reported demonstrations are numerical.
Quantum data learning (QDL) provides a framework for extracting physical insights directly from quantum states, bypassing the need for any identification of the classical observable of the theory. A central challenge in many-body physics is that the identity of quantum phases, especially those with topological order, are often inaccessible through local observables or simple symmetry-breaking diagnostics. Here, we apply QDL techniques to the 2+1-dimensional toric-code loop-gas model in a magnetic field. Ground states are generated across multiple lattice sizes using a parametrized loop-gas circuit (PLGC) with a variational quantum-eigensolver (VQE) approach. We then train a quantum convolutional neural network (QCNN) across the full field-parameter range to perform phase classification and capture the overall phase structure. We also employ a physics-aware training protocol that excludes the near-critical region (0.2 <= x <= 0.4)) around (x_c = 0.25), the phase-transition point estimated by quantum Monte Carlo, reserving this window for testing to evaluate the ability of the model to learn the phase transition. In parallel, we implement an unsupervised quantum k-means method based on state overlaps, which partitions the dataset into two phases without prior labeling. Our supervised QDL approach recovers the phase structure and accurately locates the phase transition, in close agreement with previously reported values; the unsupervised QDL approach recovers the phase structure and locates the phase transition with a small offset as expected in finite volumes; both QDL methods outperform classical alternatives. These findings establish QDL as an effective framework for characterizing topological quantum matter, studying finite volume effects, and probing phase diagrams of higher-dimensional systems.
The classification of phase transitions is a central and challenging task in condensed matter physics. Typically, it relies on the identification of order parameters and the analysis of singularities in the free energy and its derivatives. Here, we propose an alternative framework to identify quantum phase transitions, employing both unsupervised and supervised machine learning techniques. Using the axial next-nearest-neighbor Ising (ANNNI) model as a benchmark, we show how unsupervised learning can detect three phases (ferromagnetic, paramagnetic, and a cluster of the antiphase with the floating phase) as well as two distinct regions within the paramagnetic phase. Employing supervised learning we show that transfer learning becomes possible: a machine trained only with nearest-neighbor interactions can learn to identify a new type of phase occurring when next-nearest-neighbor interactions are introduced. All our results rely on few- and low-dimensional input data (up to twelve lattice sites), thus providing a computational friendly and general framework for the study of phase transitions in many-body systems.
Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct measurements and classically computed correlations become computationally expensive when increasing the system size. Quantum neural networks tailored to recognize specific features of quantum states by combining unitary operations, measurements and feedforward promise to require fewer measurements and to tolerate errors. Here, we realize a quantum convolutional neural network (QCNN) on a 7-qubit superconducting quantum processor to identify symmetry-protected topological (SPT) phases of a spin model characterized by a non-zero string order parameter. We benchmark the performance of the QCNN based on approximate ground states of a family of cluster-Ising Hamiltonians which we prepare using a hardware-efficient, low-depth state preparation circuit. We find that, despite being composed of finite-fidelity gates itself, the QCNN recognizes the topological phase with higher fidelity than direct measurements of the string order parameter for the prepared states.
Abstract Classical techniques for the simulation of complex many-body systems can be severely limited by the exponentially increasing dimensions of quantum systems, and prior assumptions are often required to efficiently extract information about non-local quantum properties. Short depth quantum algorithms are proposed that efficiently estimate non-local quantum properties such as the quantum coherence and discrete Berry phases to probe the quantum phase transitions in many body systems. The gate complexities of these algorithms scale linearly while the depth complexity scale logarithmically with system size. These algorithms are applied to probe the well-known Haldane to quantum paramagnetic phase transitions in spin-1 Heisenberg antiferromagnetic chains, which are topological phase transitions that cannot be identified via local order parameters. The algorithms are shown to be able to extract non-local information about the system give the correct signatures of topological phase transitions near critical points.
The many-body bootstrap certifies ground-state properties by minimizing energy over correlators constrained only by positivity, without any variational wavefunction. Its cost, however, grows exponentially with the size of the operators involved, placing the long-range string correlators that diagnose topological phases out of reach. We overcome this by treating string operators as primary objects: bare and endpoint-dressed strings satisfy a closed operator algebra with one another and with local words, yielding a semidefinite program whose cost grows only polynomially with string length. A single computation then yields estimates of string correlators of all lengths. Rigorous two-sided bounds are obtained for each target string once the ground-state energy is pinned within a window. When benchmarked against density-matrix renormalization group computations on the cluster Ising and spin−1-1−1 Heisenberg chains, the method certifies the nonlocal string order of the cluster and Haldane phases directly from the Hamiltonian. Our rigorous certification of string order parameters reveal that the sharpness of the bounds is set by which operators enter the calculation, not by their length alone. By exploiting algebraic closure of strings and local words, our framework lifts spatially extended observables into polynomially tractable bootstrap variables, opening up a route to wavefunction-free certification of nonlocal order in quantum many-body systems.
Recent theoretical progress has established conditions under which machine learning models can efficiently predict ground-state properties of gapped local Hamiltonians when trained on quantum-generated data. Previous experimental demonstrations in this paradigm, however, have largely been limited to small systems or highly structured states, due to the difficulty of preparing many-body ground states on quantum processors. In this work, we demonstrate learning from experimental quantum data generated from approximate ground states of the two-dimensional Heisenberg XXZ model with system sizes up to 115 qubits. We construct a dataset of single-site expectation values, two-point correlations, and 12-body loop correlations across the antiferromagnetic phase. We then train neural networks on this data and show that they can accurately predict spatially resolved observables for previously unseen Hamiltonian parameters, both within the training distribution and in an out-of-distribution regime approaching the phase boundary. Our results demonstrate the practical realization of learning from quantum data for an interacting two-dimensional many-body system at scale, motivating a path toward regimes where quantum processors could provide training data beyond the reach of classical approximation methods.