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:2005.11222 · Physical Review Research

Expressibility and trainability of parametrized analog quantum systems for machine learning applications

Jirawat Tangpanitanon, Supanut Thanasilp, Ninnat Dangniam, Marc-Antoine Lemonde, Dimitris G. Angelakis

Published Dec 14, 2020• 50 citations
arXivHTMLPDF

Abstract

Parametrized quantum evolution is the main ingredient in variational quantum algorithms for near-term quantum devices.In digital quantum computing, it has been shown that random parametrized quantum circuits are able to express complex distributions intractable by a classical computer, leading to the demonstration of quantum supremacy.However, their chaotic nature makes parameter optimization challenging in variational approaches.Evidence of similar classically intractable expressibility has been recently demonstrated in analog quantum computing with driven many-body systems.A thorough investigation of trainability of such analog systems is yet to be performed.In this work we investigate how the interplay between external driving and disorder in the system dictates the trainability and expressibility of interacting quantum systems.We show that if the system thermalizes, the training fails at the expense of the large expressibility, while the opposite happens when the system enters the many-body localized (MBL) phase.From this observation we devise a protocol using quenched MBL dynamics which allows accurate trainability while keeping the overall dynamics in the quantum supremacy regime.Our work shows the fundamental connection between quantum many-body physics and its application in machine learning.We conclude our work with an example application in generative modeling employing a well studied analog many-body model of a driven Ising spin chain.Our approach can be implemented with a variety of available quantum platforms including cold ions, atoms, and superconducting circuits.

DOI
10.1103/physrevresearch.2.043364

Related papers

Quantum supremacy with analog quantum processors for material science and machine learning

Jirawat Tangpanitanon, Supanut Thanasilp, Marc-Antoine Lemonde +1 more

Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT) distribution. In this regime, the system uniformly explores its entire Hilbert space, which makes simulating such quantum dynamics with classical computational resources impossible for large systems. However, the latter has no direct application so far in solving a specific problem. In this work, we show that the same sampling complexity can be achieved from driven analog quantum processors, with less stringent requirements for coherence and control. More importantly, we discuss how to apply this approach to solve problems in quantum simulations of phases of matter and machine learning. Specifically, we consider a simple quantum spin chain with nearest-neighbor interactions driven by a global magnetic field. We show how quantum supremacy is achieved as a consequence of the thermalization due to the interplay between the disorder and the driven many-body dynamics. We analyze how the achieved PT distribution can be used as an accessible reference distribution to probe the many-body localization (MBL) phase transition. In the second part of our work, we show how our setup can be used for generative modeling machine learning tasks. We propose a novel variational hybrid quantum-classical approach, exploiting the system's inherent tunable MBL dynamics, to train the device to learn distributions of complex classical data. The performance of our training protocol depends solely on the phase that the quantum system is in, which makes fine-tuning of local parameters not necessary. The protocol is implementable in a range of driven quantum many-body systems, compatible with noisy intermediate-scale quantum devices.

arXiv:1906.03860•Jun 10, 2019•7 citations

Connecting phases of matter to the flatness of the loss landscape in analog variational quantum algorithms

Kasidit Srimahajariyapong, Supanut Thanasilp, Thiparat Chotibut

Variational quantum algorithms (VQAs) promise near-term quantum advantage, yet parametrized quantum states commonly built from the digital gate-based approach often suffer from scalability issues such as barren plateaus, where the loss landscape becomes flat. We study an analog VQA ansätze composed of M quenches of a disordered Ising chain, whose dynamics is native to several quantum simulation platforms. By tuning the disorder strength we place each quench in either a thermalized phase or a many-body-localized (MBL) phase and analyse (i) the ansätze’s expressivity and (ii) the scaling of loss variance. Numerics shows that both phases reach maximal expressivity at large M, but barren plateaus emerge at far smaller M in the thermalized phase than in the MBL phase. Here we propose an MBL initialization strategy by exploiting this gap: initialize the ansätze in the MBL regime at intermediate quench M, enabling initial trainability while retaining sufficient expressivity for subsequent optimization. The results link quantum phases of matter and VQA trainability, and provide practical guidelines for scaling analog-hardware VQAs. Variational quantum algorithms (VQAs) face scalability challenges, notably barren plateaus, where the loss landscape flattens with increasing system size. Here, the authors explore an analog VQA ansatz using quenches of a disordered Ising chain, demonstrating that initializing in a many-body-localized phase enhances initial trainability while retaining sufficient expressivity to solve optimization problems, offering practical insights for scaling analog VQAs.

