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

Leveraging Quantum Measurement Randomness for Shot-Efficient Diffusion Models

Tianhao Guo, Dianxin Zheng, Yuhua Qian, Yaohui Zheng, Yuzhi Yang, Merouane Debbah, Chau Yuen

quant-phcs.LGSubmitted Oct 30, 2026• Announced Nov 2, 2026• 0 citations
arXivHTMLPDF

Abstract

In quantum computing, the readout always carries finite-shot sampling noise. Suppressing this noise through repeated measurements raises the cost of a quantum neural network (QNN). Meanwhile, a stochastic diffusion sampler deliberately adds randomness at each reverse (generation) step. This paper turns the measurement noise from a liability into a resource. Specifically, we use the noise quantum measurement produces anyway to replace part of the noise the sampler would otherwise inject. We characterize the measurement error as multinomial sampling noise propagated through a trainable linear readout. To connect the circuit's Born probabilities to the denoising task, we further formulate the diffusion process on a bounded zero-sum hyperplane mapped to the probability simplex. Therefore, we can employ a compensation noise to match the mean and covariance of the shot-noise-free linear update under some minimum shot conditions. Solving this condition for the shot count gives a state-dependent adaptive budget. For the denoising diffusion implicit model (DDIM), this budget increases as the sampler becomes more deterministic. On an eight-dimensional Gaussian mixture, the schedule achieves comparable generation quality with $303$ shots per sample against a high-shot reference of $1.6\times10^{6}$, about $5300\times$ fewer. Latent diffusion experiments on MNIST further validate the proposed mechanism for generation in a learned latent space.

AI Summary

Stochastic diffusion samplers deliberately inject noise, while quantum denoisers require repeated measurements to suppress readout noise. This paper asks whether finite-shot fluctuations can replace part of the injected randomness, reducing measurement costs without changing the intended reverse-step statistics. The construction combines a quantum-circuit denoiser with a classical linear readout and represents data on a bounded zero-sum hyperplane mapped into the probability simplex. Multinomial measurement covariance is propagated through the readout. If $C_t$ denotes the readout covariance before division by shot count, covariance compensation requires $\sigma_t^2\Xi-k_t^2C_t/M_t\succeq0$, where $k_t$ propagates denoiser error and $\sigma_t$ sets injected noise. This yields $M_t\ge k_t^2\lambda_{\max}(C_t)/\sigma_t^2$ and approximately $M_t\propto\eta^{-2}$ near deterministic DDIM sampling. Conditional means and covariances match exactly under the idealized conditions; distribution matching additionally uses a Gaussian approximation. Simulation experiments use a three-component Gaussian mixture and MNIST latents supplied by a fixed VAE. For the mixture, adaptive sampling uses 303 shots per generated sample versus a $1.6\times10^6$-shot reference, with resolved fraction 0.941 and $\mathrm{MMD}^2=0.0049$. Uniform allocation needs roughly four times the adaptive budget for comparable resolved fraction. Three-qubit MNIST generation uses 430 shots per sample, with image-space $\mathrm{MMD}^2=0.0312$. Limitations include simulator-exact probabilities for shot allocation, exact-probability training, non-Gaussian errors at low shot counts, estimated residual covariances, feasibility projections, shot caps, and denoiser approximation. Their effects lack distributional guarantees. Validation excludes gate and decoherence errors; hardware operation and nonlinear readouts remain open.

Some signs of AI-generated textSmall numerics onlyMissing comparisonStrong assumptions

Error found: Algorithm 1's plug-in residual covariance produces an excess update covariance of k_t^2 C/M^2 before clipping, so the implemented sampler does not inherit the ideal exact moment-matching guarantee. The reported 303-shot allocation relies on uncharged exact simulator probabilities and therefore does not demonstrate that measurement cost for a hardware-accessible adaptive rule. The per-dimension model's diagonal noise derivation assumes independent coordinate measurements, which is not generally compatible with the simultaneous entangled-circuit readout used in its execution accounting. The proposed affine encoding covers only a restricted part of the probability simplex, and its claimed clamped inverse can violate the zero-sum constraint.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
13 pages, 13 figures, 3 tables

Related papers

Quantum Denoising Diffusion Model Based on Gaussian Boson Sampling

Chengyang Zhang, Yuhu Lu, Zimeng Xiao +1 more

ABSTRACT Diffusion models excel in generative modeling for complex distributions, but suffer from parameter inefficiency. Quantum variants partly address this via quantum resources, yet significant room remains for enhancing denoising efficiency. A quantum denoising diffusion model based on Gaussian boson sampling is proposed to further enhance denoising efficiency, which employs a trainable boson sampling circuit instead of traditional neural networks for backward denoising. Our model demonstrates superior denoising efficiency compared to both selected quantum denoising diffusion models and classical diffusion models(specified later in the text) on the MNIST handwritten digit dataset under the same number of training parameters. Moreover, our model achieves good denoising results under four different noise addition methods, which indicates its robust generalization capabilities. These results provide a paradigm for enhancing the denoising efficiency of quantum denoising diffusion models.

