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:2109.02686 · Physical Review A

Quantum kernels to learn the phases of quantum matter

Teresa Sancho-Lorente, Juan Román-Roche, David Zueco

Published Apr 25, 2022• 24 citations
arXivHTMLPDF

Abstract

Classical machine learning has succeeded in the prediction of both classical and quantum phases of matter. Notably, kernel methods stand out for their ability to provide interpretable results, relating the learning process with the physical order parameter explicitly. Here we exploit quantum kernels instead. They are naturally related to the fidelity, and thus it is possible to interpret the learning process with the help of quantum information tools. In particular, we use a support vector machine (with a quantum kernel) to predict and characterize second-order quantum phase transitions. We explain and understand the process of learning when the fidelity per site (rather than the fidelity) is used. The general theory is tested in the Ising chain in transverse field. We show that for small-sized systems, the algorithm gives accurate results, even when trained away from criticality. Besides, for larger sizes we confirm the success of the technique by extracting the correct critical exponent $\ensuremath{\nu}$. Finally, we present two algorithms, one based on fidelity and one based on the fidelity per site, to classify the phases of matter in a quantum processor.

DOI
10.1103/physreva.105.042432

Related papers

Kernel methods for interpretable machine learning of order parameters

Pedro Ponte, Roger G. Melko

Machine learning is capable of discriminating phases of matter, and finding associated phase transitions, directly from large data sets of raw state configurations. In the context of condensed matter physics, most progress in the field of supervised learning has come from employing neural networks as classifiers. Although very powerful, such algorithms suffer from a lack of interpretability, which is usually desired in scientific applications in order to associate learned features with physical phenomena. In this paper, we explore support vector machines (SVMs), which are a class of supervised kernel methods that provide interpretable decision functions. We find that SVMs can learn the mathematical form of physical discriminators, such as order parameters and Hamiltonian constraints, for a set of two-dimensional spin models: the ferromagnetic Ising model, a conserved-order-parameter Ising model, and the Ising gauge theory. The ability of SVMs to provide interpretable classification highlights their potential for automating feature detection in both synthetic and experimental data sets for condensed matter and other many-body systems.

arXiv:1704.05848•Physical review. B./Physical review. B•Nov 27, 2017•136 citations

Finite-size resource scaling for learning quantum phase transitions with fidelity-based support vector machines

Aaqib Ali, Giovanni Scala, Cosmo Lupo +1 more

Quantum kernels offer a valid procedure for learning quantum phase transitions on quantum processing devices, yet issues on the scalability of the learning strategy in connection with the symmetry of the critical model have not been clarified. We derive a link between model symmetry and fidelity-kernel resource scaling. We quantify the measurement resources required to estimate fidelity-based quantum kernels for many-body ground states while preserving the structure of the resulting Gram matrix under finite-shot sampling. Crucially, we show that increasing symmetry in the underlying spin model systematically amplifies these shot requirements. Moving from the $\mathbb{Z}_2$-symmetric Ising/XY regimes to the $U(1)$-symmetric XX (and XXZ) regimes leads to stronger kernel concentration and therefore substantially larger shot costs under the same bounds. We consider a tunable one-dimensional spin-$\tfrac{1}{2}$ Hamiltonian spanning the transverse-field Ising, XY, XX, and XXZ limits, and define the kernel as the ground-state fidelity. Kernel entries are estimated using a SWAP-test estimator with $S$ shots, and we adapt the ensemble spread and concentration-avoidance shot bounds to obtain practical shot requirements in terms of the interquartile range of kernel values and a representative kernel magnitude. For the free-fermion XY/XX family, we use the closed-form Bogoliubov-angle fidelity, while for the interacting XXZ chain we compute fidelities by exact diagonalization and benchmark shot-noise effects. Our symmetry-aware bounds provide a pragmatic procedure for physics-informed quantum machine learning.

quant-pharXiv:2603.18211•Mar 20, 2026•0 citations

