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:2405.08441 · npj Quantum Information

Unveiling quantum phase transitions from traps in variational quantum algorithms

Chenfeng Cao, Filippo Maria Gambetta, Ashley Montanaro, Raul A. Santos

Published Jun 4, 2025• 30 citations
arXivHTMLPDF

Abstract

Understanding quantum phase transitions in physical systems is fundamental to characterize their behavior at low temperatures. Achieving this requires both accessing good approximations to the ground state and identifying order parameters to distinguish different phases. Addressing these challenges, our work introduces a hybrid algorithm that combines quantum optimization with classical machine learning. This approach leverages the capability of near-term quantum computers to prepare locally trapped states through finite optimization. Specifically, we apply LASSO for identifying conventional phase transitions and the Transformer model for topological transitions, utilizing these with a sliding window scan of Hamiltonian parameters to learn appropriate order parameters and locate critical points. We validated the method with numerical simulations and real-hardware experiments on Rigetti's Ankaa 9Q-1 quantum computer. This protocol provides a framework for investigating quantum phase transitions with shallow circuits, offering enhanced efficiency and, in some settings, higher precision-thus contributing to the broader effort to integrate near-term quantum computing and machine learning.

DOI
10.1038/s41534-025-01038-5

Related papers

Learning variational quantum circuit parameters with classical artificial intelligence for quantum phase transition detection

Xin Li, Zhang‐qi Yin

Learning many-body quantum states and quantum phase transitions remains a major challenge in quantum many-body physics. Classical machine learning methods offer certain advantages in addressing these difficulties. In this work, we propose a novel framework that bypasses the need to measure physical observables by directly learning the parameters of parameterized quantum circuits. By integrating the attention mechanism from large language models (LLMs) with a variational autoencoder (VAE), we efficiently capture hidden correlations within the circuit parameters. These correlations allow us to extract information about quantum phase transitions in an unsupervised manner. Moreover, our VAE acts as a classical representation of parameterized quantum circuits and the corresponding many-body quantum states, enabling the efficient generation of quantum states associated with specific phases. We apply our framework to a variety of quantum systems and demonstrate its broad applicability, with particularly strong performance in identifying topological quantum phase transitions.

arXiv:2506.06678•Physical review. B./Physical review. B•Jun 8, 2026•0 citations

Learning quantum phase transition in parametrized quantum circuits with an attention mechanism

Zhang‐qi Yin, Xin Li

Abstract Learning many-body quantum states and quantum phase transitions remains a major challenge in quantum many-body physics. Classical machine learning methods offer certain advantages in addressing these difficulties. In this work, we propose a novel framework that bypasses the need to measure physical observables by directly learning the parameters of parameterized quantum circuits. By integrating the attention mechanism from large language models (LLMs) with a variational autoencoder (VAE), we efficiently capture hidden correlations within the circuit parameters. These correlations allow us to extract information about quantum phase transitions in an unsupervised manner. Moreover, our VAE acts as a classical representation of parameterized quantum circuits and the corresponding many-body quantum states, enabling the efficient generation of quantum states associated with specific phases. We apply our framework to a variety of quantum systems and demonstrate its broad applicability, with particularly strong performance in identifying topological quantum phase transitions.

•Sep 26, 2025•0 citations

Quantum Approximate Optimization Algorithm and Variational Quantum Computing: from binary neural networks to ground state preparation

Pietro Torta

In this thesis, I explore the domain of hybrid quantum-classical computation, the foremost approach for utilizing Noisy Intermediate-Scale Quantum (NISQ) devices. The opening chapter presents an overview of Variational Quantum Algorithms (VQAs), highlighting the primary algorithmic challenges. It offers an in-depth review of the Quantum Approximate Optimization Algorithm (QAOA), discussing its variants for ground state preparation. In the second chapter, we apply QAOA for the supervised learning of a simple Binary Neural Network. This model represents an idealized yet prototypical example of classical combinatorial optimization problems involving multi-spin interactions. In the following chapters, the discussion shifts toward quantum many-body ground state preparation, focusing on the one-dimensional Heisenberg XYZ model and the longitudinal-transverse-field Ising model (LTFIM). We have developed a novel technique that, at any point in the phase diagram, leverages the transferability of a specific class of optimal schedules from systems with small to those with larger numbers of qubits. This approach mitigates trainability issues, specifically vanishing gradients (Barren Plateaus). Next, we tailor a QAOA scheme to characterize a topological quantum phase transition within a lattice gauge theory model. This investigation is particularly significant due to its implications for high-energy physics and relevance to quantum error correction and surface codes. In the concluding chapter, I propose new stimulating research directions and help to identify core challenges and unresolved questions in variational quantum computing that transcend any particular application domain.