Advanced Quantum Technologies•Dec 22, 2025•1 citation

Measurement-induced overconcentration in quantum generative models

Runzhe Mo, Bingzhi Zhang, Quntao Zhuang

Quantum measurement is a key resource for quantum generative learning, providing intrinsic stochasticity for generating diverse quantum samples. However, in measurement-assisted state-ensemble resampling, repeated measurements can also induce overconcentration: under a fixed measurement trajectory, distinct input states progressively converge toward similar output states, suppressing input-dependent diversity. To diagnose this effect, we introduce three complementary metrics: accuracy, generative power, and input sensitivity. For Haar-random monitored circuits, we prove that one-step models retain input sensitivity up to dimension-suppressed corrections, whereas sequential monitored circuits exhibit a depth-dependent loss of input sensitivity. Motivated by this diagnosis, we propose a truncated quantum denoising diffusion probabilistic model (QuDDPM), which restricts the temporal depth of both the forward diffusion and reverse denoising processes. Numerical benchmarks show that truncated QuDDPM preserves stronger input sensitivity while maintaining accuracy and generative power comparable to the original model. These results identify measurement-induced overconcentration as a dynamical limitation of deep monitored quantum generative models and establish temporal depth as a design parameter for balancing measurement-induced randomness with input-dependent diversity.

quant-pharXiv:2607.10055•Jul 14, 2026•2 citations

An Hybrid Quantum-Classical Diffusion Model for Image Generation

Qipeng Qian, Keli Deng, Yuntao Qian

Quantum diffusion models provide a physics-consistent route to generative learning by formulating noising and denoising directly on quantum states. However, applying such models to classical high-dimensional data is constrained by the qubit cost of state encoding and the computational burden of simulating large density operators. We propose a scalable hybrid generative pipeline that combines a classical autoencoder for dimensionality reduction with a mixed-state quantum denoising diffusion probabilistic model (MSQuDDPM) operating in the learned latent space. The autoencoder compresses data into compact latent codes that can be embedded into a small-qubit Hilbert space, after which the quantum diffusion model learns a generative distribution over latent density operators and decodes samples back to the original domain. Algorithmically, we simplify the reverse dynamics by predicting an estimate of the clean state $ρ_0$ at timestep $t$ and computing the one-step reverse update via an analytic backward propagation rule, rather than learning an explicit predictor for $ρ_{t-1}$. We demonstrate the proposed approach on MNIST image generation and discuss how mixed-state quantum diffusion can serve as a practical backbone for hybrid quantum--classical generative modeling under realistic qubit budgets.

arXiv:2607.07072•Jul 8, 2026•0 citations

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

Quantum Error Mitigation via Autoencoder Neural Networks

Xiao-Dao Lin, Hsi-Ming Chang, Jhih-Shih You +1 more

Quantum computing has gained significant attention in recent years, with numerous algorithms and applications under active development. Limited by the current quantum technology, quantum noise and readout error have become critical issues. Various methods have been proposed to address readout error through error mitigation techniques, typically involving post-processing of measurement data. However, most of these methods increase the quantum hardware overhead, leading to higher computational costs. In this work, we present a machine-learning-based approach that minimizes hardware overhead while improving accuracy of the measurement probability distributions. We employed a convolutional neural network (CNN) autoencoder, commonly used for image denoising, as our baseline model. The datasets were derived from 4-qubit random circuits with depths ranging from 1 to 18, generated using Qiskit backends for target and noisy measurement data. The model was trained using mean squared error (MSE) as the loss function and Adam optimizer over 500 epochs, achieving an average noise reduction by 95% across the validation set, with no signs of overfitting. To validate the model's effectiveness across diverse quantum states, we conducted extensive tests on both typical quantum circuits and algorithms, including Grover's search algorithm, Quantum Fourier Transform, Haar random circuits and Trivial Paramagnet. The results demonstrated consistent and robust denoising in noisy measurement data, indicating that the autoencoder model is well-suited for efficient quantum error mitigation for current noisy quantum computers. This work contributes to the advancement of quantum error mitigation techniques using machine learning.

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 25, 2025•1 citation

Single-shot quantum neural networks with amplitude estimation

Jaemin Seo