arXiv:2506.13865•Communications Physics•Feb 18, 2026•5 citations

Quantum supremacy and quantum phase transitions

Supanut Thanasilp, Jirawat Tangpanitanon, Marc-Antoine Lemonde +2 more

Demonstrating the ability of existing quantum platforms to perform certain computational tasks intractable to classical computers represents a cornerstone in quantum computing. Despite the growing number of such proposed ``quantum supreme'' tasks, it remains an important challenge to identify their direct applications. In this work, we describe how the approach proposed by Tangpanitanon et al. [arXiv:2002.11946] for demonstrating quantum supremacy in generic driven analog many-body systems, such as those found in cold atom and ion setups, can be extended to explore dynamical quantum phase transitions. We show how key quantum supremacy signatures, such as the divergence between the output distribution and the Porter Thomas distribution, can be used as effective order parameters. We apply this approach to a periodically driven disordered one-dimensional Ising model and show that we can accurately capture the transition between the driven thermalized and many-body localized phases. This approach also captures the transition towards the Floquet prethermalized regime for high-frequency driving. Revisiting quantum phases of matter under the light of the recent discussions about quantum supremacy draws a link between complexity theory and analog many-body systems.

arXiv:2012.06459•Physical review. B./Physical review. B•Apr 22, 2021•12 citations

Machine-learning insights into the entanglement-trainability correlation of parametrized quantum circuits

Shikun Zhang, Yang Zhou, Zheng Qin +4 more

Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantages on the current noisy intermediate-scale devices. However, their entanglement-trainability correlation indicates that deep circuits are generally untrainable due to the barren plateau phenomenon, which challenges their applications. In this work, we suggest a gate-to-tensor encoding method for parametrized quantum circuits (PQCs), with which two long short-term memory networks are trained to predict both entangling capability and trainability. We call these LG networks. The remarkable capabilities of LG networks afford a statistical way to investigate the entanglement-trainability correlation of PQCs within a data set encompassing millions of generated circuits. This machine-learning-driven method first confirms the negative correlation between entanglement and trainability. Then, we observe that circuits with any values of entangling capability and trainability exist. These circuits with high entanglement and high trainability possess an appropriate high portion of nearest-neighbor nonlocal gates. Furthermore, the trained LG networks can be employed to construct PQCs with specific entanglement and trainability, demonstrating their practical applications in VQAs.

arXiv:2406.01997•Physical Review A•May 2, 2025•8 citations

Analog Quantum Machine Learning Models on Neat-Term Devices

Araiza Bravo, Oscar Rodrigo

Quantum machine learning promises to deliver near-term practical quantum computation applications using machine learning tools to optimize quantum hardware for scientific applications. Studies in this direction often propose using variational quantum circuits as the underlying hardware. However, these so-called VQCs exhibit flat landscapes with narrow and concentrated local minima, making their optimization inefficient and thwarting their advantage. This dissertation proposes using quantum many-body systems' dynamics for computation instead of circuits. This Analog quantum machine learning approach (AQML) uses tools from optimal control to deliver more manageable optimization landscapes and helps explain what types of computation are suitable for different hardware. Concretely, I show that arrays of Rydberg atoms can be leveraged to implement reservoir computers with enhanced memory storage and retrieval. I also show that two atom-species Rydberg arrays can reproduce the dynamics of the basic building blocks of artificial neural networks and be used for quantum-enhanced sensing and entanglement detection. This study shows that AQML algorithms are theoretically more expressive than their classical counterparts. Lastly, I show that while AQML algorithms can still exhibit problematic optimization landscapes, flatness can be mitigated, and local minima can be circumvented by co-designing the underlying hardware with the desired task. We exemplify this co-design in the context of quantum chemistry calculations. This dissertation shows that AQML algorithms can be used for various scientific and small-scale applications such as sensing, chemical design, entanglement witnessing, and time-series prediction. However, we still have a way to go before seeing full-scale applications. Instead, this dissertation focuses on theoretical studies and answers the question of what we can compute with quantum hardware's analog dynamics.

•Jan 1, 2024•0 citations

Many-body localized hidden generative models

Weishun Zhong, Xun Gao, Susanne F. Yelin +1 more

