Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2006.11775

On Sampling and Inference using Quantum Algorithms

S Ashutosh, Deepankar Sarmah, Sayantan Pramanik, M Girish Chandra

Published Jun 21, 2020• 1 citation
arXivHTMLPDF

Abstract

Quantum computers are projected to handle the Gibbs sampling and the related inference on Markov networks effectively. Apart from noting the background information useful for those starting the explorations in this important thread of Quantum Machine Learning, we capture some results and observations obtained through extensive simulations with two popular paradigms of sampling based on Quantum Annealing and Quantum Approximate Optimization Algorithm.

DOI
10.48550/arxiv.2006.11775

Related papers

Title: Quantum-Enhanced Bayesian Inference for Machine Learning

Jincheng Zhang

Quantum-enhanced Bayesian inference offers a paradigm shift in the field of machine learning, addressing the fundamental limitations of classical Bayesian methods – namely, computational complexity and scalability – when dealing with high-dimensional data. This paper presents a novel quantum-enhanced Bayesian inference algorithm designed to drastically reduce these challenges. We explore the use of quantum annealing and quantum approximate optimization algorithms to efficiently navigate the complex search space of model parameters, leading to significantly improved accuracy and reduced computational costs. This work demonstrates the potential of quantum computing to revolutionize machine learning, particularly within domains characterized by high data complexity and demanding performance requirements. The core mechanism focuses on leveraging quantum phenomena – superposition and entanglement – to accelerate the exploration of parameter space and improve the convergence of inference algorithms. The investigation includes a detailed analysis of the algorithm's performance compared to classical methods, highlighting the benefits of quantum acceleration in specific machine learning tasks.

•Aug 31, 2026•0 citations

Advances in quantum machine learning

Jeremy C. Adcock, Euan J. Allen, Matthew Day +7 more

Here we discuss advances in the field of quantum machine learning. The following document offers a hybrid discussion; both reviewing the field as it is currently, and suggesting directions for further research. We include both algorithms and experimental implementations in the discussion. The field's outlook is generally positive, showing significant promise. However, we believe there are appreciable hurdles to overcome before one can claim that it is a primary application of quantum computation.

arXiv:1512.02900•Dec 9, 2015•130 citations

Quantum Enhanced Inference in Markov Logic Networks

Péter Wittek, Christian Gogolin

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.

arXiv:1611.08104•Scientific Reports•Apr 19, 2017•28 citations

Sampling problems on a Quantum Computer

Maximilian Balthasar Mansky, Jonas Nüßlein, David Bucher +3 more

Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel quantum methods have been developed in recent years. In this paper, we provide a survey of quantum sampling methods along-side needed theory and applications of those sampling methods as a starting point for research in this area. This work focuses in particular on Gaussian Boson sampling, quantum Monte Carlo methods, quantum variational Monte Carlo, quantum Boltzmann Machines and quantum Bayesian networks. We strive to provide a self-contained overview over the mathematical background, technical feasibility, applicability for other problems and point out potential areas of future research.

arXiv:2402.16341•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•7 citations

Quantum-Inspired Algorithms for AI and Machine Learning

Kamaleswari Pandurangan, A. Priyadharshini, Rakheeba Taseen +3 more

Quantum-inspired algorithms help handle complex optimization and inference challenges in AI and ML. Quantum-like algorithms based on quantum mechanics address challenges classical computer paradigms can't. These algorithms innovate data handling, solution finding, and pattern recognition. Quantum effects like superposition, entanglement, and tunneling influenced them. In particular, they work in parallel to explore large solution spaces and speed up processing for large datasets. Next, quantum-inspired algorithms including quantum annealing, optimization, and neural networks are discussed. Simulated annealing and the quantum approximate optimization algorithm (QAOA) make combinatorial optimization tasks in AI and ML easier. Quantum-inspired evolutionary and swarm intelligence algorithms tackle multi-modal optimization issues quickly. Furthermore, quantum-inspired neural networks (QNNs) have revolutionized deep learning. QNNs use quantum gates and quantum circuits to improve classification, regression, and generative modeling.

Advances in mechatronics and mechanical engineering (AMME) book series•Oct 29, 2024•11 citations

QUANTUM MACHINE LEARNING

Vitaly Alekseevich Peleshenko

The article is devoted to the issues of quantum computing and algorithms aimed at implementing quantum machine learning both on separate quantum processors and in hybrid circuits using TPU and CPU.

SOFT MEASUREMENTS AND COMPUTING•Jan 1, 2022•7 citations
Quantum computers are projected to handle the Gibbs sampling and the related inference on Markov networks effectively. Apart from noting the background information useful for those starting the explorations in this important thread of Quantum Machine Learning, we capture some results and observations obtained through extensive simulations with two popular paradigms of sampling based on Quantum Annealing and Quantum Approximate Optimization Algorithm.
Quantum-enhanced Bayesian inference offers a paradigm shift in the field of machine learning, addressing the fundamental limitations of classical Bayesian methods – namely, computational complexity and scalability – when dealing with high-dimensional data. This paper presents a novel quantum-enhanced Bayesian inference algorithm designed to drastically reduce these challenges. We explore the use of quantum annealing and quantum approximate optimization algorithms to efficiently navigate the complex search space of model parameters, leading to significantly improved accuracy and reduced computational costs. This work demonstrates the potential of quantum computing to revolutionize machine learning, particularly within domains characterized by high data complexity and demanding performance requirements. The core mechanism focuses on leveraging quantum phenomena – superposition and entanglement – to accelerate the exploration of parameter space and improve the convergence of inference algorithms. The investigation includes a detailed analysis of the algorithm's performance compared to classical methods, highlighting the benefits of quantum acceleration in specific machine learning tasks.
Here we discuss advances in the field of quantum machine learning. The following document offers a hybrid discussion; both reviewing the field as it is currently, and suggesting directions for further research. We include both algorithms and experimental implementations in the discussion. The field's outlook is generally positive, showing significant promise. However, we believe there are appreciable hurdles to overcome before one can claim that it is a primary application of quantum computation.
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.
Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel quantum methods have been developed in recent years. In this paper, we provide a survey of quantum sampling methods along-side needed theory and applications of those sampling methods as a starting point for research in this area. This work focuses in particular on Gaussian Boson sampling, quantum Monte Carlo methods, quantum variational Monte Carlo, quantum Boltzmann Machines and quantum Bayesian networks. We strive to provide a self-contained overview over the mathematical background, technical feasibility, applicability for other problems and point out potential areas of future research.
Quantum-inspired algorithms help handle complex optimization and inference challenges in AI and ML. Quantum-like algorithms based on quantum mechanics address challenges classical computer paradigms can't. These algorithms innovate data handling, solution finding, and pattern recognition. Quantum effects like superposition, entanglement, and tunneling influenced them. In particular, they work in parallel to explore large solution spaces and speed up processing for large datasets. Next, quantum-inspired algorithms including quantum annealing, optimization, and neural networks are discussed. Simulated annealing and the quantum approximate optimization algorithm (QAOA) make combinatorial optimization tasks in AI and ML easier. Quantum-inspired evolutionary and swarm intelligence algorithms tackle multi-modal optimization issues quickly. Furthermore, quantum-inspired neural networks (QNNs) have revolutionized deep learning. QNNs use quantum gates and quantum circuits to improve classification, regression, and generative modeling.