Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.
Generative machine learning aims to model probability distributions from sample data. Quantum computers are widely believed to efficiently sample from certain probability distributions that are intractable for classical computers, making quantum circuits promising candidates for generative machine learning. This dissertation investigates quantum generative machine learning models, with a particular focus on Synthetic Data Generation (SDG) and on the Quantum Circuit Born Machine, an algorithm that can be implemented on current quantum hardware. The first part of this dissertation studies SDG algorithms in noiseless simulations. Most of these algorithms rely on an implicit design choice that has not previously been examined: the binary encoding that maps bitstring samples generated by a quantum circuit to real-valued data points. We show that the training performance depends on this choice and analyze the interplay between data structure, circuit ansatz, and encoding. For continuous target distributions, the reflected binary Gray code is particularly effective because it maps similar data points to similar bitstrings and thus preserves the structure of the data. This provides a useful inductive bias that leads, on average, to faster convergence and better synthetic data. We further investigate extensions of SDG algorithms. Contrary to previous findings, we show that quantum models can also learn conditional probability distributions with quality comparable to that of independently trained models. We develop two sample-efficient strategies that enable conditional models to perform classification without additional training. This yields a unified model with both generative and discriminative capabilities. The second part of this dissertation addresses the implementation of such models on real quantum hardware. While current devices can train small-scale models with reasonable resource, larger-scale implementations remain limited by noise. Understanding and modeling this noise is therefore essential for progress. First, we develop a physically motivated noise model for superconducting transmon systems based on Hamiltonian simulation. We show that frequency collisions between energy levels of neighboring transmons can induce crosstalk and may drive the system out of the computational subspace. This model provides a basis for understanding hardware-level error mechanisms and for developing taylored mitigation or correction strategies. Second, we investigate two-qubit error using Long-Sequence Quantum Process Tomography (LS-QPT), assuming well-characterized single-qubit gates. Compared with standard Quantum Process Tomography, LS-QPT reduces the measurement cost by amplifying noise through germ circuits. We show that germ circuits that ideally implement the identity operation amplify a larger subspace of noise processes than other types of germ circuits. We also show that the precision of LS-QPT is fundamentally limited by unlearnable degrees of freedom in the noise model that cannot be amplified. Despite this limitation, the LS-QPT method reduces the total circuit depth required for process tomography by an order of magnitude.
Generative quantum machine learning models are trained to deduce the probability distribution underlying a given dataset, and to produce new, synthetic samples from it. The majority of such models proposed in the literature, like the Quantum Circuit Born Machine (QCBM), fundamentally work on a binary level. Real-world data, however, is often numeric, requiring the models to translate between binary and continuous representations. We analyze how this transition influences the performance of quantum models and show that it requires the models to learn correlations that are solely an artifact of the way the data is encoded, and not related to the data itself. At the same time, structure of the original data, like continuity, can be obscured in the binary representation, hindering generalization. To mitigate these effects, we propose a strategy based on Gray-codes that can be implemented with essentially no overhead, conserves structures in the data, and avoids artificial correlations in situations in which the standard approach creates them. Considering datasets drawn from various low-dimensional probability distributions, we verify that, in most cases, QCBMs using the reflected Gray code learn faster and more accurately than those with standard binary code. This shows that, as complement to specifically tailored circuit ansätze or data pre-processing, binary encodings can be used to introduce inductive biases into generative machine learning models.
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.
Data scarcity and class imbalance are persistent challenges in machine learning that degrade model generalization and introduce predictive bias. We present a hybrid quantum-classical framework for synthetic data generation using a Quantum Circuit Born Machine (QCBM) to address these limitations. The proposed approach exploits quantum mechanical properties -- superposition and entanglement -- within a parameterized variational quantum circuit to model complex probability distributions that are difficult for classical generative methods to capture. Experiments are conducted on two tabular benchmark datasets: the Iris dataset and the Telco Customer Churn dataset. Preprocessing includes normalization and PCA-based dimensionality reduction to enable efficient basis encoding for quantum circuits. The QCBM is trained by minimizing Kullback-Leibler (KL) divergence between real and generated data distributions using a gradient-based parameter-shift optimization rule. Augmenting training data with QCBM-generated synthetic samples at 40-50% of the minority class improves F1-score by approximately 5-15% and minority-class recall by 10-25%. Cross-domain evaluations (Train on Synthetic, Test on Real; and Train on Real, Test on Synthetic) reveal a performance gap of only 3-10%, indicating strong distributional fidelity. Comparative analysis against classical oversampling methods -- SMOTE, Borderline-SMOTE, KMeansSMOTE, and SVM-SMOTE -- shows that QCBM achieves competitive classification performance and produces lower Maximum Mean Discrepancy (MMD) on the Telco dataset, suggesting superior structural similarity in certain imbalanced settings. These findings establish QCBM as a viable complementary tool for data augmentation, particularly for low-dimensional structured tabular data with class imbalance.
High-fidelity circuit execution on noisy intermediate-scale quantum devices is bottlenecked by compilation pipelines that disregard complex, correlated noise. To address this, this methodology article proposes a quantum machine learning control (QMLC) framework for generative quantum circuit synthesis from gate-set tomography (GST) data that bypasses the traditional two-step pipeline of characterizing native quantum gates via GST followed by unitary decomposition algorithms. Instead, a generative concept space is directly learnt from GST data, enabling conditional synthesis of quantum circuits on a desired output distribution. Our approach tokenizes GST germ circuits and embeds them into a structured latent space using a curriculum-learning-motivated strategy, starting with short circuits and progressively incorporating longer ones with diverse output statistics. The embedded sequences are processed by a set-vision transformer with permutation-invariant pooling, producing k-seed vectors that represent the learned concept space of the quantum device. Aggregating data across multiple circuits makes this latent representation inherently context-aware, capturing the shared physical noise environment (e.g., crosstalk, drift) that isolated gate metrics miss. We propose an unconditional diffusion model to sample from the concept space. During inference, a user provides a target measurement distribution, and the model generates a corresponding circuit. To ensure fidelity and robustness, the output is denoised using a diffusion model that operates on the target conditional covariance matrix. This end-to-end framework is a step towards context-aware, hardware-native circuit synthesis directly from raw GST data, which offers a new paradigm for integrating quantum control and compilation. The QMLC framework is particularly suited for near-term quantum devices with complex calibration procedures.
We propose an approach to generative quantum machine learning that overcomes the fundamental scaling issues of variational quantum circuits. The core idea is to use a class of generative models based on instantaneous quantum polynomial circuits, which we show can be trained efficiently on classical hardware. Although training is classically efficient, sampling from these circuits is widely believed to be classically hard, and so computational advantages are possible when sampling from the trained model on quantum hardware. By combining our approach with a data-dependent parameter initialisation strategy, we do not encounter issues of barren plateaus and successfully circumvent the poor scaling of gradient estimation that plagues traditional approaches to quantum circuit optimisation. We investigate and evaluate our approach on a number of real and synthetic datasets, training models with up to one thousand qubits and hundreds of thousands of parameters. We find that the quantum models can successfully learn from high dimensional data, and perform surprisingly well compared to simple energy-based classical generative models trained with a similar amount of hyperparameter optimisation. Overall, our work demonstrates that a path to scalable quantum generative machine learning exists and can be investigated today at large scales.
This thesis presents original contributions at the intersection of quantum computing and machine learning, investigating how these two fields can benefit from each other. The first part of the thesis presents two applications of machine learning techniques in quantum computing. The first contribution involves the use of artificial neural networks for the decoding of quantum error correction codes, resulting in faster decoding times while maintaining a high level of accuracy. The originality of this work lies in the application of explainable machine learning techniques to both improve the decoding performance and to provide insights into the decoding process. The second contribution introduces a novel technique based on reinforcement learning to characterize and simulate the noise affecting a quantum chip. This technique reduces the heuristic assumption on the noise model, making it more adaptable to the specific noise characteristics of the quantum device. In the second part of the thesis, we demonstrate, with two examples, how it is possible to implement machine learning algorithms on quantum devices by replacing artificial neural networks with parametrized quantum circuits. The first contribution in this section introduces a quantum anomaly detection algorithm, applied to the field of high-energy physics. This algorithm allows for the identification of anomalous patterns in quantum data, maintaining a level of accuracy comparable to classical algorithms. The novelty of this work lies in the first use of quantum circuits for the task of anomaly detection in a muon drift chamber trigger system, with possible future applications to quantum detector systems in high-energy physics experiments. The second contribution presents the quantum version of a generative diffusion model, able to sample quantum states from a well-defined distribution. This first implementation of a quantum diffusion model is not meant to outperform classical models, but rather to show potential advantages and limitations of these kinds of algorithms. The aim of the thesis is to show how quantum computing can benefit from machine learning, and how machine learning can be implemented on quantum devices, setting the stage for future advancements in both fields.