Loading Probability Distributions in a Quantum circuit
- URL: http://arxiv.org/abs/2208.13372v1
- Date: Mon, 29 Aug 2022 05:29:05 GMT
- Title: Loading Probability Distributions in a Quantum circuit
- Authors: Kalyan Dasgupta and Binoy Paine
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum circuits generating probability distributions has applications in
several areas. 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. These wave functions, in several cases, are identical to some very well
known probability distributions. In this paper we discuss ways to construct
parameterized quantum circuits that can generate both symmetric as well as
asymmetric distributions. We follow the trajectory of quantum states as single
and two qubit operations get applied to the system, and find out the best
possible way to arrive at the desired distribution. The parameters are
optimized by a variational solver. We present results from both simulators as
well as real IBM quantum hardwares.
Related papers
- 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 state preparation for bell-shaped probability distributions using deconvolution methods [0.0]
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.
arXiv Detail & Related papers (2023-10-08T06:55:47Z) - Simulation of quantum algorithms using classical probabilistic bits and
circuits [0.0]
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits.
Key idea in this mapping is to store both the amplitude and phase information of the complex coefficients that describe the qubit state in the probabilities.
We show how to implement the analogs of single-qubit and two-qubit gates in the probability space using correlation-inducing operations.
arXiv Detail & Related papers (2023-07-26T18:49:42Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - 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) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Arbitrary coherent distributions in a programmable quantum walk [9.037302699507409]
coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications.
We experimentally demonstrate that the rich dynamics featured with arbitrary coherent distributions can be obtained by introducing different sets of the time- and position-dependent operations.
Our results contribute to the practical realization of quantum-walk-based quantum computation, quantum simulations and quantum information protocols.
arXiv Detail & Related papers (2022-02-19T15:56:45Z) - 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) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Neuromorphic quantum computing [0.0]
We propose that neuromorphic computing can perform quantum operations.
We show for a two qubit system that quantum gates can be learned as a change of parameters for neural network dynamics.
arXiv Detail & Related papers (2020-05-04T14:46:48Z)
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.