•Apr 9, 2024•0 citations

Quantum-Enhanced Topological Phase Transition Modeling

Jincheng Zhang

Quantum-enhanced topological phase transition modeling presents a novel approach to understanding and predicting these complex phenomena. This research focuses on developing a computational framework leveraging quantum algorithms to simulate the evolution of topological order and identify critical points, ultimately providing insights into transition mechanisms and stability. The core mechanism involves applying quantum simulations to explore the interplay between quantum entanglement, topological order, and phase transition dynamics, offering a fundamentally different perspective compared to classical methods. This work seeks to expand the current understanding of topological phase transitions by offering a powerful tool for analysis and prediction. The proposed framework integrates quantum computing with established topological phase transition theory, aiming for improved accuracy and efficiency in modeling these phenomena.

•Aug 29, 2026•0 citations

Classically optimized variational quantum eigensolver with applications to topological phases

Ken N. Okada, Keita Osaki, Kosuke Mitarai +1 more

The variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithms for near-term quantum computers. Meanwhile, VQE is confronted with a challenge that statistical error associated with measurement as well as systematic error could significantly hamper the optimization. To circumvent this issue, we propose the classically optimized VQE (CO-VQE), where the whole process of optimization is efficiently conducted on a classical computer. The efficacy of the method is guaranteed by the observation that quantum circuits with up to logarithmic depth are classically tractable via simulations of local subsystems with up to quasipolynomial cost (polynomial for constant depth). In CO-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized. As a proof of concept, we present numerical experiments on quantum spin models with topological phases. After the optimization, we identify the topological phases by nonlocal order parameters as well as unsupervised machine learning on inner products between quantum states. The proposed method maximizes the advantage of using quantum computers while avoiding strenuous optimization on noisy quantum devices. In addition, our paper indicates that clustering technique combined with the fidelity measured on quantum computers could be useful for phase classification in condensed-matter physics.

arXiv:2202.02909•Physical Review Research•Dec 8, 2023•25 citations

Quantum Optimization for Machine Learning

Asha Sohal, Ramesh Kait, Asha Sohal

The convergence of machine learning (ML) and quantum computing is quickly becoming a game-changing new frontier in computational science. The most intriguing area of overlap may be quantum optimization, which seeks to reduce the exponentially increasing complexity and computational cost of ML algorithms. As they grow larger and more complicated, traditional optimization methods, particularly in high-dimensional and non-convex space, will inevitably hit performance limits. Quantum optimization is the whole new paradigm that leverages quantum mechanical effects like superposition, entanglement, and tunnelling to explore solution spaces more efficiently. The chapter outlines the theory, practice, and potential of hybrid quantum-classical optimization algorithms for machine learning. The most brilliant research direction in the current NISQ (noisy intermediate-scale quantum) era is mixed systems leveraging classical computing capability augmented by quantum capacity. In such designs, computationally intensive subroutines like optimization for global optima or escape from local minima are left to quantum processors and data preprocessing, iterative refinement, and model testing are performed by classical processors. We start by defining the fundamental principles of quantum computing and acquainting readers with the fundamentals like qubits, quantum gates, and quantum circuits. These are the building blocks for quantum algorithms, which hopefully can be utilized for optimization, for example, the QAOA (quantum approximate optimization algorithm), the VQE (variational quantum Eigensolver), and quantum annealing. They all build to optimize the problems in some way differently: QAOA through parameterized quantum circuits, VQE through approximations of ground states of the Hamiltonians, and quantum annealing through quantum evolution to low-energy solutions. We then form a loop between these quantum algorithms and regular machine learning tasks. Optimization impacts virtually all ML phases, from training neural networks, where one reduces loss functions; feature selection, where one aims to discover the most relevant subset of input variables; and hyperparameter optimization, which often involves expensive search procedures over extremely large combinatorial spaces. Quantum optimization techniques can therefore, in principle, accelerate such procedures through computational complexity reduction and enhancing solutions over challenging landscapes. Realistic simulations and case studies emphasize the degree to which hybrid quantum-classical algorithms have been employed in solving ML problems, that is, QSVMs, quantum-enhanced clustering, and quantum reinforcement learning. Despite their experimental nature, these applications already show encouraging results in terms of improved performance metrics as well as reduction in time-to-solution compared to classical-only solutions. Notwithstanding that, this new field is not bereft of real challenges. Quantum hardware suffers from hard limits on qubit fidelity, decoherence, and scalability in the current times. Furthermore, quantum circuit integration into broad ML pipelines requires novel architectures and software platforms. As a counter to those issues, this chapter surveys recent advances in quantum programming languages, simulators, and hybrid platforms like PennyLane, Qiskit, and TensorFlow Quantum. We conclude by looking to the future possibility that quantum optimization will revolutionize the machine learning landscape. As hardware improves and algorithmic complexity increases, the possibility of quantum-powered learning systems solving hard problems becomes increasingly accessible. From speeding up deep network training to enabling new types of unsupervised learning, quantum optimization holds the potential to recast computational tractability in machine learning. This chapter is an all-encompassing introduction and state-of-the-art work for students, researchers, and practitioners interested in using quantum optimization for practical ML applications. It sets the foundation for understanding how to pursue hybrid approaches (how they may be applied today in the real world and bracing oneself for disruption in the future).

