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

Towards efficient quantum algorithms for diffusion probabilistic models

Yunfei Wang, Ruoxi Jiang, Yingda Fan, Xiaowei Jia, Jens Eisert, Junyu Liu, Jin-Peng Liu

Published Feb 20, 2025• 17 citations
arXivHTMLPDF

Abstract

A diffusion probabilistic model (DPM) is a generative model renowned for its ability to produce high-quality outputs in tasks such as image and audio generation. However, training DPMs on large, high-dimensional datasets such as high-resolution images or audio incurs significant computational, energy, and hardware costs. In this work, we introduce efficient quantum algorithms for implementing DPMs through various quantum ODE solvers. These algorithms highlight the potential of quantum Carleman linearization for diverse mathematical structures, leveraging state-of-the-art quantum linear system solvers (QLSS) or linear combination of Hamiltonian simulations (LCHS). Specifically, we focus on two approaches: DPM-solver-$k$ which employs exact $k$-th order derivatives to compute a polynomial approximation of $ε_θ(x_λ,λ)$; and UniPC which uses finite difference of $ε_θ(x_λ,λ)$ at different points $(x_{s_m}, λ_{s_m})$ to approximate higher-order derivatives. As such, this work represents one of the most direct and pragmatic applications of quantum algorithms to large-scale machine learning models, presumably taking substantial steps towards demonstrating the practical utility of quantum computing.

DOI
10.48550/arxiv.2502.14252

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.05866•Physical Review Letters•Mar 5, 2024•75 citations

Efficient Quantum Simulation for Nonlinear Stochastic Differential Equations

Xiangyu Li, Ahmet Burak Catli, Ho Kiat Lim +4 more

Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the large number of degrees of freedom, and it is challenging on quantum computers due to the linear and unitary nature of quantum mechanics. We develop a quantum algorithm to tackle nonlinear differential equations driven by the Ornstein-Uhlenbeck (OU) stochastic process. The query complexity of our algorithm scales logarithmically with the error tolerance and nearly quadratically with the simulation time. Our algorithmic framework comprises probabilistic Carleman linearization (PCL) to tackle nonlinearity coupled with stochasticity, and stochastic linear combination of Hamiltonian simulations (SLCHS) to simulate stochastic non-unitary dynamics. We obtain probabilistic exponential convergence for the Carleman linearization of Liu et al. [1], provided the NSDE is stable and reaches a steady state. We extend deterministic LCHS to stochastic linear differential equations, retaining near-optimal parameter scaling from An et al. [2] except for the nearly quadratic time scaling. This is achieved by using Monte Carlo integration for time discretization of both the stochastic inhomogeneous term in LCHS and the truncated Dyson series for each Hamiltonian simulation.

quant-pharXiv:2603.12398•Mar 16, 2026•5 citations

Quantum Diffusion Models for Generative AI towards real-world applications

Marco Parigi

Generative Artificial Intelligence is one of the most relevant technologies of our century, enabling digital machines not only to analyze or classify data but also to generate new content such as images, text, and video. This technology relies on deep learning algorithms designed to capture complex relationships from finite data sets. In this context, Diffusion Models have recently emerged as state-of-the-art in deep generative modeling thanks to their ability to produce high-quality data. Their pipeline typically consists of a forward diffusion process, where data samples are progressively corrupted into pure (classical) noise, and a reverse denoising process, where deep neural networks learn to reverse the diffusion process and then generate new synthetic samples. In parallel, Quantum Machine Learning represents one of the most promising applications of quantum computing. However, currently available quantum processors, known as Noisy Intermediate-Scale Quantum (NISQ) devices, are composed of tens or hundreds of noisy qubits. Therefore, designing scalable and efficient practical quantum algorithms represents a significant challenge. This thesis proposes the first generalization of classical Denoising Diffusion Probabilistic Models to the quantum domain, introducing the novel generative paradigm of Quantum Diffusion Models. In particular, the three possible scenarios are formalized and implemented: (i) classical data corrupted with Gaussian noise and a reverse process implemented via a quantum neural network; (ii) quantum data corrupted with quantum noise and a denoising process through a classical deep neural network; and (iii) a fully quantum approach, where both forward and backward processes are implemented within a quantum framework. Subsequently, the impact of different stochastic dynamics in the forward process is analyzed using the formalism of Quantum Stochastic Walks. We observe that a specific hybrid quantum-classical dynamics produces more statistically robust models, capable of generating sets of images closely resembling real ones compared to purely classical dynamics. Furthermore, we propose a hybrid quantum-classical diffusion model based on Quantum Walks that exploits the intrinsic noise of real quantum processors as a useful resource for generating images. This model is implementable on current NISQ devices and scalable, as it allows the generation of images of any size, requiring q + 1 qubits for grayscale images with pixel intensities in the range [0, 2^q - 1]. Finally, an application in the context of medical imaging is presented, specifically the generation of 64 × 64 color images of blood cells from the BloodMNIST dataset and 200 × 200 brain MRI images from the BraTS2020 dataset.

