arXiv:2207.02346 · Physical Review Research

Many-body localized hidden generative models

Weishun Zhong, Xun Gao, Susanne F. Yelin, Khadijeh Najafi

Published Oct 16, 2024• 1 citation

Abstract

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

DOI: 10.1103/physrevresearch.6.043041

Related papers

Generative Quantum Machine Learning via Denoising Diffusion Probabilistic Models

Bingzhi Zhang, Peng Xu, Xiaohui Chen +1 more

Deep generative models are key-enabling technology to computer vision, text generation, and large language models. Denoising diffusion probabilistic models (DDPMs) have recently gained much attention due to their ability to generate diverse and high-quality samples in many computer vision tasks, as well as to incorporate flexible model architectures and a relatively simple training scheme. Quantum generative models, empowered by entanglement and superposition, have brought new insight to learning classical and quantum data. Inspired by the classical counterpart, we propose the quantum denoising diffusion probabilistic model (QuDDPM) to enable efficiently trainable generative learning of quantum data. QuDDPM adopts sufficient layers of circuits to guarantee expressivity, while it introduces multiple intermediate training tasks as interpolation between the target distribution and noise to avoid barren plateau and guarantee efficient training. We provide bounds on the learning error and demonstrate QuDDPM's capability in learning correlated quantum noise model, quantum many-body phases, and topological structure of quantum data. The results provide a paradigm for versatile and efficient quantum generative learning.

arXiv:2310.05866Physical Review LettersMar 5, 202457 citations

Explorations in machine learning for interacting many-body systems.

Jonathon Matthew Schulz-Beach

Most interacting many-body systems in physics are not analytically solvable. Instead, numerical methods are needed for the study of these complex and high-dimensional problems. At present, there are many interesting problems in strongly correlated systems that remain unsolved with current methods. At the heart of this problem is finding an efficient representation that incorporates symmetries, correlations and general features. \n \nIn the context of computer science, machine learning techniques have had astonishing success at reducing the dimensionality of data. The leading method is through the use of artificial neural networks. These networks have been enormously successful at sifting through vast amounts of data to find patterns and regularities. In a sense, neural networks are themselves a statistical system whose properties are adjusted to mimic the features of the data. By finding an effective low-dimensional representation of the data, machine learning has greatly subdued the curse of dimensionality found in many real-world problems. \n \nIn this Thesis, we apply several machine learning techniques to the study of interacting many-body systems in classical and quantum statistical physics. We explore supervised classification of phases of matter with an emphasis on physical interpretation of the net- work. In doing so, we design a custom network architecture that possesses rotational symmetry as an inductive bias. We further investigate connections between the renormalization group and deep learning through applying a super-resolving neural network to the classical Ising model. Towards experimental efforts, we also repurpose generative machine learning to quantum state tomography for the calibration and testing of quantum devices. We conclude with a latent variable model inspired by near-term quantum algorithms. This maps to a variational Monte Carlo ansatz that produces samples efficiently for interacting quantum systems.

Sep 3, 20200 citations

Quantum Generative Models for Image Generation: Insights from MNIST and MedMNIST

Chi‐Sheng Chen, Wei Sheng Hou, Hsiang-Wei Hu +1 more

Quantum generative models offer a promising new direction in machine learning by leveraging quantum circuits to enhance data generation capabilities. In this study, we propose a hybrid quantum-classical image generation framework that integrates variational quantum circuits into a diffusion-based model. To improve training dynamics and generation quality, we introduce two novel noise strategies: intrinsic quantum-generated noise and a tailored noise scheduling mechanism. Our method is built upon a lightweight U-Net architecture, with the quantum layer embedded in the bottleneck module to isolate its effect. We evaluate our model on MNIST and MedMNIST datasets to examine its feasibility and performance. Notably, our results reveal that under limited data conditions (fewer than 100 training images), the quantum-enhanced model generates images with higher perceptual quality and distributional similarity than its classical counterpart using the same architecture. While the quantum model shows advantages on grayscale data such as MNIST, its performance is more nuanced on complex, color-rich datasets like PathMNIST. These findings highlight both the potential and current limitations of quantum generative models and lay the groundwork for future developments in low-resource and biomedical image generation.

arXiv:2504.00034Mar 30, 20250 citations

Generative Quantum Machine Learning

Christa Zoufal

The goal of generative machine learning is to model the probability distribution underlying a given data set. This probability distribution helps to characterize the generation process of the data samples. While classical generative machine learning is solely based on classical resources, generative quantum machine learning can also employ quantum resources - such as parameterized quantum channels and quantum operators - to learn and sample from the probability model of interest. Applications of generative (quantum) models are multifaceted. The trained model can generate new samples that are compatible with the given data and extend the data set. Additionally, learning a model for the generation process of a data set may provide interesting information about the corresponding properties. With the help of quantum resources, the respective generative models have access to functions that are difficult to evaluate with a classical computer and may improve the performance or lead to new insights. Furthermore, generative quantum machine learning can be applied to efficient, approximate loading of classical data into a quantum state which may help to avoid - potentially exponentially - expensive, exact quantum data loading. The aim of this doctoral thesis is to develop new generative quantum machine learning algorithms, demonstrate their feasibility, and analyze their performance. Additionally, we outline their potential application to efficient, approximate quantum data loading. More specifically, we introduce a quantum generative adversarial network and a quantum Boltzmann machine implementation, both of which can be realized with parameterized quantum circuits. These algorithms are compatible with first-generation quantum hardware and, thus, enable us to study proof of concept implementations not only with numerical quantum simulations but also real quantum hardware available today.

arXiv:2111.12738Jan 1, 20214 citations

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.11222Physical Review ResearchDec 14, 202044 citations

Learning energy-based representations of quantum many-body states

Abhijith Jayakumar, Marc Vuffray, Andrey Y. Lokhov

Efficient representation of quantum many-body states on classical computers is a problem of practical importance. An ideal representation of a quantum state combines a succinct characterization informed by the structure and symmetries of the system along with the ability to predict the physical observables of interest. Several machine-learning approaches have been recently used to construct such classical representations, which enable predictions of observables and account for physical symmetries. However, the structure of a quantum state typically gets lost unless a specialized is employed based on prior knowledge of the system. Moreover, most such approaches give no information about what states are easier to learn in comparison with others. Here, we propose a generative energy-based representation of quantum many-body states derived from Gibbs distributions used for modeling the thermal states of classical spin systems. Based on the prior information on a family of quantum states, the energy function can be specified by a small number of parameters using an explicit low-degree polynomial or a generic parametric family such as neural nets and can naturally include the known symmetries of the system. Our results show that such a representation can be efficiently learned from data using exact algorithms in a form that enables the prediction of expectation values of physical observables. Importantly, the structure of the learned energy function provides a natural explanation for the difficulty of learning an energy-based representation of a given class of quantum states when measured in a certain basis. Published by the American Physical Society 2024

arXiv:2304.04058Physical Review ResearchAug 21, 20241 citation