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:1611.08104 · Scientific Reports

Quantum Enhanced Inference in Markov Logic Networks

Péter Wittek, Christian Gogolin

Published Apr 19, 2017• 28 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/srep45672

Related papers

On Sampling and Inference using Quantum Algorithms

S Ashutosh, Deepankar Sarmah, Sayantan Pramanik +1 more

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.

arXiv:2006.11775•Jun 21, 2020•1 citation

Bayesian Quantum Neural Networks

Nam Nguyen, Kwang‐Cheng Chen

The astounding acceleration in Artificial Intelligence and Quantum Computing advances naturally gives rise to a line of research, which unrolls the potential advantages of quantum computing on classical Machine Learning tasks, known as Quantum Machine Learning or Quantum Machine Intelligence. The typical objectives are either (1) exploring the potential quantum advantages on classical learning tasks or (2) levering well-established classical ML algorithms to tackle quantum-related problems on Noisy Intermediate-Scale Quantum (NISQ) devices. Along the second research direction, we study Quantum Neural Networks (QNNs) to accomplish the purpose of Bayesian learning. By observing a wide range of studies on QNNs, in which the sole training method is based on frequentist training, we find that Bayesian learning benefits QNNs from two aspects. First, Bayesian-trained models enjoy a high level of generalization due to the prior and posterior distribution usage compared to frequentist training, which will be justified by this paper’s theoretical study of model capacity. Second, Bayesian Inference offers epistemic uncertainty estimation, which merits the decision-making process. It is worth mentioning that frequentist-trained QNNs generally lack this desirable property. Under the Bayesian training procedure, our derived models can be considered a new class of QNNs (called BayesianQNNs) which possesses both desirable properties of Bayesian Inference while maintaining comparable predictive performance as frequentist counterparts. The proposed Bayesian Quantum Neural Networks is justified by empirical evidence from numerical experiments.

IEEE Access•Jan 1, 2022•43 citations

Quantum Neural Networks: Paving the Way for Next-Generation Machine Learning

Bheema Shanker Neyigapula

Quantum Neural Networks (QNNs) have emerged as a promising avenue in the quest for next-generation machine learning capabilities.By harnessing the principles of quantum mechanics and quantum computing, QNNs offer the potential for exponential speedup and enhanced computational power compared to classical machine learning algorithms.This paper presents a comprehensive exploration of Quantum Neural Networks, covering their foundational concepts, various architectures, novel quantum-enhanced machine learning algorithms, practical implementations, advantages, and challenges.We begin with an overview of related work in Quantum Machine Learning, highlighting the achievements and progress in the field.Subsequently, we delve into the fundamental principles of Quantum Mechanics and Quantum Computing to provide a solid grounding for understanding QNNs.We then introduce the basics of Quantum Neural Networks, including quantum neurons, quantum gates, and quantum circuits for machine learning tasks.Various QNN architectures, such as Variational Quantum Circuits and Quantum Convolutional Neural Networks, are explored along with their potential applications.Additionally, quantum-enhanced machine learning algorithms, like Quantum Support Vector Machines and Quantum Generative Adversarial Networks, are discussed for a deeper understanding of QNN capabilities.Practical aspects, including hardware implementations, noise mitigation, and experimental results, are presented to shed light on the feasibility of QNNs in real-world scenarios.The paper concludes by discussing the advantages and challenges of Quantum Neural Networks and their potential implications for the future of machine learning and artificial intelligence.

International Journal of Artificial Intelligence and Machine Learning•Jul 5, 2024•1 citation

Neural-Network-Assisted Monte Carlo Sampling Trained by Quantum Approximate Optimization Algorithm

Yuichiro Nakano, Ken N. Okada, Keisuke Fujii

Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden , Nature 619, 282–287 (2023)] has been proposed recently, where sampling from a quantum computer is used as a proposal distribution and convergence to a target distribution is accelerated. However, guaranteeing convergence to the target distribution typically forces one to impose restrictive symmetry constraints on the quantum circuit, which makes it hard to design good proposal distributions and prevents making full use of the advantage of a quantum computer. We explore a hybrid quantum-classical Markov chain Monte Carlo framework that combines a quantum circuit with a generative neural sampler (GNS). The GNS is trained on quantum samples and acts as a classical surrogate to efficiently emulate quantum outputs, thereby lifting circuit constraints. We apply this method to Boltzmann sampling of spin glasses using proposals trained with a quantum approximate optimization algorithm circuit. This approach outperforms conventional methods, showing a polynomial speedup (over cubic) in spectral gap compared with uniform proposals. Notably, it maintains similar acceleration even without parameter optimization. These results establish the method as a viable sampling-based quantum algorithm for noisy intermediate-scale quantum devices and highlight its potential for solving practical problems with quantum computation.

