Protocols for classically training quantum generative models on probability distributions

Abstract

Quantum Generative Modelling (QGM) relies on preparing quantum states and generating samples from these states as hidden - or known - probability distributions. As distributions from some classes of quantum states (circuits) are inherently hard to sample classically, QGM represents an excellent testbed for quantum supremacy experiments. Furthermore, generative tasks are increasingly relevant for industrial machine learning applications, and thus QGM is a strong candidate for demonstrating a practical quantum advantage. However, this requires that quantum circuits are trained to represent industrially relevant distributions, and the corresponding training stage has an extensive training cost for current quantum hardware in practice. In this work, we propose protocols for classical training of QGMs based on circuits of the specific type that admit an efficient gradient computation, while remaining hard to sample. In particular, we consider Instantaneous Quantum Polynomial (IQP) circuits and their extensions. Showing their classical simulability in terms of the time complexity, sparsity and anti-concentration properties, we develop a classically tractable way of simulating their output probability distributions, allowing classical training to a target probability distribution. The corresponding quantum sampling from IQPs can be performed efficiently, unlike when using classical sampling. We numerically demonstrate the end-to-end training of IQP circuits using probability distributions for up to 30 qubits on a regular desktop computer. When applied to industrially relevant distributions this combination of classical training with quantum sampling represents an avenue for reaching advantage in the NISQ era.

arXiv comment9 pages, 10 figures, draft version

References in corpus (45)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Supervised learning with quantum enhanced feature spaces
• Quantum computational advantage using photons
• Barren plateaus in quantum neural network training landscapes
• Quantum Circuit Learning
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Characterizing Quantum Supremacy in Near-Term Devices
• Evaluating analytic gradients on quantum hardware
• Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
• Quantum generative adversarial learning
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
• Quantum generative adversarial networks
• Quantum computing with neutral atoms
• Simulating quantum computation by contracting tensor networks
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Verified Quantum Information Scrambling
• Classical simulation of noninteracting-fermion quantum circuits
• Average-case complexity versus approximate simulation of commuting quantum computations
• Differentiable Learning of Quantum Circuit Born Machine
• Experimental Quantum Generative Adversarial Networks for Image Generation
• Complete 3-Qubit Grover Search on a Programmable Quantum Computer
• Matchgates and classical simulation of quantum circuits
• Solving nonlinear differential equations with differentiable quantum circuits
• Hyper-optimized tensor network contraction
• Quantum generative adversarial learning in a superconducting quantum circuit
• The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
• Molecular Docking with Gaussian Boson Sampling
• Solving the sampling problem of the Sycamore quantum circuits
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• Architectures for quantum simulation showing a quantum speedup
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• Anticoncentration theorems for schemes showing a quantum speedup
• Generalized quantum circuit differentiation rules
• From estimation of quantum probabilities to simulation of quantum circuits
• Quantum Kernel Methods for Solving Differential Equations
• Variational quantum simulations of stochastic differential equations
• Fast counting with tensor networks
• Training Gaussian Boson Sampling Distributions
• A variational quantum algorithm for the Feynman-Kac formula
• Benchmarking Information Scrambling
• Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time-Series
• Quantum Information Scrambling Through a High-Complexity Operator Mapping

Cited by in corpus (6)

• Backpropagation scaling in parameterised quantum circuits
• Multidimensional Quantum Generative Modeling by Quantum Hartley Transform
• Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics
• Vortex Detection from Quantum Data
• Quantum Chebyshev Probabilistic Models for Fragmentation Functions
• Quantum community detection via deterministic elimination