Determining probability density functions with adiabatic quantum computing

• URL: http://arxiv.org/abs/2303.11346v3
• Date: Mon, 06 Jan 2025 19:35:03 GMT
• Title: Determining probability density functions with adiabatic quantum computing
• Authors: Matteo Robbiati, Juan M. Cruz-Martinez, Stefano Carrazza,
• Abstract summary: 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. In particular, we propose a strategy for encoding data within an adiabatic evolution model, which accomodates the fitting of strictly monotonic functions.
• Score: 0.0
• License:
• 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.

Related papers

• Quantum Computing for Partition Function Estimation of a Markov Random Field in a Radar Anomaly Detection Problem [0.0]
  In probability theory, the partition function is a factor used to reduce any probability function to a density function with total probability of one. We propose a quantum algorithm for partition function estimation in the one clean qubit model.
  arXiv  Detail & Related papers  (2025-01-02T09:14:14Z)
• Variational approach to photonic quantum circuits via the parameter shift rule [0.0]
  We derive a formulation of the parameter shift rule for reconfigurable optical linear circuits based on the Boson Sampling paradigm. We also present similar rules for the computations of integrals over the variational parameters. We employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable 6-mode universal integrated interferometer.
  arXiv  Detail & Related papers  (2024-10-09T15:06:17Z)
• Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
  Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms. We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-03T15:42:25Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• Quantum Extremal Learning [0.8937790536664091]
  We propose a quantum algorithm for extremal learning', which is the process of finding the input to a hidden function that extremizes the function output. The algorithm, called quantum extremal learning (QEL), consists of a parametric quantum circuit that is variationally trained to model data input-output relationships.
  arXiv  Detail & Related papers  (2022-05-05T17:37:26Z)
• Protocols for Trainable and Differentiable Quantum Generative Modelling [21.24186888129542]
  We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) We perform training of a DQC-based model, where data is encoded in a latent space with a phase feature map, followed by a variational quantum circuit. This allows fast sampling from parametrized distributions using a single-shot readout.
  arXiv  Detail & Related papers  (2022-02-16T18:55:48Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.