Determining probability density functions with adiabatic quantum computing
Authors:
Open Access
- 4 January 2025
- journal article
- research article
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 7 (1) , 1-11
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 accommodates 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.Keywords
All Related Versions
Funding Information
- CERN
This publication has 32 references indexed in Scilit:
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers2023
- Hamiltonian open quantum system toolkitCommunications Physics, 2022
- Adiabatic quantum linear regressionScientific Reports, 2021
- Variational quantum algorithmsNature Reviews Physics, 2021
- Time-evolution methods for matrix-product statesAnnals of Physics, 2019
- Quantum machine learningNature, 2017
- An introduction to quantum machine learningContemporary Physics, 2014
- QuTiP: An open-source Python framework for the dynamics of open quantum systemsComputer Physics Communications, 2012
- The Magnus expansion and some of its applicationsPhysics Reports, 2009
- On the Euler angles for SU(N)Journal of Mathematical Physics, 2006