Quantum generative models hold the promise of accelerating or improving machine learning tasks by leveraging the probabilistic nature of quantum states, but the successful optimization of these models remains a difficult challenge. To tackle this challenge, we present a new architecture for quantum generative modeling that combines insights from classical machine learning and quantum phases of matter. In particular, our model utilizes both many-body localized (MBL) dynamics and hidden units to improve the optimization of the model. We demonstrate the applicability of our model on a diverse set of classical and quantum tasks, including a toy version of MNIST handwritten digits, quantum data obtained from quantum many-body states, and nonlocal parity data. Our architecture and algorithm provide novel strategies of utilizing quantum many-body systems as learning resources and reveal a powerful connection between disorder, interaction, and learning in quantum many-body systems. Published by the American Physical Society 2024

arXiv:2207.02346•Physical Review Research•Oct 16, 2024•6 citations
Parametrized quantum evolution is the main ingredient in variational quantum algorithms for near-term quantum devices.In digital quantum computing, it has been shown that random parametrized quantum circuits are able to express complex distributions intractable by a classical computer, leading to the demonstration of quantum supremacy.However, their chaotic nature makes parameter optimization challenging in variational approaches.Evidence of similar classically intractable expressibility has been recently demonstrated in analog quantum computing with driven many-body systems.A thorough investigation of trainability of such analog systems is yet to be performed.In this work we investigate how the interplay between external driving and disorder in the system dictates the trainability and expressibility of interacting quantum systems.We show that if the system thermalizes, the training fails at the expense of the large expressibility, while the opposite happens when the system enters the many-body localized (MBL) phase.From this observation we devise a protocol using quenched MBL dynamics which allows accurate trainability while keeping the overall dynamics in the quantum supremacy regime.Our work shows the fundamental connection between quantum many-body physics and its application in machine learning.We conclude our work with an example application in generative modeling employing a well studied analog many-body model of a driven Ising spin chain.Our approach can be implemented with a variety of available quantum platforms including cold ions, atoms, and superconducting circuits.
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT) distribution. In this regime, the system uniformly explores its entire Hilbert space, which makes simulating such quantum dynamics with classical computational resources impossible for large systems. However, the latter has no direct application so far in solving a specific problem. In this work, we show that the same sampling complexity can be achieved from driven analog quantum processors, with less stringent requirements for coherence and control. More importantly, we discuss how to apply this approach to solve problems in quantum simulations of phases of matter and machine learning. Specifically, we consider a simple quantum spin chain with nearest-neighbor interactions driven by a global magnetic field. We show how quantum supremacy is achieved as a consequence of the thermalization due to the interplay between the disorder and the driven many-body dynamics. We analyze how the achieved PT distribution can be used as an accessible reference distribution to probe the many-body localization (MBL) phase transition. In the second part of our work, we show how our setup can be used for generative modeling machine learning tasks. We propose a novel variational hybrid quantum-classical approach, exploiting the system's inherent tunable MBL dynamics, to train the device to learn distributions of complex classical data. The performance of our training protocol depends solely on the phase that the quantum system is in, which makes fine-tuning of local parameters not necessary. The protocol is implementable in a range of driven quantum many-body systems, compatible with noisy intermediate-scale quantum devices.
Variational quantum algorithms (VQAs) promise near-term quantum advantage, yet parametrized quantum states commonly built from the digital gate-based approach often suffer from scalability issues such as barren plateaus, where the loss landscape becomes flat. We study an analog VQA ansätze composed of M quenches of a disordered Ising chain, whose dynamics is native to several quantum simulation platforms. By tuning the disorder strength we place each quench in either a thermalized phase or a many-body-localized (MBL) phase and analyse (i) the ansätze’s expressivity and (ii) the scaling of loss variance. Numerics shows that both phases reach maximal expressivity at large M, but barren plateaus emerge at far smaller M in the thermalized phase than in the MBL phase. Here we propose an MBL initialization strategy by exploiting this gap: initialize the ansätze in the MBL regime at intermediate quench M, enabling initial trainability while retaining sufficient expressivity for subsequent optimization. The results link quantum phases of matter and VQA trainability, and provide practical guidelines for scaling analog-hardware VQAs. Variational quantum algorithms (VQAs) face scalability challenges, notably barren plateaus, where the loss landscape flattens with increasing system size. Here, the authors explore an analog VQA ansatz using quenches of a disordered Ising chain, demonstrating that initializing in a many-body-localized phase enhances initial trainability while retaining sufficient expressivity to solve optimization problems, offering practical insights for scaling analog VQAs.
Demonstrating the ability of existing quantum platforms to perform certain computational tasks intractable to classical computers represents a cornerstone in quantum computing. Despite the growing number of such proposed ``quantum supreme'' tasks, it remains an important challenge to identify their direct applications. In this work, we describe how the approach proposed by Tangpanitanon et al. [arXiv:2002.11946] for demonstrating quantum supremacy in generic driven analog many-body systems, such as those found in cold atom and ion setups, can be extended to explore dynamical quantum phase transitions. We show how key quantum supremacy signatures, such as the divergence between the output distribution and the Porter Thomas distribution, can be used as effective order parameters. We apply this approach to a periodically driven disordered one-dimensional Ising model and show that we can accurately capture the transition between the driven thermalized and many-body localized phases. This approach also captures the transition towards the Floquet prethermalized regime for high-frequency driving. Revisiting quantum phases of matter under the light of the recent discussions about quantum supremacy draws a link between complexity theory and analog many-body systems.
Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantages on the current noisy intermediate-scale devices. However, their entanglement-trainability correlation indicates that deep circuits are generally untrainable due to the barren plateau phenomenon, which challenges their applications. In this work, we suggest a gate-to-tensor encoding method for parametrized quantum circuits (PQCs), with which two long short-term memory networks are trained to predict both entangling capability and trainability. We call these LG networks. The remarkable capabilities of LG networks afford a statistical way to investigate the entanglement-trainability correlation of PQCs within a data set encompassing millions of generated circuits. This machine-learning-driven method first confirms the negative correlation between entanglement and trainability. Then, we observe that circuits with any values of entangling capability and trainability exist. These circuits with high entanglement and high trainability possess an appropriate high portion of nearest-neighbor nonlocal gates. Furthermore, the trained LG networks can be employed to construct PQCs with specific entanglement and trainability, demonstrating their practical applications in VQAs.
Quantum machine learning promises to deliver near-term practical quantum computation applications using machine learning tools to optimize quantum hardware for scientific applications. Studies in this direction often propose using variational quantum circuits as the underlying hardware. However, these so-called VQCs exhibit flat landscapes with narrow and concentrated local minima, making their optimization inefficient and thwarting their advantage. This dissertation proposes using quantum many-body systems' dynamics for computation instead of circuits. This Analog quantum machine learning approach (AQML) uses tools from optimal control to deliver more manageable optimization landscapes and helps explain what types of computation are suitable for different hardware. Concretely, I show that arrays of Rydberg atoms can be leveraged to implement reservoir computers with enhanced memory storage and retrieval. I also show that two atom-species Rydberg arrays can reproduce the dynamics of the basic building blocks of artificial neural networks and be used for quantum-enhanced sensing and entanglement detection. This study shows that AQML algorithms are theoretically more expressive than their classical counterparts. Lastly, I show that while AQML algorithms can still exhibit problematic optimization landscapes, flatness can be mitigated, and local minima can be circumvented by co-designing the underlying hardware with the desired task. We exemplify this co-design in the context of quantum chemistry calculations. This dissertation shows that AQML algorithms can be used for various scientific and small-scale applications such as sensing, chemical design, entanglement witnessing, and time-series prediction. However, we still have a way to go before seeing full-scale applications. Instead, this dissertation focuses on theoretical studies and answers the question of what we can compute with quantum hardware's analog dynamics.
Quantum generative models hold the promise of accelerating or improving machine learning tasks by leveraging the probabilistic nature of quantum states, but the successful optimization of these models remains a difficult challenge. To tackle this challenge, we present a new architecture for quantum generative modeling that combines insights from classical machine learning and quantum phases of matter. In particular, our model utilizes both many-body localized (MBL) dynamics and hidden units to improve the optimization of the model. We demonstrate the applicability of our model on a diverse set of classical and quantum tasks, including a toy version of MNIST handwritten digits, quantum data obtained from quantum many-body states, and nonlocal parity data. Our architecture and algorithm provide novel strategies of utilizing quantum many-body systems as learning resources and reveal a powerful connection between disorder, interaction, and learning in quantum many-body systems. Published by the American Physical Society 2024