Quantum Bayes AI
- URL: http://arxiv.org/abs/2208.08068v1
- Date: Wed, 17 Aug 2022 04:51:10 GMT
- Title: Quantum Bayes AI
- Authors: Nick Polson and Vadim Sokolov and Jianeng Xu
- Abstract summary: Quantum Bayesian AI (Q-B) is an emerging field that levers the computational gains available in Quantum computing.
We provide a duality between classical and quantum probability for calculating of posterior quantities of interest.
We illustrate the behaviour of quantum algorithms on two simple classification algorithms.
- Score: 1.7403133838762443
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum Bayesian AI (Q-B) is an emerging field that levers the computational
gains available in Quantum computing. The promise is an exponential speed-up in
many Bayesian algorithms. Our goal is to apply these methods directly to
statistical and machine learning problems. We provide a duality between
classical and quantum probability for calculating of posterior quantities of
interest. Our framework unifies MCMC, Deep Learning and Quantum Learning
calculations from the viewpoint from von Neumann's principle of quantum
measurement. Quantum embeddings and neural gates are also an important part of
data encoding and feature selection. There is a natural duality with well-known
kernel methods in statistical learning. We illustrate the behaviour of quantum
algorithms on two simple classification algorithms. Finally, we conclude with
directions for future research.
Related papers
- Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements.
The aim is to scale up application sizes on current quantum processors.
While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - A Quantum Algorithm Based Heuristic to Hide Sensitive Itemsets [1.8419202109872088]
We present a quantum approach to solve a well-studied problem in the context of data sharing.
We present results on experiments involving small datasets to illustrate how the problem could be solved using quantum algorithms.
arXiv Detail & Related papers (2024-02-12T20:44:46Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions.
For its practicability and wide-applicability, we give a brief review of typical graph learning techniques.
We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
arXiv Detail & Related papers (2022-02-19T02:56:47Z) - Quantum Simulation of Hawking Radiation Using VQE Algorithm on IBM
Quantum Computer [0.0]
We use variational quantum eigensolver (VQE) algorithm to simulate Hawking radiation phenomenon.
Three different custom ansatzes are used in the VQE algorithm from which the results for the case with minimum errors are studied.
arXiv Detail & Related papers (2021-12-31T15:03:17Z) - Quantum Algorithms for Unsupervised Machine Learning and Neural Networks [2.28438857884398]
We introduce quantum algorithms to solve tasks such as matrix product or distance estimation.
These results are then used to develop new quantum algorithms for unsupervised machine learning.
We will also present new quantum algorithms for neural networks, or deep learning.
arXiv Detail & Related papers (2021-11-05T16:36:09Z) - Quantum Semi-Supervised Learning with Quantum Supremacy [0.0]
Quantum machine learning promises to efficiently solve important problems.
There are two persistent challenges in classical machine learning: the lack of labeled data, and the limit of computational power.
We propose a novel framework that resolves both issues: quantum semi-supervised learning.
arXiv Detail & Related papers (2021-10-05T20:15:58Z) - Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise.
Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
arXiv Detail & Related papers (2021-03-31T02:41:36Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z)
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.