arXiv:2609.00372

Towards unsupervised representation learning for quantum data: quantum models with inference and generation

Robin Lorenz, Eric Brunner, Marcello Benedetti

quant-phcs.LGSubmitted Aug 31, 2026• Announced Sep 2, 2026• 0 citations

Abstract

With quantum sensors, simulators and networks emerging, a future of quantum technology may produce quantum states as data---that is, coherently rather than as classical measurement records---thus motivating the study of suitable quantum generalisations of modern machine learning, including the automated, unsupervised extraction of useful representations. Two ingredients are central to the latter: inference, mapping observations to latent representations, and generation, mapping latent states back to synthetic data. Both are related to each other and to joint distributions for training models by the chain-rule of classical probability theory. The fact that quantum states however lack such universal, standard factorisation property thus poses a challenge. Here we develop a conceptual and mathematical framework for unsupervised representation learning from quantum data. Models are joint quantum states over visible and latent systems; state-over-time maps provide a notion of factorisation into a marginal state and inference (generation) channel; models with inference (generation) are ambiguous states---states for which such factorisation obtains---subject to a further consistency condition on extended inference maps as data extension. These stipulations are restrictive: we show that non-trivial models must feature non-linear such maps to the extended space. For three representative state-over-time maps, we completely characterise the ambiguous states, uncovering a hierarchy tied to the positive-partial-transpose (PPT) criterion from entanglement theory. Notably, the Leifer-Spekkens construction supports inference and generation exactly for model classes of PPT states, thus allowing genuinely quantum visible-latent correlations. We also formulate quantum counterparts of exact and approximate inference training, explore weaker notions of data extension and sketch a future research programme.

Comments: 48 pages, comments welcome

Related papers

Explainable representation learning of small quantum states

Felix Frohnert, Evert van Nieuwenburg

Abstract Unsupervised machine learning models build an internal representation of their training data without the need for explicit human guidance or feature engineering. This learned representation provides insights into which features of the data are relevant for the task at hand. In the context of quantum physics, training models to describe quantum states without human intervention offers a promising approach to gaining insight into how machines represent complex quantum states. The ability to interpret the learned representation may offer a new perspective on non-trivial features of quantum systems and their efficient representation. We train a generative model on two-qubit density matrices generated by a parameterized quantum circuit. In a series of computational experiments, we investigate the learned representation of the model and its internal understanding of the data. We observe that the model learns an interpretable representation which relates the quantum states to their underlying entanglement characteristics. In particular, our results demonstrate that the latent representation of the model is directly correlated with the entanglement measure concurrence. The insights from this study represent proof of concept toward interpretable machine learning of quantum states. Our approach offers insight into how machines learn to represent small-scale quantum systems autonomously.

arXiv:2306.05694Machine Learning Science and TechnologyDec 18, 202311 citations

Learning Disentangled Representations with Quantum Variational Autoencoders

Gaoyuan Wang, Jerry Tan, Mark Gerstein

Variational autoencoders are powerful representation learning models that map complex data into low-dimensional latent spaces, enabling the discovery of interpretable and disentangled factors. Such representations can facilitate the interpretation and controllable generation of data describing complex scientific systems. Understanding how these factors are organized and encoded in latent space is therefore important for developing reliable representation learning models. Recently, quantum variational autoencoders (QVAEs) have been proposed as quantum representation models, demonstrating informative latent representations and improved latent-space occupancy through quantum regularization. However, it remains unclear whether and how QVAEs can learn disentangled and interpretable latent factors. A key challenge in investigating quantum latent factors is that a small number of qubits spans an exponentially large Hilbert space, making the notion of an individual quantum latent dimension nontrivial. Here, we investigate what constitutes an individual quantum latent dimension and whether it can encode a distinct factor. We develop theoretical insights into quantum latent dimensions and support them with empirical studies on representative synthetic problems, including MNIST variants. Across three datasets, we demonstrate that QVAEs can discover factorized and semantically interpretable latent representations, with individual qubits functioning as meaningful latent factors. These results establish a foundation for understanding quantum latent spaces and their potential for structured and interpretable representation learning.

quant-pharXiv:2610.07196Oct 7, 20260 citations

Quantum-Based Unsupervised Feature Representation Learning

Jincheng Zhang