Machine learning phase transitions with a quantum processor

Alexey Uvarov, Andrey Kardashin, Jacob Biamonte

Machine learning has emerged as a promising approach to unveil properties of many-body systems. Recently proposed as a tool to classify phases of matter, the approach relies on classical simulation methods---such as Monte Carlo---which are known to experience an exponential slowdown when simulating certain quantum systems. To overcome this slowdown while still leveraging machine learning, we propose a variational quantum algorithm which merges quantum simulation and quantum machine learning to classify phases of matter. Our classifier is directly fed labeled states recovered by the variational quantum eigensolver algorithm, thereby avoiding the data-reading slowdown experienced in many applications of quantum enhanced machine learning. We propose families of variational ansatz states that are inspired directly by tensor networks. This allows us to use tools from tensor network theory to explain properties of the phase diagrams the presented quantum algorithm recovers. Finally, we propose a majority vote quantum classifier built from a nearest-neighbor (checkerboard) quantum neural network. This classifier is successfully trained to recognize phases of matter with 99% accuracy for the transverse field Ising model and 94% accuracy for the $XXZ$ model. These findings suggest that a merger between quantum simulation and quantum enhanced machine learning offers a fertile ground to develop computational insights into quantum systems.

arXiv:1906.10155•Physical Review A•Jul 15, 2020•69 citations

Quantum phase transition detection via quantum support vector machine

Youle Wang, Linyun Cao

Abstract Unveiling quantum phase transitions (QPTs) is important for characterising physical systems at low temperatures. However, the detection of these transitions is encumbered by significant challenges, especially in the face of the exponential growth in ground state complexity with system scale. The emergence of quantum machine learning has lately gained traction as a promising method for elucidating the properties of many-body systems, providing a different avenue to study QPT. In this paper, we propose a novel and efficient quantum algorithm for identifying QPT synthesising quantum feature with quantum machine learning. Our approach is anchored in the utilisation of quantum computers to directly encode the kernel matrix into Hilbert spaces, realised by the parallel implementation of the quantum feature map. Specifically, we generate a quantum state encoding the information of ground states of the given quantum systems by employing the parallel quantum feature map. The resultant state preparation circuit is then used to implement a block-encoding of the kernel matrix. Equipped with the associated labels and this encoding, we devise a new quantum support vector machine (QSVM) algorithm, forming the main ingredient of the classifier. The presented method refines the efficiency of the prevailing QSVM algorithm for processing quantum and classical data. We demonstrate the effectiveness of our quantum classifier in predicting QPT within the transverse-field Ising model. The findings affirm the efficacy of quantum machine learning in recognising QPT in many-body systems and offer insights into the design of quantum machine learning algorithms.

Quantum Science and Technology•Nov 28, 2024•10 citations

Quantum kernels for classifying dynamical singularities in a multiqubit system

Diego Tancara, José Fredes, Ariel Norambuena

Abstract Dynamical quantum phase transition is a critical phenomenon involving out-of-equilibrium states and broken symmetries without classical analogy. However, when finite-sized systems are analyzed, dynamical singularities of the rate function can appear, leading to a challenging physical characterization when parameters are changed. Here, we report a quantum support vector machine algorithm that uses quantum Kernels to classify dynamical singularities of the rate function for a multiqubit system. We illustrate our approach using N long-range interacting qubits subjected to an arbitrary magnetic field, which induces a quench dynamics. Inspired by physical arguments, we introduce two different quantum Kernels, one inspired by the ground state manifold and the other based on a single state tomography. Our accuracy and adaptability results show that this quantum dynamical critical problem can be efficiently solved using physically inspiring quantum Kernels. Moreover, we extend our results for the case of time-dependent fields, quantum master equation, and when we increase the number of qubits.

arXiv:2310.04300•Quantum Science and Technology•May 30, 2024•2 citations

Quantum Phase Recognition via Quantum Kernel Methods

