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

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

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

Published Jun 10, 2019• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1906.03860

Related papers

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

Jirawat Tangpanitanon, Supanut Thanasilp, Ninnat Dangniam +2 more

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.

arXiv:2005.11222•Physical Review Research•Dec 14, 2020•50 citations

Pushing the frontier of quantum many-body simulation using classical computers

Yiqing Zhou

One of the central goals of condensed matter physics is to understand the emergence of collective phenomena in strongly correlated quantum systems. However, the exponential complexity of many-body quantum states poses fundamental challenges to both analytical and classical numerical methods. This thesis explores how classical computation can support and extend the capabilities of quantum simulation, with a focus on both analog and digital quantum simulators, guided by and aligned with recent experimental advancements. The first part of this thesis focuses on analog quantum simulation in solid-state moiré materials. In particular, we investigate WSe$_2$/WTe$_2$ heterobilayers as promising platforms for simulating extended Hubbard models on a triangular lattice. Using large-scale density matrix renormalization group (DMRG) simulations, we map out the quantum phase diagram as a function of kinetic energy and Coulomb interactions. Our results identify several exotic phases, including chiral spin liquids and generalized Wigner crystals, and provide theoretical guidance for experimental exploration of interaction-driven quantum phase transitions in these systems. The second part addresses digital quantum simulators and the challenge of quantum error correction. We propose a machine learning-based decoder for fault-tolerant quantum computation in the presence of logical circuits, motivated by the architecture of neutral atom-based quantum processors. By designing a modular neural network architecture and training it on realistic error models, we achieve competitive decoding accuracy and efficiency. Our work highlights the potential of classical machine learning to enhance the performance of quantum error correction, bridging algorithmic design with practical hardware considerations. Together, these studies demonstrate the essential role of classical computation in supporting quantum simulation, from characterizing novel phases in analog platforms to enabling fault tolerance in digital quantum devices. The interplay between theoretical modeling, numerical simulation, and experimental collaboration provides a path forward for probing and harnessing quantum many-body phenomena.

•Jan 1, 2025•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•78 citations

Protocols for classically training quantum generative models on probability distributions

Sachin Kasture, Oleksandr Kyriienko, Vincent E. Elfving

Quantum generative modeling (QGM) relies on preparing quantum states and generating samples from these states as hidden---or known---probability distributions. As distributions from some classes of quantum states (circuits) are inherently hard to sample classically, QGM represents an excellent test bed for quantum supremacy experiments. Furthermore, generative tasks are increasingly relevant for industrial machine learning applications, and thus QGM is a strong candidate for demonstrating a practical quantum advantage. However, this requires that quantum circuits are trained to represent industrially relevant distributions, and the corresponding training stage has an extensive training cost for current quantum hardware in practice. In this work, we propose protocols for classical training of QGMs based on circuits of the specific type that admit an efficient gradient computation, while remaining hard to sample. In particular, we consider instantaneous quantum polynomial (IQP) circuits and their extensions. Showing their classical simulability in terms of the time complexity, sparsity, and anticoncentration properties, we develop a classically tractable way of simulating their output probability distributions, allowing classical training to a target probability distribution. The corresponding quantum sampling from IQPs can be performed efficiently, unlike when using classical sampling. We numerically demonstrate the end-to-end training of IQP circuits using probability distributions for up to 30 qubits on a regular desktop computer. When applied to industrially relevant distributions this combination of classical training with quantum sampling represents an avenue for reaching advantage in the noisy intermediate-scale quantum (NISQ) era.

arXiv:2210.13442•Physical Review A•Oct 5, 2023•19 citations

The Born supremacy: quantum advantage and training of an Ising Born machine

Brian Coyle, Daniel Mills, Vincent Danos +1 more