This paper explores the potential of quantum computing for unsupervised feature representation learning. Traditional unsupervised methods often rely on manually designed feature extraction algorithms, limiting their applicability to complex datasets. We propose a novel approach leveraging quantum entanglement and quantum gate operations to achieve unsupervised feature extraction directly from raw data. This approach aims to enhance the generalization capability and robustness of machine learning models. The core idea involves constructing a quantum circuit-based model that implicitly maps input data and extracts relevant features through quantum entanglement and gate operations. We present a theoretical framework outlining the methodology and discuss the potential benefits and challenges of this emerging field. The primary goal is to demonstrate that quantum computing offers a fundamentally different paradigm for unsupervised learning, potentially surpassing the limitations of classical approaches. ---

Sep 7, 20260 citations

Quantum generative classification with mixed states

Diego H. Useche, Sergio Quiroga-Sandoval, Sebastián Leonardo L Molina Díaz +3 more

Abstract Classification can be performed using either a discriminative or a generative learning approach. Discriminative learning consists of constructing the conditional probability of the outputs given the inputs, while generative learning consists of constructing the joint probability density of the inputs and outputs. Although most classical and quantum methods are discriminative, there are some advantages of the generative learning approach. For instance, it can be applied to unsupervised learning, statistical inference, uncertainty estimation, and synthetic data generation. In this article, we present a quantum generative multiclass classification strategy, called quantum generative classification (QGC). This model uses a variational quantum algorithm to estimate the joint probability density function of features and labels of a data set by means of a mixed quantum state. We also introduce a quantum map called quantum-enhanced Fourier features, which leverages quantum superposition to prepare high-dimensional data samples in quantum hardware using a small number of qubits. We show that the QGC algorithm can be viewed as a Gaussian mixture that reproduces a kernel Hilbert space of the training data. In addition, we developed a hybrid quantum–classical neural network that shows that it is possible to perform generative classification on high-dimensional data sets. The method was tested on various low- and high-dimensional data sets including the 10-class MNIST and Fashion-MNIST data sets, illustrating that the generative classification strategy is competitive against other previous quantum models.

arXiv:2502.19970Quantum Science and TechnologyJul 23, 20250 citations

Interpretable representation learning of quantum data enabled by probabilistic variational autoencoders

Paulin de Schoulepnikoff, Gorka Muñoz-Gil, Hendrik Poulsen Nautrup +1 more

Interpretable machine learning is rapidly becoming a crucial tool for scientific discovery. Among existing approaches, variational autoencoders (VAEs) have shown promise in extracting the hidden physical features of some input data, with no supervision nor prior knowledge of the system at study. Yet the ability of VAEs to create meaningful, interpretable representations relies on their accurate approximation of the underlying probability distribution of their input. When dealing with quantum data, VAEs must hence account for its intrinsic randomness and complex correlations. While VAEs have been previously applied to quantum data, they have often neglected its probabilistic nature, hindering the extraction of meaningful physical descriptors. Here we demonstrate that two key modifications enable VAEs to learn physically meaningful latent representations: a decoder capable of faithfully reproducing the probability distributions of quantum states and a probabilistic loss tailored to this task. Using benchmark quantum spin models, we identify regimes where standard methods fail while the representations learned by our approach remain meaningful and interpretable. Applied to experimental data from Rydberg atom arrays, the model autonomously uncovers the phase structure without access to prior labels, Hamiltonian details, or knowledge of relevant order parameters, highlighting its potential as an unsupervised and interpretable tool for the study of quantum systems.

arXiv:2506.11982Physical Review ANov 11, 20251 citation

Protocols for trainable and differentiable quantum generative modeling

Oleksandr Kyriienko, Annie E. Paine, Vincent E. Elfving

We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) that enable efficient quantum generative modeling (QGM) and synthetic data generation. Contrary to existing QGM approaches, we perform training of a DQC-based model, where data is encoded in a latent space with the proposed phase feature map of exponential capacity. This is followed by a trainable quantum circuit, forming the model. We then map the trained model to the bit basis using a fixed unitary transformation, in this case corresponding to a quantum Fourier transform circuit. It allows fast sampling from parametrized distributions using a single-shot readout. Importantly, latent space training provides models that are automatically differentiable, and we show how samples from solutions of stochastic differential equations (SDEs) can be accessed by solving stationary and time-dependent Fokker-Planck equations with a quantum protocol. Our approach opens a route to multidimensional generative modeling with qubit registers explicitly correlated via a (fixed) entangling layer. In this case quantum computers can offer advantage as efficient samplers, which perform complex inverse transform sampling enabled by the fundamental laws of quantum mechanics. On a technical side the advances are multiple, as we introduce the phase feature map, analyze its properties, and develop frequency-taming techniques that include qubitwise training and feature map sparsification. Published by the American Physical Society 2024

arXiv:2202.08253Physical Review ResearchSep 12, 202414 citations