Stochastic Security as a Performance Metric for Quantum-enhanced Generative AI

• URL: http://arxiv.org/abs/2305.07973v2
• Date: Wed, 19 Feb 2025 07:11:03 GMT
• Title: Stochastic Security as a Performance Metric for Quantum-enhanced Generative AI
• Authors: Noah A. Crum, Leanto Sunny, Pooya Ronagh, Raymond Laflamme, Radhakrishnan Balu, George Siopsis,
• Abstract summary: Deep energy-based models (EBM) require continuous-domain Gibbs sampling both during training and inference. In lieu of fault-tolerant quantum computers that can execute quantum Gibbs sampling algorithms, we use the Monte Carlo simulation of diffusion processes as a classical alternative. Our results show that increasing the computational budget of Gibbs sampling in persistent contrastive divergence improves both the calibration and adversarial robustness of the model.
• Score: 0.0
• License:
• Abstract: Motivated by applications of quantum computers in Gibbs sampling from continuous real-valued functions, we ask whether such algorithms can provide practical advantages for machine learning models trained on classical data and seek measures for quantifying such impacts. In this study, we focus on deep energy-based models (EBM), as they require continuous-domain Gibbs sampling both during training and inference. In lieu of fault-tolerant quantum computers that can execute quantum Gibbs sampling algorithms, we use the Monte Carlo simulation of diffusion processes as a classical alternative. More specifically, we investigate whether long-run persistent chain Monte Carlo simulation of Langevin dynamics improves the quality of the representations achieved by EBMs. We consider a scheme in which the Monte Carlo simulation of a diffusion, whose drift is given by the gradient of the energy function, is used to improve the adversarial robustness and calibration score of an independent classifier network. Our results show that increasing the computational budget of Gibbs sampling in persistent contrastive divergence improves both the calibration and adversarial robustness of the model, suggesting a prospective avenue of quantum advantage for generative AI using future large-scale quantum computers.

Related papers

• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Quantum Dynamical Hamiltonian Monte Carlo [0.0]
  A ubiquitous problem in machine learning is sampling from probability distributions that we only have access to via their log probability. We extend the well-known Hamiltonian Monte Carlo (HMC) method for Chain Monte Carlo (MCMC) sampling to leverage quantum computation in a hybrid manner.
  arXiv  Detail & Related papers  (2024-03-04T07:08:23Z)
• Enhancing variational Monte Carlo using a programmable quantum simulator [0.3078264203938486]
  We show that projective measurement data can be used to enhance in silico simulations of quantum matter. We employ data-enhanced variational Monte Carlo to train powerful autoregressive wavefunction ans"atze based on recurrent neural networks. Our work highlights the promise of hybrid quantum--classical approaches for large-scale simulation of quantum many-body systems.
  arXiv  Detail & Related papers  (2023-08-04T18:08:49Z)
• Gibbs-Duhem-Informed Neural Networks for Binary Activity Coefficient Prediction [45.84205238554709]
  We propose Gibbs-Duhem-informed neural networks for the prediction of binary activity coefficients at varying compositions. We include the Gibbs-Duhem equation explicitly in the loss function for training neural networks.
  arXiv  Detail & Related papers  (2023-05-31T07:36:45Z)
• Hyperparameter optimization, quantum-assisted model performance prediction, and benchmarking of AI-based High Energy Physics workloads using HPC [0.0]
  This work studies the potential of using model performance prediction to aid the HPO process carried out on High Performance Computing systems. A quantum annealer is used to train the performance predictor and a method is proposed to overcome some of the problems derived from the current limitations in quantum systems. Results are presented from the development of a containerized benchmark based on an AI-model for collision event reconstruction.
  arXiv  Detail & Related papers  (2023-03-27T09:55:33Z)
• Copula-based Risk Aggregation with Trapped Ion Quantum Computers [1.541403735141431]
  Copulas are mathematical tools for modeling joint probability distributions. Recent finding that copulas can be expressed as maximally entangled quantum states has revealed a promising approach to practical quantum advantages. We study the training of QCBMs with different levels of precision and circuit design on a simulator and a state-of-the-art trapped ion quantum computer.
  arXiv  Detail & Related papers  (2022-06-23T18:39:30Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Quantum Generative Adversarial Networks in a Continuous-Variable Architecture to Simulate High Energy Physics Detectors [0.0]
  We introduce and analyze a new prototype of quantum GAN (qGAN) employed in continuous-variable quantum computing. Two CV qGAN models with a quantum and a classical discriminator have been tested to reproduce calorimeter outputs in a reduced size.
  arXiv  Detail & Related papers  (2021-01-26T23:33:14Z)

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.