Determining probability density functions with adiabatic quantum computing

Abstract

The two main approaches to quantum computing are gate-based computation and analog computation, which are polynomially equivalent in terms of complexity, and they are often seen as alternatives to each other. In this work, we present a method for fitting one-dimensional probability distributions as a practical example of how analog and gate-based computation can be used together to perform different tasks within a single algorithm. In particular, we propose a strategy for encoding data within an adiabatic evolution model, which accomodates the fitting of strictly monotonic functions, as it is the cumulative distribution function of a dataset. Subsequently, we use a Trotter-bounded procedure to translate the adiabatic evolution into a quantum circuit in which the evolution time t is identified with the parameters of the circuit. This facilitates computing the probability density as derivative of the cumulative function using parameter shift rules.

11 pages, 6 figures

References in corpus (18)

• Quantum Machine Learning
• Variational Quantum Algorithms
• QuTiP: An open-source Python framework for the dynamics of open quantum systems
• Quantum Circuit Learning
• Adiabatic Quantum Computing
• An introduction to quantum machine learning
• The Magnus expansion and some of its applications
• Parameterized quantum circuits as machine learning models
• Evaluating analytic gradients on quantum hardware
• Time-evolution methods for matrix-product states
• How to GAN LHC Events
• Estimating the gradient and higher-order derivatives on quantum hardware
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• On the Euler angles for SU(N)
• Style-based quantum generative adversarial networks for Monte Carlo events
• HOQST: Hamiltonian Open Quantum System Toolkit
• Qibolab: an open-source hybrid quantum operating system
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model

Cited by in corpus (2)

• Quantum noise modeling through Reinforcement Learning
• Double-bracket quantum algorithms for high-fidelity ground state preparation