Quantum neural networks (QNNs) suffer from a fundamental sampling bottleneck since quantum measurements are probabilistic, requiring many circuit executions to estimate outputs with sufficient accuracy. Conventional Monte-Carlo (MC) inference exhibits an $\mathcal{O}(1/\sqrt{N})$ sampling error, rendering QNN inference and training costly on near-term quantum hardware, especially where each shot requires expensive qubit generation. This work introduces a "single-shot" QNN framework by integrating quantum amplitude estimation (AE) into the readout stage. By embedding a trained QNN as a state-preparation oracle within AE, outputs are estimated through coherent interference rather than repeated sampling. We demonstrate that AE-based QNN inference achieves an $\mathcal{O}(1/N)$ error even with a single shot. We further analyze noise robustness and training feasibility, showing that AE can be a powerful primitive for overcoming the sampling overhead of QNNs. This highlights that when the model itself is quantum, quantum algorithms can enhance the computation efficiency.

quant-pharXiv:2604.19320•Apr 22, 2026•0 citations
In quantum computing, the readout always carries finite-shot sampling noise. Suppressing this noise through repeated measurements raises the cost of a quantum neural network (QNN). Meanwhile, a stochastic diffusion sampler deliberately adds randomness at each reverse (generation) step. This paper turns the measurement noise from a liability into a resource. Specifically, we use the noise quantum measurement produces anyway to replace part of the noise the sampler would otherwise inject. We characterize the measurement error as multinomial sampling noise propagated through a trainable linear readout. To connect the circuit's Born probabilities to the denoising task, we further formulate the diffusion process on a bounded zero-sum hyperplane mapped to the probability simplex. Therefore, we can employ a compensation noise to match the mean and covariance of the shot-noise-free linear update under some minimum shot conditions. Solving this condition for the shot count gives a state-dependent adaptive budget. For the denoising diffusion implicit model (DDIM), this budget increases as the sampler becomes more deterministic. On an eight-dimensional Gaussian mixture, the schedule achieves comparable generation quality with 303303303 shots per sample against a high-shot reference of 1.6×1061.6\times10^{6}1.6×106, about 5300×5300\times5300× fewer. Latent diffusion experiments on MNIST further validate the proposed mechanism for generation in a learned latent space.
Stochastic diffusion samplers deliberately inject noise, while quantum denoisers require repeated measurements to suppress readout noise. This paper asks whether finite-shot fluctuations can replace part of the injected randomness, reducing measurement costs without changing the intended reverse-step statistics.
The construction combines a quantum-circuit denoiser with a classical linear readout and represents data on a bounded zero-sum hyperplane mapped into the probability simplex. Multinomial measurement covariance is propagated through the readout. If CtC_tCt​ denotes the readout covariance before division by shot count, covariance compensation requires σt2Ξ−kt2Ct/Mt⪰0\sigma_t^2\Xi-k_t^2C_t/M_t\succeq0σt2​Ξ−kt2​Ct​/Mt​⪰0, where ktk_tkt​ propagates denoiser error and σt\sigma_tσt​ sets injected noise. This yields Mt≥kt2λmax⁡(Ct)/σt2M_t\ge k_t^2\lambda_{\max}(C_t)/\sigma_t^2Mt​≥kt2​λmax​(Ct​)/σt2​ and approximately Mt∝η−2M_t\propto\eta^{-2}Mt​∝η−2 near deterministic DDIM sampling. Conditional means and covariances match exactly under the idealized conditions; distribution matching additionally uses a Gaussian approximation.
Simulation experiments use a three-component Gaussian mixture and MNIST latents supplied by a fixed VAE. For the mixture, adaptive sampling uses 303 shots per generated sample versus a 1.6×1061.6\times10^61.6×106-shot reference, with resolved fraction 0.941 and MMD2=0.0049\mathrm{MMD}^2=0.0049MMD2=0.0049. Uniform allocation needs roughly four times the adaptive budget for comparable resolved fraction. Three-qubit MNIST generation uses 430 shots per sample, with image-space MMD2=0.0312\mathrm{MMD}^2=0.0312MMD2=0.0312.
Limitations include simulator-exact probabilities for shot allocation, exact-probability training, non-Gaussian errors at low shot counts, estimated residual covariances, feasibility projections, shot caps, and denoiser approximation. Their effects lack distributional guarantees. Validation excludes gate and decoherence errors; hardware operation and nonlinear readouts remain open.
ABSTRACT Diffusion models excel in generative modeling for complex distributions, but suffer from parameter inefficiency. Quantum variants partly address this via quantum resources, yet significant room remains for enhancing denoising efficiency. A quantum denoising diffusion model based on Gaussian boson sampling is proposed to further enhance denoising efficiency, which employs a trainable boson sampling circuit instead of traditional neural networks for backward denoising. Our model demonstrates superior denoising efficiency compared to both selected quantum denoising diffusion models and classical diffusion models(specified later in the text) on the MNIST handwritten digit dataset under the same number of training parameters. Moreover, our model achieves good denoising results under four different noise addition methods, which indicates its robust generalization capabilities. These results provide a paradigm for enhancing the denoising efficiency of quantum denoising diffusion models.
Quantum measurement is a key resource for quantum generative learning, providing intrinsic stochasticity for generating diverse quantum samples. However, in measurement-assisted state-ensemble resampling, repeated measurements can also induce overconcentration: under a fixed measurement trajectory, distinct input states progressively converge toward similar output states, suppressing input-dependent diversity. To diagnose this effect, we introduce three complementary metrics: accuracy, generative power, and input sensitivity. For Haar-random monitored circuits, we prove that one-step models retain input sensitivity up to dimension-suppressed corrections, whereas sequential monitored circuits exhibit a depth-dependent loss of input sensitivity. Motivated by this diagnosis, we propose a truncated quantum denoising diffusion probabilistic model (QuDDPM), which restricts the temporal depth of both the forward diffusion and reverse denoising processes. Numerical benchmarks show that truncated QuDDPM preserves stronger input sensitivity while maintaining accuracy and generative power comparable to the original model. These results identify measurement-induced overconcentration as a dynamical limitation of deep monitored quantum generative models and establish temporal depth as a design parameter for balancing measurement-induced randomness with input-dependent diversity.
Quantum diffusion models provide a physics-consistent route to generative learning by formulating noising and denoising directly on quantum states. However, applying such models to classical high-dimensional data is constrained by the qubit cost of state encoding and the computational burden of simulating large density operators. We propose a scalable hybrid generative pipeline that combines a classical autoencoder for dimensionality reduction with a mixed-state quantum denoising diffusion probabilistic model (MSQuDDPM) operating in the learned latent space. The autoencoder compresses data into compact latent codes that can be embedded into a small-qubit Hilbert space, after which the quantum diffusion model learns a generative distribution over latent density operators and decodes samples back to the original domain. Algorithmically, we simplify the reverse dynamics by predicting an estimate of the clean state ρ0ρ_0ρ0​ at timestep ttt and computing the one-step reverse update via an analytic backward propagation rule, rather than learning an explicit predictor for ρt−1ρ_{t-1}ρt−1​. We demonstrate the proposed approach on MNIST image generation and discuss how mixed-state quantum diffusion can serve as a practical backbone for hybrid quantum--classical generative modeling under realistic qubit budgets.
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 computing has gained significant attention in recent years, with numerous algorithms and applications under active development. Limited by the current quantum technology, quantum noise and readout error have become critical issues. Various methods have been proposed to address readout error through error mitigation techniques, typically involving post-processing of measurement data. However, most of these methods increase the quantum hardware overhead, leading to higher computational costs. In this work, we present a machine-learning-based approach that minimizes hardware overhead while improving accuracy of the measurement probability distributions. We employed a convolutional neural network (CNN) autoencoder, commonly used for image denoising, as our baseline model. The datasets were derived from 4-qubit random circuits with depths ranging from 1 to 18, generated using Qiskit backends for target and noisy measurement data. The model was trained using mean squared error (MSE) as the loss function and Adam optimizer over 500 epochs, achieving an average noise reduction by 95% across the validation set, with no signs of overfitting. To validate the model's effectiveness across diverse quantum states, we conducted extensive tests on both typical quantum circuits and algorithms, including Grover's search algorithm, Quantum Fourier Transform, Haar random circuits and Trivial Paramagnet. The results demonstrated consistent and robust denoising in noisy measurement data, indicating that the autoencoder model is well-suited for efficient quantum error mitigation for current noisy quantum computers. This work contributes to the advancement of quantum error mitigation techniques using machine learning.
Quantum neural networks (QNNs) suffer from a fundamental sampling bottleneck since quantum measurements are probabilistic, requiring many circuit executions to estimate outputs with sufficient accuracy. Conventional Monte-Carlo (MC) inference exhibits an O(1/N)\mathcal{O}(1/\sqrt{N})O(1/N​) sampling error, rendering QNN inference and training costly on near-term quantum hardware, especially where each shot requires expensive qubit generation. This work introduces a "single-shot" QNN framework by integrating quantum amplitude estimation (AE) into the readout stage. By embedding a trained QNN as a state-preparation oracle within AE, outputs are estimated through coherent interference rather than repeated sampling. We demonstrate that AE-based QNN inference achieves an O(1/N)\mathcal{O}(1/N)O(1/N) error even with a single shot. We further analyze noise robustness and training feasibility, showing that AE can be a powerful primitive for overcoming the sampling overhead of QNNs. This highlights that when the model itself is quantum, quantum algorithms can enhance the computation efficiency.