arXiv:2506.01335•PRX Quantum•Jan 6, 2026•6 citations

Quantum algorithm for Markov random fields structure learning

Liming Zhao, Ming-Xing Luo, Lin‐Chun Wan

Abstract Probabilistic graphical models play a crucial role in machine learning and have wide applications across various fields. A pivotal subset within this realm is undirected graphical models, also known as Markov random fields. In this work, we explore the application of quantum computing to the field of machine learning, specifically focusing on the task of structure learning in Markov random fields. We propose a quantum algorithm for structure learning of an r-wise Markov Random Field with a bounded degree underlying graph, based on a nearly optimal classical greedy algorithm. Our quantum algorithm provides a polynomial speed-up over the classical counterpart, with a runtime of O ˜ 2 L M n r + 1 log ( 1 / w ) compared to the classical O ˜ M n r , where n is the number of variables. It is nearly a quadratic speedup in terms of n. Through this research, we aim to showcase the potential advantages of quantum computation in tackling complex machine-learning problems. Furthermore, the sample complexity O ˜ 2 2 L τ 2 δ 2 L ( log ( 1 / w ) + log n ) remains consistent between classical and quantum approaches, ensuring the efficiency and robustness of our method. By demonstrating the efficiency and scalability of our quantum algorithm for structure learning, we contribute to the growing body of work that highlights the role of quantum computing in advancing the field of machine learning and probabilistic graphical models.

arXiv:2208.11382•Physica Scripta•Jun 26, 2025•1 citation

Implementação e Avaliação de Inferência Bayesiana Clássica e Quântica

Lopes, Gabriel Barros

This thesis explores the intersection of Bayesian inference and quantum computing, with a particular focus on developing and analyzing quantum approaches to probabilistic modeling. The motivation arises from the limitations of classical inference methods, which often become intractable when applied to high-dimensional distributions and complex Bayesian networks. By leveraging quantum algorithms, the work investigates how probabilistic reasoning can benefit from computational speedups, scalability, and more efficient handling of uncertainty.The implementation targets canonical benchmark problems—the Sprinkler Network and the Asia Network—where both classical and quantum Bayesian inference techniques are applied and compared. Using Qiskit, the thesis demonstrates how quantum circuits can encode probabilistic models through parameterized rotations and controlled operations, and how posterior distributions can be computed by sampling and amplitude amplification. Comparative experiments systematically evaluate the accuracy, variance, and scalability of quantum Bayesian inference against classical baselines, highlighting trade-offs between precision and shot counts while exploring the potential for quadratic speedups.The results show that although present-day hardware constraints, such as limited qubit counts and noise, restrict large-scale deployment, quantum implementations already display strong promise for complex probabilistic reasoning tasks. Importantly, the conclusions underscore the role of quantum Bayesian networks as a pathway toward practical quantum-enhanced machine learning.

