Papers › Determining probability density functions with adiabatic quantum computing
Determining probability density functions with adiabatic quantum computing
Matteo Robbiati, Juan M. Cruz-Martinez, Stefano Carrazza
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections