Quantum state preparation for bell-shaped probability distributions using deconvolution methods

• URL: http://arxiv.org/abs/2310.05044v2
• Date: Fri, 17 May 2024 17:29:08 GMT
• Title: Quantum state preparation for bell-shaped probability distributions using deconvolution methods
• Authors: Kiratholly Nandakumar Madhav Sharma, Camille de Valk, Ankur Raina, Julian van Velzen,
• Abstract summary: We present a hybrid classical-quantum approach to load quantum data. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum systems are a natural choice for generating probability distributions due to the phenomena of quantum measurements. The data that we observe in nature from various physical phenomena can be modelled using quantum circuits. To load this data, which is mostly in the form of a probability distribution, we present a hybrid classical-quantum approach. The classical pre-processing step is based on the concept of deconvolution of discrete signals. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The chosen cost function is symmetric and allows us to perform the deconvolution step using any appropriate optimization algorithm. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution, leading to an overall reduction in circuit depth. The deconvolution step splits a bell-shaped probability mass function into smaller probability mass functions, and this paves the way for parallel data processing in quantum hardware, which consists of a quantum adder circuit as the penultimate step before measurement. We tested the algorithm on IBM Quantum simulators and on the IBMQ Kolkata quantum computer, having a 27-qubit quantum processor. We validated the hybrid Classical-Quantum algorithm by loading two different distributions of bell shape. Specifically, we loaded 7 and 15-element PMF for (i) Standard Normal distribution and (ii) Laplace distribution.

Related papers

• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Quantum State Preparation for Probability Distributions with Mirror Symmetry Using Matrix Product States [0.0]
  Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. We propose a novel quantum state preparation method for probability distribution with mirror symmetry using matrix product states. Our method reduces the entanglement of probability distributions and improves the accuracy of approximations by matrix product states.
  arXiv  Detail & Related papers  (2024-03-25T13:03:35Z)
• Quantum Generative Diffusion Model: A Fully Quantum-Mechanical Model for Generating Quantum State Ensemble [40.06696963935616]
  We introduce Quantum Generative Diffusion Model (QGDM) as their simple and elegant quantum counterpart. QGDM exhibits faster convergence than Quantum Generative Adversarial Network (QGAN) It can achieve 53.02% higher fidelity in mixed-state generation than QGAN.
  arXiv  Detail & Related papers  (2024-01-13T10:56:34Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Simulating non-unitary dynamics using quantum signal processing with unitary block encoding [0.0]
  We adapt a recent advance in resource-frugal quantum signal processing to explore non-unitary imaginary time evolution on quantum computers. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
  arXiv  Detail & Related papers  (2023-03-10T19:00:33Z)
• Loading Probability Distributions in a Quantum circuit [0.0]
  Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require circuits that can initialize the wave function of a physical quantum system. We discuss ways to construct parameterized quantum circuits that can generate both symmetric as well as asymmetric distributions.
  arXiv  Detail & Related papers  (2022-08-29T05:29:05Z)
• 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)
• Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
  We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit. The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$. We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
  arXiv  Detail & Related papers  (2021-12-29T12:33:41Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.