•Jan 1, 2026•0 citations

Quantum algorithms for linear and non-linear fractional reaction-diffusion equations

Dong An, Konstantina Trivisa

High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the spatial dimension, a quantum computer can produce a quantum state that encodes the solution with only polynomial complexity, provided that suitable input access is available. In this work, we investigate efficient quantum algorithms for linear and nonlinear fractional reaction-diffusion equations with periodic boundary conditions. For linear equations, we analyze and compare the complexity of various methods, including the second-order Trotter formula, time-marching method, and truncated Dyson series method. We also present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism, resulting in optimal scaling in the spatial dimension. For nonlinear equations, we employ the Carleman linearization method and propose a block-encoding version that is appropriate for the dense matrices that arise from the spatial discretization of fractional reaction-diffusion equations.

arXiv:2310.18900•Quantum•Jan 19, 2026•13 citations

QT-Enhanced Generative Intelligence and Data Synthesis: Quantum-Enhanced Diffusion Models

K. Thiruvarangan, Eshwaran Renganath

Generative AI is one of the modern humankind's most transformative fields, paving a path for machines to generate realistic information in many forms (e.g., images/text/audio/video/scientific data). Diffusion models are the system that recently showed how to learn to generate them step by step by reversing stochastic noise processes through normalisation layers. Such models outperformed previous techniques including Generative Adversarial Networks (GANs) in terms of stability, diversity and controllability. While, despite those successes, classical diffusion models have major limitations such as expensive computations, slow sampling times or great training pipeline requirements and some challenges when modelling ultra-high-dimensional probability distributions. Emerging computational paradigms to accelerate and enhance generative intelligence systems have come when data complexity is becoming more challenging in domains like healthcare, finance, cybersecurity, climate science, industrial automation. One of the main solutions being offered by quantum computing, which takes advantage of quantum mechanical principles exploits superposition, entanglement and quantum parallelism to process information in a fundamentally new way. QEDMs, or Quantum-Enhanced Diffusion Models, specify a hybrid architecture that integrates classical diffusion architectures with quantum circuits, quantum kernels or variation quantum neural networks to improve learning efficiency and quality of the generated samples. Quantum processors can be included in these models as part of their noise estimates, latent representation learning, optimization routines or probabilistic sampling stages. This integration can lead to less-complex models, faster convergence, better feature extraction and more informative multimodal outputs. In addition, one could potential zing QEDMs for simulating molecular data, material discovery, optimizing synthetic dataset and privacy conserving data generation via quantum randomness. In this paper, we review the theory, architecture, implementation schemes, applications and future scope of Quantum-Enhanced Diffusion Models for Generative Intelligence and Data Synthesis. It contrasts demonising score matching, latent-space transitions, and stochastic reverse diffusion processes with quantum resources. This comparative analysis illustrates the anticipated enhancements in computational scalability, accuracy, and energy efficiency in contrast to existing methods. It also tackles real-world issues, including finite quit counts, DE coherence and noise in near-term quantum hardware, integration overhead and algorithmic complexity. Last but not least the paper suggests future research directions with respect to fault-tolerant quantum systems, quantum cloud delivery frameworks, federated generative intelligence and autonomous creative systems. Combining the strengths of probabilistic deep learning, but leveraging the transformative power of quantum computation, quantum-enhanced generative models could become a foundational technology for the next generation of artificial intelligence.

International Journal of Quantum Computing and Artificial Intelligence (IJQCAI)•Mar 27, 2026•0 citations

Learning Quantum Data Distribution via Chaotic Quantum Diffusion Model