Abstract The search for an application of near-term quantum devices is widespread. Quantum machine learning is touted as a potential utilisation of such devices, particularly those out of reach of the simulation capabilities of classical computers. In this work, we study such an application in generative modelling, focussing on a class of quantum circuits known as Born machines. Specifically, we define a subset of this class based on Ising Hamiltonians and show that the circuits encountered during gradient-based training cannot be efficiently sampled from classically up to multiplicative error in the worst case. Our gradient-based training methods use cost functions known as the Sinkhorn divergence and the Stein discrepancy, which have not previously been used in the gradient-based training of quantum circuits, and we also introduce quantum kernels to generative modelling. We show that these methods outperform the previous standard method, which used maximum mean discrepancy (MMD) as a cost function, and achieve this with minimal overhead. Finally, we discuss the ability of the model to learn hard distributions and provide formal definitions for ‘quantum learning supremacy’. We also exemplify the work of this paper by using generative modelling to perform quantum circuit compilation.

arXiv:1904.02214•npj Quantum Information•Jul 8, 2020•185 citations

Quantum supremacy and random circuits

Ramis Movassagh

As Moore's law reaches its limits, quantum computers are emerging with the promise of dramatically outperforming classical computers. We have witnessed the advent of quantum processors with over $50$ quantum bits (qubits), which are expected to be beyond the reach of classical simulation. Quantum supremacy is the event at which the old Extended Church-Turing Thesis is overturned: A quantum computer performs a task that is practically impossible for any classical (super)computer. The demonstration requires both a solid theoretical guarantee and an experimental realization. The lead candidate is Random Circuit Sampling (RCS), which is the task of sampling from the output distribution of random quantum circuits. Google recently announced a $53-$qubit experimental demonstration of RCS. Soon after, classical algorithms appeared that challenge the supremacy of random circuits by estimating their outputs. How hard is it to classically simulate the output of random quantum circuits? We prove that estimating the output probabilities of random quantum circuits is formidably hard ($\#P$-Hard) for any classical computer. This makes RCS the strongest candidate for demonstrating quantum supremacy relative to all other proposals. The robustness to the estimation error that we prove may serve as a new hardness criterion for the performance of classical algorithms. To achieve this, we introduce the Cayley path interpolation between any two gates of a quantum computation and convolve recent advances in quantum complexity and information with probability and random matrices. Furthermore, we apply algebraic geometry to generalize the well-known Berlekamp-Welch algorithm that is widely used in coding theory and cryptography. Our results imply that there is an exponential hardness barrier for the classical simulation of most quantum circuits.

arXiv:1909.06210•Sep 11, 2019•75 citations
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.
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.
One of the central goals of condensed matter physics is to understand the emergence of collective phenomena in strongly correlated quantum systems. However, the exponential complexity of many-body quantum states poses fundamental challenges to both analytical and classical numerical methods. This thesis explores how classical computation can support and extend the capabilities of quantum simulation, with a focus on both analog and digital quantum simulators, guided by and aligned with recent experimental advancements. The first part of this thesis focuses on analog quantum simulation in solid-state moiré materials. In particular, we investigate WSe2_22​/WTe2_22​ heterobilayers as promising platforms for simulating extended Hubbard models on a triangular lattice. Using large-scale density matrix renormalization group (DMRG) simulations, we map out the quantum phase diagram as a function of kinetic energy and Coulomb interactions. Our results identify several exotic phases, including chiral spin liquids and generalized Wigner crystals, and provide theoretical guidance for experimental exploration of interaction-driven quantum phase transitions in these systems. The second part addresses digital quantum simulators and the challenge of quantum error correction. We propose a machine learning-based decoder for fault-tolerant quantum computation in the presence of logical circuits, motivated by the architecture of neutral atom-based quantum processors. By designing a modular neural network architecture and training it on realistic error models, we achieve competitive decoding accuracy and efficiency. Our work highlights the potential of classical machine learning to enhance the performance of quantum error correction, bridging algorithmic design with practical hardware considerations. Together, these studies demonstrate the essential role of classical computation in supporting quantum simulation, from characterizing novel phases in analog platforms to enabling fault tolerance in digital quantum devices. The interplay between theoretical modeling, numerical simulation, and experimental collaboration provides a path forward for probing and harnessing quantum many-body phenomena.
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.
Quantum generative modeling (QGM) relies on preparing quantum states and generating samples from these states as hidden---or known---probability distributions. As distributions from some classes of quantum states (circuits) are inherently hard to sample classically, QGM represents an excellent test bed for quantum supremacy experiments. Furthermore, generative tasks are increasingly relevant for industrial machine learning applications, and thus QGM is a strong candidate for demonstrating a practical quantum advantage. However, this requires that quantum circuits are trained to represent industrially relevant distributions, and the corresponding training stage has an extensive training cost for current quantum hardware in practice. In this work, we propose protocols for classical training of QGMs based on circuits of the specific type that admit an efficient gradient computation, while remaining hard to sample. In particular, we consider instantaneous quantum polynomial (IQP) circuits and their extensions. Showing their classical simulability in terms of the time complexity, sparsity, and anticoncentration properties, we develop a classically tractable way of simulating their output probability distributions, allowing classical training to a target probability distribution. The corresponding quantum sampling from IQPs can be performed efficiently, unlike when using classical sampling. We numerically demonstrate the end-to-end training of IQP circuits using probability distributions for up to 30 qubits on a regular desktop computer. When applied to industrially relevant distributions this combination of classical training with quantum sampling represents an avenue for reaching advantage in the noisy intermediate-scale quantum (NISQ) era.
Abstract The search for an application of near-term quantum devices is widespread. Quantum machine learning is touted as a potential utilisation of such devices, particularly those out of reach of the simulation capabilities of classical computers. In this work, we study such an application in generative modelling, focussing on a class of quantum circuits known as Born machines. Specifically, we define a subset of this class based on Ising Hamiltonians and show that the circuits encountered during gradient-based training cannot be efficiently sampled from classically up to multiplicative error in the worst case. Our gradient-based training methods use cost functions known as the Sinkhorn divergence and the Stein discrepancy, which have not previously been used in the gradient-based training of quantum circuits, and we also introduce quantum kernels to generative modelling. We show that these methods outperform the previous standard method, which used maximum mean discrepancy (MMD) as a cost function, and achieve this with minimal overhead. Finally, we discuss the ability of the model to learn hard distributions and provide formal definitions for ‘quantum learning supremacy’. We also exemplify the work of this paper by using generative modelling to perform quantum circuit compilation.
As Moore's law reaches its limits, quantum computers are emerging with the promise of dramatically outperforming classical computers. We have witnessed the advent of quantum processors with over 505050 quantum bits (qubits), which are expected to be beyond the reach of classical simulation. Quantum supremacy is the event at which the old Extended Church-Turing Thesis is overturned: A quantum computer performs a task that is practically impossible for any classical (super)computer. The demonstration requires both a solid theoretical guarantee and an experimental realization. The lead candidate is Random Circuit Sampling (RCS), which is the task of sampling from the output distribution of random quantum circuits. Google recently announced a 53−53-53−qubit experimental demonstration of RCS. Soon after, classical algorithms appeared that challenge the supremacy of random circuits by estimating their outputs. How hard is it to classically simulate the output of random quantum circuits? We prove that estimating the output probabilities of random quantum circuits is formidably hard (#P\#P#P-Hard) for any classical computer. This makes RCS the strongest candidate for demonstrating quantum supremacy relative to all other proposals. The robustness to the estimation error that we prove may serve as a new hardness criterion for the performance of classical algorithms. To achieve this, we introduce the Cayley path interpolation between any two gates of a quantum computation and convolve recent advances in quantum complexity and information with probability and random matrices. Furthermore, we apply algebraic geometry to generalize the well-known Berlekamp-Welch algorithm that is widely used in coding theory and cryptography. Our results imply that there is an exponential hardness barrier for the classical simulation of most quantum circuits.