A purely Quantum Generative Modeling through Unitary Scrambling and Collapse

• URL: http://arxiv.org/abs/2506.10571v2
• Date: Fri, 03 Oct 2025 12:50:19 GMT
• Title: A purely Quantum Generative Modeling through Unitary Scrambling and Collapse
• Authors: Yihua Li, Jiayi Chen, Tamanna S. Kumavat, Kyriakos Flouris,
• Abstract summary: Quantum Scrambling and Collapse Generative Model (QGen) is a purely quantum paradigm that eliminates classical dependencies.<n>We introduce a measurement-based training principle that decomposes learning into tractable subproblems, mitigating barren plateaus.<n> Empirically, QGen outperforms classical and hybrid baselines under matched parameter budget, while maintaining robustness under finite-shot sampling.
• Score: 6.647966634235082
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing offers fundamentally more expressive mechanisms for generative modeling, yet current approaches remain constrained by classical neural components that bottleneck quantum capability and hardware efficiency. We propose the Quantum Scrambling and Collapse Generative Model (QGen), a purely quantum paradigm that eliminates classical dependencies. QGen implements two coherent processes: scrambling, which interleaves Gaussian diffusion channels with unitary delocalization to disperse information globally while avoiding collapse into uninformative states; and collapse, where parameterized quantum circuits refocus scrambled distributions into structured outputs, achieving distributional reconstruction under coherent evolution. To enable scalability, we introduce a measurement-based training principle that decomposes learning into tractable subproblems, mitigating barren plateaus. Empirically, QGen outperforms classical and hybrid baselines under matched parameter budget, while maintaining robustness under finite-shot sampling, demonstrating strong feasibility for near-term hardware.

Related papers

• Physics-Informed Hybrid Quantum-Classical Dispatching for Large-Scale Renewable Power Systems:A Noise-Resilient Framework [9.378801906395179]
  High-penetration energy introduces significantity and non-Classicality into power system dispatching optimization.<n>Existing approaches typically treat the power grid as a "black box"<n>This paper proposes a Hybrid Quantum-Bridging Dispatching (PIHQ-CD) framework.
  arXiv  Detail & Related papers  (2026-01-26T13:35:54Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Towards Heterogeneous Quantum Federated Learning: Challenges and Solutions [47.08625631041616]
  Quantum federated learning (QFL) combines quantum computing and federated learning to enable decentralized model training while maintaining data privacy.<n>Existing QFL frameworks largely focus on homogeneity among quantum textcolorblackclients, and they do not account for real-world variances in quantum data distributions, encoding techniques, hardware noise levels, and computational capacity.<n>These differences can create instability during training, slow convergence, and reduce overall model performance.
  arXiv  Detail & Related papers  (2025-11-27T06:35:45Z)
• Channel-Constrained Markovian Quantum Diffusion Model from Open System Perspective [6.550541885221236]
  We present a channel-constrained Markovian quantum diffusion model that prepares quantum states.<n>Our model interprets the forward diffusion process as natural decoherence using quantum master equations, whereas the reverse denoising is achieved by learning inverse quantum channels.<n>This work confirms that quantum diffusion can be characterized as a controlled Markov evolution, demonstrating that environmental interactions are not limited to being a source of decoherence but can also be utilized to achieve high-fidelity quantum state synthesis.
  arXiv  Detail & Related papers  (2025-11-15T13:52:15Z)
• Towards Quantum Enhanced Adversarial Robustness with Rydberg Reservoir Learning [45.92935470813908]
  Quantum computing reservoir (QRC) leverages the high-dimensional, nonlinear dynamics inherent in quantum many-body systems.<n>Recent studies indicate that perturbation quantums based on variational circuits remain susceptible to adversarials.<n>We investigate the first systematic evaluation of adversarial robustness in a QR based learning model.
  arXiv  Detail & Related papers  (2025-10-15T12:17:23Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Toward Large-Scale Distributed Quantum Long Short-Term Memory with Modular Quantum Computers [5.673361333697935]
  We introduce a Distributed Quantum Long Short-Term Memory (QLSTM) framework to address scalability challenges on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>QLSTM captures long-range temporal dependencies, while a distributed architecture partitions the underlying Variational Quantum Circuits into smaller, manageable subcircuits.<n>We demonstrate that the distributed QLSTM achieves stable convergence and improved training dynamics compared to classical approaches.
  arXiv  Detail & Related papers  (2025-03-18T10:07:34Z)
• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models.<n>This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space.<n>The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• Mixed-State Quantum Denoising Diffusion Probabilistic Model [0.40964539027092906]
  We propose a mixed-state quantum denoising diffusion probabilistic model (MSQuDDPM) to eliminate the need for scrambling unitaries.<n>MSQuDDPM integrates depolarizing noise channels in the forward diffusion process and parameterized quantum circuits with projective measurements in the backward denoising steps.<n>We evaluate MSQuDDPM on quantum ensemble generation tasks, demonstrating its successful performance.
  arXiv  Detail & Related papers  (2024-11-26T17:20:58Z)
• Enhancing Quantum Diffusion Models with Pairwise Bell State Entanglement [35.436358464279785]
  This paper introduces a novel quantum diffusion model designed for Noisy Intermediate-Scale Quantum (NISQ) devices. By leveraging quantum entanglement and superposition, this approach advances quantum generative learning.
  arXiv  Detail & Related papers  (2024-11-24T20:14:57Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Towards Efficient Quantum Hybrid Diffusion Models [68.43405413443175]
  We propose a new methodology to design quantum hybrid diffusion models. We propose two possible hybridization schemes combining quantum computing's superior generalization with classical networks' modularity.
  arXiv  Detail & Related papers  (2024-02-25T16:57:51Z)
• Mutual information maximizing quantum generative adversarial networks [9.391818870557545]
  InfoQGAN is a quantum-classical hybrid generative adversarial network that integrates the principles of InfoGAN with a QGAN architecture.<n>We show that InfoQGAN effectively mitigates mode collapse while achieving robust feature disentanglement in the quantum generator.<n>These results highlight the potential of InfoQGAN as an approach for advancing quantum generative modeling in the NISQ era.
  arXiv  Detail & Related papers  (2023-09-04T05:18:37Z)
• Quantum-Noise-Driven Generative Diffusion Models [1.6385815610837167]
  We propose three quantum-noise-driven generative diffusion models that could be experimentally tested on real quantum systems. The idea is to harness unique quantum features, in particular the non-trivial interplay among coherence, entanglement and noise. Our results are expected to pave the way for new quantum-inspired or quantum-based generative diffusion algorithms.
  arXiv  Detail & Related papers  (2023-08-23T09:09:32Z)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.