Quoc Hoan Tran, Koki Chinzei, Yasuhiro Endo +1 more

Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum physics. Quantum denoising diffusion probabilistic models (QuDDPMs) enable efficient learning of quantum data distributions by progressively scrambling and denoising quantum states. However, existing implementations typically rely on circuit-based random unitary dynamics, which can be costly to implement and sensitive to control imperfections, particularly on analog quantum hardware. We propose the chaotic quantum diffusion model, a framework that generates projected ensembles via chaotic Hamiltonian time evolution, providing a flexible and hardware-compatible diffusion mechanism. Requiring only global, time-independent control, our approach substantially reduces implementation overhead across diverse analog quantum platforms while achieving accuracy comparable to QuDDPMs. This method improves trainability and robustness, broadening the applicability of quantum generative modeling.

quant-pharXiv:2602.22061•Physical Review Applied•Feb 26, 2026•0 citations
A diffusion probabilistic model (DPM) is a generative model renowned for its ability to produce high-quality outputs in tasks such as image and audio generation. However, training DPMs on large, high-dimensional datasets such as high-resolution images or audio incurs significant computational, energy, and hardware costs. In this work, we introduce efficient quantum algorithms for implementing DPMs through various quantum ODE solvers. These algorithms highlight the potential of quantum Carleman linearization for diverse mathematical structures, leveraging state-of-the-art quantum linear system solvers (QLSS) or linear combination of Hamiltonian simulations (LCHS). Specifically, we focus on two approaches: DPM-solver-kkk which employs exact kkk-th order derivatives to compute a polynomial approximation of εθ(xλ,λ)ε_θ(x_λ,λ)εθ​(xλ​,λ); and UniPC which uses finite difference of εθ(xλ,λ)ε_θ(x_λ,λ)εθ​(xλ​,λ) at different points (xsm,λsm)(x_{s_m}, λ_{s_m})(xsm​​,λsm​​) to approximate higher-order derivatives. As such, this work represents one of the most direct and pragmatic applications of quantum algorithms to large-scale machine learning models, presumably taking substantial steps towards demonstrating the practical utility of quantum computing.
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.
Nonlinear stochastic differential equations (NSDEs) are a pillar of mathematical modeling for scientific and engineering applications. Accurate and efficient simulation of large-scale NSDEs is prohibitive on classical computers due to the large number of degrees of freedom, and it is challenging on quantum computers due to the linear and unitary nature of quantum mechanics. We develop a quantum algorithm to tackle nonlinear differential equations driven by the Ornstein-Uhlenbeck (OU) stochastic process. The query complexity of our algorithm scales logarithmically with the error tolerance and nearly quadratically with the simulation time. Our algorithmic framework comprises probabilistic Carleman linearization (PCL) to tackle nonlinearity coupled with stochasticity, and stochastic linear combination of Hamiltonian simulations (SLCHS) to simulate stochastic non-unitary dynamics. We obtain probabilistic exponential convergence for the Carleman linearization of Liu et al. [1], provided the NSDE is stable and reaches a steady state. We extend deterministic LCHS to stochastic linear differential equations, retaining near-optimal parameter scaling from An et al. [2] except for the nearly quadratic time scaling. This is achieved by using Monte Carlo integration for time discretization of both the stochastic inhomogeneous term in LCHS and the truncated Dyson series for each Hamiltonian simulation.
Generative Artificial Intelligence is one of the most relevant technologies of our century, enabling digital machines not only to analyze or classify data but also to generate new content such as images, text, and video. This technology relies on deep learning algorithms designed to capture complex relationships from finite data sets. In this context, Diffusion Models have recently emerged as state-of-the-art in deep generative modeling thanks to their ability to produce high-quality data. Their pipeline typically consists of a forward diffusion process, where data samples are progressively corrupted into pure (classical) noise, and a reverse denoising process, where deep neural networks learn to reverse the diffusion process and then generate new synthetic samples. In parallel, Quantum Machine Learning represents one of the most promising applications of quantum computing. However, currently available quantum processors, known as Noisy Intermediate-Scale Quantum (NISQ) devices, are composed of tens or hundreds of noisy qubits. Therefore, designing scalable and efficient practical quantum algorithms represents a significant challenge. This thesis proposes the first generalization of classical Denoising Diffusion Probabilistic Models to the quantum domain, introducing the novel generative paradigm of Quantum Diffusion Models. In particular, the three possible scenarios are formalized and implemented: (i) classical data corrupted with Gaussian noise and a reverse process implemented via a quantum neural network; (ii) quantum data corrupted with quantum noise and a denoising process through a classical deep neural network; and (iii) a fully quantum approach, where both forward and backward processes are implemented within a quantum framework. Subsequently, the impact of different stochastic dynamics in the forward process is analyzed using the formalism of Quantum Stochastic Walks. We observe that a specific hybrid quantum-classical dynamics produces more statistically robust models, capable of generating sets of images closely resembling real ones compared to purely classical dynamics. Furthermore, we propose a hybrid quantum-classical diffusion model based on Quantum Walks that exploits the intrinsic noise of real quantum processors as a useful resource for generating images. This model is implementable on current NISQ devices and scalable, as it allows the generation of images of any size, requiring q + 1 qubits for grayscale images with pixel intensities in the range [0, 2^q - 1]. Finally, an application in the context of medical imaging is presented, specifically the generation of 64 × 64 color images of blood cells from the BloodMNIST dataset and 200 × 200 brain MRI images from the BraTS2020 dataset.
High-dimensional fractional reaction-diffusion equations have numerous applications in the fields of biology, chemistry, and physics, and exhibit a range of rich phenomena. While classical algorithms have an exponential complexity in the spatial dimension, a quantum computer can produce a quantum state that encodes the solution with only polynomial complexity, provided that suitable input access is available. In this work, we investigate efficient quantum algorithms for linear and nonlinear fractional reaction-diffusion equations with periodic boundary conditions. For linear equations, we analyze and compare the complexity of various methods, including the second-order Trotter formula, time-marching method, and truncated Dyson series method. We also present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism, resulting in optimal scaling in the spatial dimension. For nonlinear equations, we employ the Carleman linearization method and propose a block-encoding version that is appropriate for the dense matrices that arise from the spatial discretization of fractional reaction-diffusion equations.
Generative AI is one of the modern humankind's most transformative fields, paving a path for machines to generate realistic information in many forms (e.g., images/text/audio/video/scientific data). Diffusion models are the system that recently showed how to learn to generate them step by step by reversing stochastic noise processes through normalisation layers. Such models outperformed previous techniques including Generative Adversarial Networks (GANs) in terms of stability, diversity and controllability. While, despite those successes, classical diffusion models have major limitations such as expensive computations, slow sampling times or great training pipeline requirements and some challenges when modelling ultra-high-dimensional probability distributions. Emerging computational paradigms to accelerate and enhance generative intelligence systems have come when data complexity is becoming more challenging in domains like healthcare, finance, cybersecurity, climate science, industrial automation. One of the main solutions being offered by quantum computing, which takes advantage of quantum mechanical principles exploits superposition, entanglement and quantum parallelism to process information in a fundamentally new way. QEDMs, or Quantum-Enhanced Diffusion Models, specify a hybrid architecture that integrates classical diffusion architectures with quantum circuits, quantum kernels or variation quantum neural networks to improve learning efficiency and quality of the generated samples. Quantum processors can be included in these models as part of their noise estimates, latent representation learning, optimization routines or probabilistic sampling stages. This integration can lead to less-complex models, faster convergence, better feature extraction and more informative multimodal outputs. In addition, one could potential zing QEDMs for simulating molecular data, material discovery, optimizing synthetic dataset and privacy conserving data generation via quantum randomness. In this paper, we review the theory, architecture, implementation schemes, applications and future scope of Quantum-Enhanced Diffusion Models for Generative Intelligence and Data Synthesis. It contrasts demonising score matching, latent-space transitions, and stochastic reverse diffusion processes with quantum resources. This comparative analysis illustrates the anticipated enhancements in computational scalability, accuracy, and energy efficiency in contrast to existing methods. It also tackles real-world issues, including finite quit counts, DE coherence and noise in near-term quantum hardware, integration overhead and algorithmic complexity. Last but not least the paper suggests future research directions with respect to fault-tolerant quantum systems, quantum cloud delivery frameworks, federated generative intelligence and autonomous creative systems. Combining the strengths of probabilistic deep learning, but leveraging the transformative power of quantum computation, quantum-enhanced generative models could become a foundational technology for the next generation of artificial intelligence.
Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum physics. Quantum denoising diffusion probabilistic models (QuDDPMs) enable efficient learning of quantum data distributions by progressively scrambling and denoising quantum states. However, existing implementations typically rely on circuit-based random unitary dynamics, which can be costly to implement and sensitive to control imperfections, particularly on analog quantum hardware. We propose the chaotic quantum diffusion model, a framework that generates projected ensembles via chaotic Hamiltonian time evolution, providing a flexible and hardware-compatible diffusion mechanism. Requiring only global, time-independent control, our approach substantially reduces implementation overhead across diverse analog quantum platforms while achieving accuracy comparable to QuDDPMs. This method improves trainability and robustness, broadening the applicability of quantum generative modeling.