Auerbach Publications eBooks•Feb 24, 2026•0 citations
Understanding quantum phase transitions in physical systems is fundamental to characterize their behavior at low temperatures. Achieving this requires both accessing good approximations to the ground state and identifying order parameters to distinguish different phases. Addressing these challenges, our work introduces a hybrid algorithm that combines quantum optimization with classical machine learning. This approach leverages the capability of near-term quantum computers to prepare locally trapped states through finite optimization. Specifically, we apply LASSO for identifying conventional phase transitions and the Transformer model for topological transitions, utilizing these with a sliding window scan of Hamiltonian parameters to learn appropriate order parameters and locate critical points. We validated the method with numerical simulations and real-hardware experiments on Rigetti's Ankaa 9Q-1 quantum computer. This protocol provides a framework for investigating quantum phase transitions with shallow circuits, offering enhanced efficiency and, in some settings, higher precision-thus contributing to the broader effort to integrate near-term quantum computing and machine learning.
Learning many-body quantum states and quantum phase transitions remains a major challenge in quantum many-body physics. Classical machine learning methods offer certain advantages in addressing these difficulties. In this work, we propose a novel framework that bypasses the need to measure physical observables by directly learning the parameters of parameterized quantum circuits. By integrating the attention mechanism from large language models (LLMs) with a variational autoencoder (VAE), we efficiently capture hidden correlations within the circuit parameters. These correlations allow us to extract information about quantum phase transitions in an unsupervised manner. Moreover, our VAE acts as a classical representation of parameterized quantum circuits and the corresponding many-body quantum states, enabling the efficient generation of quantum states associated with specific phases. We apply our framework to a variety of quantum systems and demonstrate its broad applicability, with particularly strong performance in identifying topological quantum phase transitions.
Abstract Learning many-body quantum states and quantum phase transitions remains a major challenge in quantum many-body physics. Classical machine learning methods offer certain advantages in addressing these difficulties. In this work, we propose a novel framework that bypasses the need to measure physical observables by directly learning the parameters of parameterized quantum circuits. By integrating the attention mechanism from large language models (LLMs) with a variational autoencoder (VAE), we efficiently capture hidden correlations within the circuit parameters. These correlations allow us to extract information about quantum phase transitions in an unsupervised manner. Moreover, our VAE acts as a classical representation of parameterized quantum circuits and the corresponding many-body quantum states, enabling the efficient generation of quantum states associated with specific phases. We apply our framework to a variety of quantum systems and demonstrate its broad applicability, with particularly strong performance in identifying topological quantum phase transitions.
In this thesis, I explore the domain of hybrid quantum-classical computation, the foremost approach for utilizing Noisy Intermediate-Scale Quantum (NISQ) devices. The opening chapter presents an overview of Variational Quantum Algorithms (VQAs), highlighting the primary algorithmic challenges. It offers an in-depth review of the Quantum Approximate Optimization Algorithm (QAOA), discussing its variants for ground state preparation. In the second chapter, we apply QAOA for the supervised learning of a simple Binary Neural Network. This model represents an idealized yet prototypical example of classical combinatorial optimization problems involving multi-spin interactions. In the following chapters, the discussion shifts toward quantum many-body ground state preparation, focusing on the one-dimensional Heisenberg XYZ model and the longitudinal-transverse-field Ising model (LTFIM). We have developed a novel technique that, at any point in the phase diagram, leverages the transferability of a specific class of optimal schedules from systems with small to those with larger numbers of qubits. This approach mitigates trainability issues, specifically vanishing gradients (Barren Plateaus). Next, we tailor a QAOA scheme to characterize a topological quantum phase transition within a lattice gauge theory model. This investigation is particularly significant due to its implications for high-energy physics and relevance to quantum error correction and surface codes. In the concluding chapter, I propose new stimulating research directions and help to identify core challenges and unresolved questions in variational quantum computing that transcend any particular application domain.
Quantum-enhanced topological phase transition modeling presents a novel approach to understanding and predicting these complex phenomena. This research focuses on developing a computational framework leveraging quantum algorithms to simulate the evolution of topological order and identify critical points, ultimately providing insights into transition mechanisms and stability. The core mechanism involves applying quantum simulations to explore the interplay between quantum entanglement, topological order, and phase transition dynamics, offering a fundamentally different perspective compared to classical methods. This work seeks to expand the current understanding of topological phase transitions by offering a powerful tool for analysis and prediction. The proposed framework integrates quantum computing with established topological phase transition theory, aiming for improved accuracy and efficiency in modeling these phenomena.
The variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithms for near-term quantum computers. Meanwhile, VQE is confronted with a challenge that statistical error associated with measurement as well as systematic error could significantly hamper the optimization. To circumvent this issue, we propose the classically optimized VQE (CO-VQE), where the whole process of optimization is efficiently conducted on a classical computer. The efficacy of the method is guaranteed by the observation that quantum circuits with up to logarithmic depth are classically tractable via simulations of local subsystems with up to quasipolynomial cost (polynomial for constant depth). In CO-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized. As a proof of concept, we present numerical experiments on quantum spin models with topological phases. After the optimization, we identify the topological phases by nonlocal order parameters as well as unsupervised machine learning on inner products between quantum states. The proposed method maximizes the advantage of using quantum computers while avoiding strenuous optimization on noisy quantum devices. In addition, our paper indicates that clustering technique combined with the fidelity measured on quantum computers could be useful for phase classification in condensed-matter physics.
The convergence of machine learning (ML) and quantum computing is quickly becoming a game-changing new frontier in computational science. The most intriguing area of overlap may be quantum optimization, which seeks to reduce the exponentially increasing complexity and computational cost of ML algorithms. As they grow larger and more complicated, traditional optimization methods, particularly in high-dimensional and non-convex space, will inevitably hit performance limits. Quantum optimization is the whole new paradigm that leverages quantum mechanical effects like superposition, entanglement, and tunnelling to explore solution spaces more efficiently. The chapter outlines the theory, practice, and potential of hybrid quantum-classical optimization algorithms for machine learning. The most brilliant research direction in the current NISQ (noisy intermediate-scale quantum) era is mixed systems leveraging classical computing capability augmented by quantum capacity. In such designs, computationally intensive subroutines like optimization for global optima or escape from local minima are left to quantum processors and data preprocessing, iterative refinement, and model testing are performed by classical processors. We start by defining the fundamental principles of quantum computing and acquainting readers with the fundamentals like qubits, quantum gates, and quantum circuits. These are the building blocks for quantum algorithms, which hopefully can be utilized for optimization, for example, the QAOA (quantum approximate optimization algorithm), the VQE (variational quantum Eigensolver), and quantum annealing. They all build to optimize the problems in some way differently: QAOA through parameterized quantum circuits, VQE through approximations of ground states of the Hamiltonians, and quantum annealing through quantum evolution to low-energy solutions. We then form a loop between these quantum algorithms and regular machine learning tasks. Optimization impacts virtually all ML phases, from training neural networks, where one reduces loss functions; feature selection, where one aims to discover the most relevant subset of input variables; and hyperparameter optimization, which often involves expensive search procedures over extremely large combinatorial spaces. Quantum optimization techniques can therefore, in principle, accelerate such procedures through computational complexity reduction and enhancing solutions over challenging landscapes. Realistic simulations and case studies emphasize the degree to which hybrid quantum-classical algorithms have been employed in solving ML problems, that is, QSVMs, quantum-enhanced clustering, and quantum reinforcement learning. Despite their experimental nature, these applications already show encouraging results in terms of improved performance metrics as well as reduction in time-to-solution compared to classical-only solutions. Notwithstanding that, this new field is not bereft of real challenges. Quantum hardware suffers from hard limits on qubit fidelity, decoherence, and scalability in the current times. Furthermore, quantum circuit integration into broad ML pipelines requires novel architectures and software platforms. As a counter to those issues, this chapter surveys recent advances in quantum programming languages, simulators, and hybrid platforms like PennyLane, Qiskit, and TensorFlow Quantum. We conclude by looking to the future possibility that quantum optimization will revolutionize the machine learning landscape. As hardware improves and algorithmic complexity increases, the possibility of quantum-powered learning systems solving hard problems becomes increasingly accessible. From speeding up deep network training to enabling new types of unsupervised learning, quantum optimization holds the potential to recast computational tractability in machine learning. This chapter is an all-encompassing introduction and state-of-the-art work for students, researchers, and practitioners interested in using quantum optimization for practical ML applications. It sets the foundation for understanding how to pursue hybrid approaches (how they may be applied today in the real world and bracing oneself for disruption in the future).