Abstract Quantum denoising diffusion models have recently emerged as a powerful framework for generative quantum machine learning. In this work, we extend these models by introducing a conditioning mechanism that enables the generation of quantum states drawn from multiple target distributions. By sharing parameters across distinct classes of quantum states, our approach avoids the need to train separate models for each distribution. We validate our method through numerical simulations that span single-qubit generation tasks, entangled state preparation, and many-body ground state generation. Across these tasks, conditioning significantly reduced the error of targeted state generation by more than an order of magnitude. Finally, we perform an ablation study to quantify the effect of key hyperparameters on the model performance.
Abstract Quantum denoising diffusion models have recently emerged as a powerful framework for generative quantum machine learning. In this work, we extend these models by introducing a conditioning mechanism that enables the generation of quantum states drawn from multiple target distributions. By sharing parameters across distinct classes of quantum states, our approach avoids the need to train separate models for each distribution. We validate our method through numerical simulations that span single-qubit generation tasks, entangled state preparation, and many-body ground state generation. Across these tasks, conditioning significantly reduced the error of targeted state generation by more than an order of magnitude. Finally, we perform an ablation study to quantify the effect of key hyperparameters on the model performance.
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.
Quantum generative models exploit quantum superposition and entanglement to enhance learning efficiency for both classical and quantum data. Recently, inspired by classical diffusion frameworks, the quantum denoising diffusion probabilistic model has emerged as a powerful tool for learning correlated noise models, many-body phases, and topological data structures. However, we demonstrate that this framework is currently restricted to small-scale systems. As the system size increases, a severe barren plateau problem emerges, fundamentally limiting the model's scalability. We provide rigorous theoretical proofs and experimental validation to identify the origin of this barren plateau, distinct from previously known causes. To restore trainability, we introduce an enhanced architecture that effectively mitigates the barren plateau phenomenon and guarantees the model's trainability in the tested settings. Building on this architecture, we further propose a conditional quantum denoising diffusion probabilistic model, capable of generating ground states based on Hamiltonian parameters, expanding the utility of quantum generative models for complex quantum state preparation to a certain extent. Our approach not only holds the potential to address the scalability and trainability bottlenecks of quantum diffusion models, but also provides a robust tool for exploring complex quantum matter and state preparation in the NISQ era.
Generative quantum machine learning has gained significant attention for its ability to produce quantum states with desired distributions. Among various quantum generative models, quantum denoising diffusion probabilistic models (QuDDPMs) [Zhang et al., Phys. Rev. Lett. 132, 100602 (2024)] provide a promising approach with stepwise learning that resolves the training issues. However, the requirement of high-fidelity scrambling unitaries in QuDDPMs poses a challenge to near-term implementation. We propose a mixed-state quantum denoising diffusion probabilistic model (MSQuDDPM) to eliminate the need for scrambling unitaries. Our approach focuses on adapting the quantum noise channels to the model architecture, which integrates depolarizing noise channels in the forward diffusion process and parameterized quantum circuits with projective measurements in the backward denoising steps. We also introduce several techniques to improve MSQuDDPM, including a cosine-exponent schedule of noise interpolation, the use of a single-qubit random ancilla, and superfidelity-based cost functions to enhance the convergence. We evaluate MSQuDDPM on quantum ensemble generation tasks, demonstrating its successful performance.
Quantum computing holds immense potential, yet its practical success depends on multiple factors, including advances in quantum circuit design. In this paper, we introduce a generative approach based on denoising diffusion models (DMs) to synthesize parameterized quantum circuits (PQCs). Extending the recent diffusion model pipeline of [1], our model effectively conditions the synthesis process, enabling the simultaneous generation of circuit architectures and their continuous gate parameters. We demonstrate our approach in synthesizing PQCs optimized for generating high-fidelity Greenberger-Horne-Zeilinger (GHZ) states and achieving high accuracy in quantum machine learning (QML) classification tasks. Our Results indicate a strong generalization across varying gate sets and scaling qubit counts, highlighting the versatility and computational efficiency of diffusion-based methods. This work illustrates the potential of generative models as a powerful tool for accelerating and optimizing the design of PQCs, supporting the development of more practical and scalable quantum applications.
Mixed quantum states are the native description of many physically important quantum systems, making their generation a fundamental task in quantum information processing. However, constructing a diffusion process that generates density operators while keeping every reverse step physically valid remains nontrivial. This work introduces Quantum Generative Diffusion Model (QGDM), a fully quantum-mechanical model whose forward and backward processes are grounded in quantum channel theory. Through a non-unitary forward process, any target quantum state can be transformed into a completely mixed state. A trainable backward process recovers the former from the latter. We introduce partial trace to make the backward process non-unitary, and share parameters across timesteps by incorporating temporal information as an input. We present QGDM's resource-efficient version to reduce auxiliary qubits while preserving generative capabilities. We theoretically analyze the denoising design, showing it avoids a low-loss shortcut that traps training and cause generation failure. Simulations confirm that QGDM outperforms quantum generative adversarial networks on random pure- and mixed-state generation, with better noise robustness than other quantum generative models and a task-specialized approach for practical Gibbs state generation. Hence, QGDM provides a channel-based diffusion framework for learning fixed mixed-state targets, extending quantum generative modeling toward realistic quantum information settings.
Abstract Denoising diffusion probabilistic models have become increasingly important in machine learning, but their quantum counterpart has not been studied yet. In this work, we propose a quantum version of a generative diffusion model. In this algorithm, artificial neural networks are replaced with parameterized quantum circuits, in order to manipulate quantum states directly. We present both a full quantum version and a latent classical-quantum version of the algorithm. In the latent model, the parameterized quantum circuits are trained in a low dimensional representation of data, obtained by employing a pre-trained classical autoencoder. For both models, we show a method for conditioning the output distribution, utilizing ancillary qubits. The models' performance have been evaluated using quantitative metrics complemented by qualitative assessments. For the latent model, we show the implementation of a simplified version on real quantum hardware. The execution on a NISQ device allows to evaluate the performance of the algorithm in the presence of noise.