CERN Accélérateur de science

Article
Report number arXiv:2303.11346 ; TIF-UNIMI-2023-9 ; CERN-TH-2023-042
Title Determining probability density functions with adiabatic quantum computing
Author(s) Robbiati, Matteo (CERN ; Milan U. ; INFN, Milan) ; Cruz-Martinez, Juan M. (CERN) ; Carrazza, Stefano (CERN ; Milan U. ; INFN, Milan ; Technol. Innovation Inst., UAE)
Publication 2025-01-04
Imprint 2023-03-20
Number of pages 11
In: Quantum Machine Intelligence 7 (2025) 5
DOI 10.1007/s42484-024-00228-2
Subject category hep-ph ; Particle Physics - Phenomenology ; quant-ph ; General Theoretical Physics
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.
Copyright/License preprint: (License: arXiv nonexclusive-distrib 1.0)
publication: © 2025 The Author(s) (License: CC-BY-4.0)



Corresponding record in: Inspire


 Notice créée le 2023-03-22, modifiée le 2025-02-27


Fichiers:
2303.11346 - Télécharger le documentPDF
document - Télécharger le documentPDF