•Sep 23, 2025•0 citations
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.
The astounding acceleration in Artificial Intelligence and Quantum Computing advances naturally gives rise to a line of research, which unrolls the potential advantages of quantum computing on classical Machine Learning tasks, known as Quantum Machine Learning or Quantum Machine Intelligence. The typical objectives are either (1) exploring the potential quantum advantages on classical learning tasks or (2) levering well-established classical ML algorithms to tackle quantum-related problems on Noisy Intermediate-Scale Quantum (NISQ) devices. Along the second research direction, we study Quantum Neural Networks (QNNs) to accomplish the purpose of Bayesian learning. By observing a wide range of studies on QNNs, in which the sole training method is based on frequentist training, we find that Bayesian learning benefits QNNs from two aspects. First, Bayesian-trained models enjoy a high level of generalization due to the prior and posterior distribution usage compared to frequentist training, which will be justified by this paper’s theoretical study of model capacity. Second, Bayesian Inference offers epistemic uncertainty estimation, which merits the decision-making process. It is worth mentioning that frequentist-trained QNNs generally lack this desirable property. Under the Bayesian training procedure, our derived models can be considered a new class of QNNs (called BayesianQNNs) which possesses both desirable properties of Bayesian Inference while maintaining comparable predictive performance as frequentist counterparts. The proposed Bayesian Quantum Neural Networks is justified by empirical evidence from numerical experiments.
Quantum Neural Networks (QNNs) have emerged as a promising avenue in the quest for next-generation machine learning capabilities.By harnessing the principles of quantum mechanics and quantum computing, QNNs offer the potential for exponential speedup and enhanced computational power compared to classical machine learning algorithms.This paper presents a comprehensive exploration of Quantum Neural Networks, covering their foundational concepts, various architectures, novel quantum-enhanced machine learning algorithms, practical implementations, advantages, and challenges.We begin with an overview of related work in Quantum Machine Learning, highlighting the achievements and progress in the field.Subsequently, we delve into the fundamental principles of Quantum Mechanics and Quantum Computing to provide a solid grounding for understanding QNNs.We then introduce the basics of Quantum Neural Networks, including quantum neurons, quantum gates, and quantum circuits for machine learning tasks.Various QNN architectures, such as Variational Quantum Circuits and Quantum Convolutional Neural Networks, are explored along with their potential applications.Additionally, quantum-enhanced machine learning algorithms, like Quantum Support Vector Machines and Quantum Generative Adversarial Networks, are discussed for a deeper understanding of QNN capabilities.Practical aspects, including hardware implementations, noise mitigation, and experimental results, are presented to shed light on the feasibility of QNNs in real-world scenarios.The paper concludes by discussing the advantages and challenges of Quantum Neural Networks and their potential implications for the future of machine learning and artificial intelligence.
Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden , Nature 619, 282–287 (2023)] has been proposed recently, where sampling from a quantum computer is used as a proposal distribution and convergence to a target distribution is accelerated. However, guaranteeing convergence to the target distribution typically forces one to impose restrictive symmetry constraints on the quantum circuit, which makes it hard to design good proposal distributions and prevents making full use of the advantage of a quantum computer. We explore a hybrid quantum-classical Markov chain Monte Carlo framework that combines a quantum circuit with a generative neural sampler (GNS). The GNS is trained on quantum samples and acts as a classical surrogate to efficiently emulate quantum outputs, thereby lifting circuit constraints. We apply this method to Boltzmann sampling of spin glasses using proposals trained with a quantum approximate optimization algorithm circuit. This approach outperforms conventional methods, showing a polynomial speedup (over cubic) in spectral gap compared with uniform proposals. Notably, it maintains similar acceleration even without parameter optimization. These results establish the method as a viable sampling-based quantum algorithm for noisy intermediate-scale quantum devices and highlight its potential for solving practical problems with quantum computation.
Abstract Probabilistic graphical models play a crucial role in machine learning and have wide applications across various fields. A pivotal subset within this realm is undirected graphical models, also known as Markov random fields. In this work, we explore the application of quantum computing to the field of machine learning, specifically focusing on the task of structure learning in Markov random fields. We propose a quantum algorithm for structure learning of an r-wise Markov Random Field with a bounded degree underlying graph, based on a nearly optimal classical greedy algorithm. Our quantum algorithm provides a polynomial speed-up over the classical counterpart, with a runtime of O ˜ 2 L M n r + 1 log ( 1 / w ) compared to the classical O ˜ M n r , where n is the number of variables. It is nearly a quadratic speedup in terms of n. Through this research, we aim to showcase the potential advantages of quantum computation in tackling complex machine-learning problems. Furthermore, the sample complexity O ˜ 2 2 L τ 2 δ 2 L ( log ( 1 / w ) + log n ) remains consistent between classical and quantum approaches, ensuring the efficiency and robustness of our method. By demonstrating the efficiency and scalability of our quantum algorithm for structure learning, we contribute to the growing body of work that highlights the role of quantum computing in advancing the field of machine learning and probabilistic graphical models.
This thesis explores the intersection of Bayesian inference and quantum computing, with a particular focus on developing and analyzing quantum approaches to probabilistic modeling. The motivation arises from the limitations of classical inference methods, which often become intractable when applied to high-dimensional distributions and complex Bayesian networks. By leveraging quantum algorithms, the work investigates how probabilistic reasoning can benefit from computational speedups, scalability, and more efficient handling of uncertainty.The implementation targets canonical benchmark problems—the Sprinkler Network and the Asia Network—where both classical and quantum Bayesian inference techniques are applied and compared. Using Qiskit, the thesis demonstrates how quantum circuits can encode probabilistic models through parameterized rotations and controlled operations, and how posterior distributions can be computed by sampling and amplitude amplification. Comparative experiments systematically evaluate the accuracy, variance, and scalability of quantum Bayesian inference against classical baselines, highlighting trade-offs between precision and shot counts while exploring the potential for quadratic speedups.The results show that although present-day hardware constraints, such as limited qubit counts and noise, restrict large-scale deployment, quantum implementations already display strong promise for complex probabilistic reasoning tasks. Importantly, the conclusions underscore the role of quantum Bayesian networks as a pathway toward practical quantum-enhanced machine learning.