Yusen Wu, Bujiao Wu, Jingbo B. Wang +1 more

The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an important class of Quantum Phase Recognition (QPR) problems, which are crucially important in understanding many-particle quantum systems. We prove that, under widely believed complexity theory assumptions, there exists a wide range of QPR problems that cannot be efficiently solved by classical learning algorithms with classical resources. Whereas using a quantum computer, we prove the efficiency and robustness of quantum kernel methods in solving QPR problems through Linear order parameter Observables. We numerically benchmark our algorithm for a variety of problems, including recognizing symmetry-protected topological phases and symmetry-broken phases. Our results highlight the capability of quantum machine learning in predicting such quantum phase transitions in many-particle systems.

arXiv:2111.07553•Quantum•Apr 17, 2023•38 citations
Classical machine learning has succeeded in the prediction of both classical and quantum phases of matter. Notably, kernel methods stand out for their ability to provide interpretable results, relating the learning process with the physical order parameter explicitly. Here we exploit quantum kernels instead. They are naturally related to the fidelity, and thus it is possible to interpret the learning process with the help of quantum information tools. In particular, we use a support vector machine (with a quantum kernel) to predict and characterize second-order quantum phase transitions. We explain and understand the process of learning when the fidelity per site (rather than the fidelity) is used. The general theory is tested in the Ising chain in transverse field. We show that for small-sized systems, the algorithm gives accurate results, even when trained away from criticality. Besides, for larger sizes we confirm the success of the technique by extracting the correct critical exponent \ensuremathν\ensuremath{\nu}\ensuremathν. Finally, we present two algorithms, one based on fidelity and one based on the fidelity per site, to classify the phases of matter in a quantum processor.
Machine learning is capable of discriminating phases of matter, and finding associated phase transitions, directly from large data sets of raw state configurations. In the context of condensed matter physics, most progress in the field of supervised learning has come from employing neural networks as classifiers. Although very powerful, such algorithms suffer from a lack of interpretability, which is usually desired in scientific applications in order to associate learned features with physical phenomena. In this paper, we explore support vector machines (SVMs), which are a class of supervised kernel methods that provide interpretable decision functions. We find that SVMs can learn the mathematical form of physical discriminators, such as order parameters and Hamiltonian constraints, for a set of two-dimensional spin models: the ferromagnetic Ising model, a conserved-order-parameter Ising model, and the Ising gauge theory. The ability of SVMs to provide interpretable classification highlights their potential for automating feature detection in both synthetic and experimental data sets for condensed matter and other many-body systems.
Quantum kernels offer a valid procedure for learning quantum phase transitions on quantum processing devices, yet issues on the scalability of the learning strategy in connection with the symmetry of the critical model have not been clarified. We derive a link between model symmetry and fidelity-kernel resource scaling. We quantify the measurement resources required to estimate fidelity-based quantum kernels for many-body ground states while preserving the structure of the resulting Gram matrix under finite-shot sampling. Crucially, we show that increasing symmetry in the underlying spin model systematically amplifies these shot requirements. Moving from the Z2\mathbb{Z}_2Z2​-symmetric Ising/XY regimes to the U(1)U(1)U(1)-symmetric XX (and XXZ) regimes leads to stronger kernel concentration and therefore substantially larger shot costs under the same bounds. We consider a tunable one-dimensional spin-12\tfrac{1}{2}21​ Hamiltonian spanning the transverse-field Ising, XY, XX, and XXZ limits, and define the kernel as the ground-state fidelity. Kernel entries are estimated using a SWAP-test estimator with SSS shots, and we adapt the ensemble spread and concentration-avoidance shot bounds to obtain practical shot requirements in terms of the interquartile range of kernel values and a representative kernel magnitude. For the free-fermion XY/XX family, we use the closed-form Bogoliubov-angle fidelity, while for the interacting XXZ chain we compute fidelities by exact diagonalization and benchmark shot-noise effects. Our symmetry-aware bounds provide a pragmatic procedure for physics-informed quantum machine learning.
Machine learning has emerged as a promising approach to unveil properties of many-body systems. Recently proposed as a tool to classify phases of matter, the approach relies on classical simulation methods---such as Monte Carlo---which are known to experience an exponential slowdown when simulating certain quantum systems. To overcome this slowdown while still leveraging machine learning, we propose a variational quantum algorithm which merges quantum simulation and quantum machine learning to classify phases of matter. Our classifier is directly fed labeled states recovered by the variational quantum eigensolver algorithm, thereby avoiding the data-reading slowdown experienced in many applications of quantum enhanced machine learning. We propose families of variational ansatz states that are inspired directly by tensor networks. This allows us to use tools from tensor network theory to explain properties of the phase diagrams the presented quantum algorithm recovers. Finally, we propose a majority vote quantum classifier built from a nearest-neighbor (checkerboard) quantum neural network. This classifier is successfully trained to recognize phases of matter with 99% accuracy for the transverse field Ising model and 94% accuracy for the XXZXXZXXZ model. These findings suggest that a merger between quantum simulation and quantum enhanced machine learning offers a fertile ground to develop computational insights into quantum systems.
Abstract Unveiling quantum phase transitions (QPTs) is important for characterising physical systems at low temperatures. However, the detection of these transitions is encumbered by significant challenges, especially in the face of the exponential growth in ground state complexity with system scale. The emergence of quantum machine learning has lately gained traction as a promising method for elucidating the properties of many-body systems, providing a different avenue to study QPT. In this paper, we propose a novel and efficient quantum algorithm for identifying QPT synthesising quantum feature with quantum machine learning. Our approach is anchored in the utilisation of quantum computers to directly encode the kernel matrix into Hilbert spaces, realised by the parallel implementation of the quantum feature map. Specifically, we generate a quantum state encoding the information of ground states of the given quantum systems by employing the parallel quantum feature map. The resultant state preparation circuit is then used to implement a block-encoding of the kernel matrix. Equipped with the associated labels and this encoding, we devise a new quantum support vector machine (QSVM) algorithm, forming the main ingredient of the classifier. The presented method refines the efficiency of the prevailing QSVM algorithm for processing quantum and classical data. We demonstrate the effectiveness of our quantum classifier in predicting QPT within the transverse-field Ising model. The findings affirm the efficacy of quantum machine learning in recognising QPT in many-body systems and offer insights into the design of quantum machine learning algorithms.
Abstract Dynamical quantum phase transition is a critical phenomenon involving out-of-equilibrium states and broken symmetries without classical analogy. However, when finite-sized systems are analyzed, dynamical singularities of the rate function can appear, leading to a challenging physical characterization when parameters are changed. Here, we report a quantum support vector machine algorithm that uses quantum Kernels to classify dynamical singularities of the rate function for a multiqubit system. We illustrate our approach using N long-range interacting qubits subjected to an arbitrary magnetic field, which induces a quench dynamics. Inspired by physical arguments, we introduce two different quantum Kernels, one inspired by the ground state manifold and the other based on a single state tomography. Our accuracy and adaptability results show that this quantum dynamical critical problem can be efficiently solved using physically inspiring quantum Kernels. Moreover, we extend our results for the case of time-dependent fields, quantum master equation, and when we increase the number of qubits.
The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an important class of Quantum Phase Recognition (QPR) problems, which are crucially important in understanding many-particle quantum systems. We prove that, under widely believed complexity theory assumptions, there exists a wide range of QPR problems that cannot be efficiently solved by classical learning algorithms with classical resources. Whereas using a quantum computer, we prove the efficiency and robustness of quantum kernel methods in solving QPR problems through Linear order parameter Observables. We numerically benchmark our algorithm for a variety of problems, including recognizing symmetry-protected topological phases and symmetry-broken phases. Our results highlight the capability of quantum machine learning in predicting such quantum phase transitions in many-particle systems.