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:2203.17089 · Machine learning for signal processing ...

Quantum-Aided Meta-Learning for Bayesian Binary Neural Networks via Born Machines

Ivana Nikoloska, Osvaldo Simeone

Published Aug 22, 2022• 10 citations
arXivHTMLPDF

Abstract

Near-term noisy intermediate-scale quantum circuits can efficiently implement implicit probabilistic models in discrete spaces, supporting distributions that are practically infeasible to sample from using classical means. One of the possible applications of such models, also known as Born machines, is probabilistic inference, which is at the core of Bayesian methods. This paper studies the use of Born machines for the problem of training binary Bayesian neural networks. In the proposed approach, a Born machine is used to model the variational distribution of the binary weights of the neural network, and data from multiple tasks is used to reduce training data requirements on new tasks. The method combines gradientbased meta-learning and variational inference via Born machines, and is shown in a prototypical regression problem to outperform conventional joint learning strategies.

DOI
10.1109/mlsp55214.2022.9943342

Related papers

Variational Inference for Quantum HyperNetworks

Luca Nepote, Alix Lhéritier, Nicolas Bondoux +2 more

Binary Neural Networks (BiNNs), which employ single-bit precision weights, have emerged as a promising solution to reduce memory usage and power consumption while maintaining competitive performance in large-scale systems. However, training BiNNs remains a significant challenge due to the limitations of conventional training algorithms. Quantum HyperNetworks offer a novel paradigm for enhancing the optimization of BiNN by leveraging quantum computing. Specifically, a Variational Quantum Algorithm is employed to generate binary weights through quantum circuit measurements, while key quantum phenomena such as superposition and entanglement facilitate the exploration of a broader solution space. In this work, we establish a connection between this approach and Bayesian inference by deriving the Evidence Lower Bound (ELBO), when direct access to the output distribution is available (i.e., in simulations), and introducing a surrogate ELBO based on the Maximum Mean Discrepancy (MMD) metric for scenarios involving implicit distributions, as commonly encountered in practice. Our experimental results demonstrate that the proposed methods outperform standard Maximum Likelihood Estimation (MLE), improving trainability and generalization.

arXiv:2506.05888•International Joint Conference on Neural Networks (IJCNN)•Jun 30, 2025•2 citations

Differentiable learning of quantum circuit Born machines

Jin-Guo Liu, Lei Wang

Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. One can efficiently draw samples from the quantum circuits via projective measurements on qubits. However, similar to the leading implicit generative models in deep learning, such as the generative adversarial networks, the quantum circuits cannot provide the likelihood of the generated samples, which poses a challenge to the training. We devise an efficient gradient-based learning algorithm for the quantum circuit Born machine by minimizing the kerneled maximum mean discrepancy loss. We simulated generative modeling of the BARS-AND-STRIPES dataset and Gaussian mixture distributions using deep quantum circuits. Our experiments show the importance of circuit depth and the gradient-based optimization algorithm. The proposed learning algorithm is runnable on near-term quantum device and can exhibit quantum advantages for probabilistic generative modeling.

arXiv:1804.04168•Physical Review A•Dec 19, 2018•337 citations

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

Bayesian Variational Quantum Classifiers for Uncertainty-Aware Quantum Machine Learning

Bhavna Saini, Vivek Kumar Verma, Nidhi Kushwaha +1 more

Quantum machine learning is increasingly being explored as a way to tackle complex data analysis problems by combining quantum computing with modern learning techniques. In particular, variational quantum classifiers have attracted considerable attention because they can be implemented on current noisy intermediate-scale quantum (NISQ) devices. Despite their potential, most existing variational quantum classifiers rely on deterministic optimization of circuit parameters. Such approaches can struggle when the available training data are limited or noisy, often leading to unstable predictions and reduced reliability. To address these challenges, recent research has begun incorporating Bayesian learning principles into variational quantum models. By treating circuit parameters as probabilistic variables rather than fixed values, Bayesian variational quantum classifiers allow uncertainty to be explicitly modeled during the learning process. This makes it possible to obtain predictions that are not only accurate but also accompanied by meaningful confidence estimates. In this paper, we present a detailed analysis of Bayesian variational quantum classifiers and their role in enabling uncertainty-aware quantum machine learning. The discussion covers the foundations of variational quantum circuits, Bayesian parameter estimation, and probabilistic prediction mechanisms within hybrid quantum-classical learning frameworks. Different training and inference strategies, including variational Bayesian optimization and sampling-based methods, are examined to highlight their effectiveness in capturing parameter uncertainty in quantum circuits. We also discuss emerging application areas, such as healthcare analytics, financial forecasting, and scientific data analysis, where uncertainty-aware quantum learning models can provide valuable insights.

International Conference on Data Science for Cyber-Physical Systems Resilience using Advanced Applications (ICDCA)•Jun 1, 2026•0 citations

Learning and inference on generative adversarial quantum circuits

Jinfeng Zeng, Yufeng Wu, Jin-Guo Liu +2 more

Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural networks due to the lack of an efficient differentiable learning algorithm. We devise an adversarial quantum-classical hybrid training scheme via coupling a quantum circuit generator and a classical neural network discriminator together. After training, the quantum circuit generative model can infer missing data with quadratic speed-up via amplitude amplification. We numerically simulate the learning and inference of generative adversarial quantum circuits using the prototypical bars-and-stripes dataset. Generative adversarial quantum circuits are a fresh approach to machine learning which may enjoy the practically useful quantum advantage of near-term quantum devices.

arXiv:1808.03425•Physical Review A•May 6, 2019•99 citations

Bayesian machine learning for Boltzmann machine in quantum-enhanced feature spaces

Yusen Wu, Chao‐Hua Yu, Su‐Juan Qin +2 more

Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we develop a quantum bayesian learning framework of the restricted Boltzmann machine in the quantum-enhanced feature spaces. Our framework provides the encoding phase to map the real data and Boltzmann weight onto the quantum feature spaces and the training phase to learn an optimal inference function. Specifically, the training phase provides a physical quantity to measure the posterior distribution in quantum feature spaces, and this measure is utilized to design the quantum maximum a posterior (QMAP) algorithm and the quantum predictive distribution estimator (QPDE). It is shown that both quantum algorithms achieve exponential speed-up over their classical counterparts. Furthermore, it is interesting to note that our framework can figure out the classical bayesian learning tasks, i.e. processing the classical data and outputting corresponding classical labels. And a simulation, which is performed on an open-source software framework for quantum computing, illustrates that our algorithms show almost the same classification performance compared to their classical counterparts. Noting that the proposed quantum algorithms utilize the shallow circuit, our work is expected to be implemented on the noisy intermediate-scale quantum (NISQ) devices, and is one of the promising candidates to achieve quantum supremacy.

arXiv:1912.10857•Dec 20, 2019•5 citations
Near-term noisy intermediate-scale quantum circuits can efficiently implement implicit probabilistic models in discrete spaces, supporting distributions that are practically infeasible to sample from using classical means. One of the possible applications of such models, also known as Born machines, is probabilistic inference, which is at the core of Bayesian methods. This paper studies the use of Born machines for the problem of training binary Bayesian neural networks. In the proposed approach, a Born machine is used to model the variational distribution of the binary weights of the neural network, and data from multiple tasks is used to reduce training data requirements on new tasks. The method combines gradientbased meta-learning and variational inference via Born machines, and is shown in a prototypical regression problem to outperform conventional joint learning strategies.
Binary Neural Networks (BiNNs), which employ single-bit precision weights, have emerged as a promising solution to reduce memory usage and power consumption while maintaining competitive performance in large-scale systems. However, training BiNNs remains a significant challenge due to the limitations of conventional training algorithms. Quantum HyperNetworks offer a novel paradigm for enhancing the optimization of BiNN by leveraging quantum computing. Specifically, a Variational Quantum Algorithm is employed to generate binary weights through quantum circuit measurements, while key quantum phenomena such as superposition and entanglement facilitate the exploration of a broader solution space. In this work, we establish a connection between this approach and Bayesian inference by deriving the Evidence Lower Bound (ELBO), when direct access to the output distribution is available (i.e., in simulations), and introducing a surrogate ELBO based on the Maximum Mean Discrepancy (MMD) metric for scenarios involving implicit distributions, as commonly encountered in practice. Our experimental results demonstrate that the proposed methods outperform standard Maximum Likelihood Estimation (MLE), improving trainability and generalization.
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. One can efficiently draw samples from the quantum circuits via projective measurements on qubits. However, similar to the leading implicit generative models in deep learning, such as the generative adversarial networks, the quantum circuits cannot provide the likelihood of the generated samples, which poses a challenge to the training. We devise an efficient gradient-based learning algorithm for the quantum circuit Born machine by minimizing the kerneled maximum mean discrepancy loss. We simulated generative modeling of the BARS-AND-STRIPES dataset and Gaussian mixture distributions using deep quantum circuits. Our experiments show the importance of circuit depth and the gradient-based optimization algorithm. The proposed learning algorithm is runnable on near-term quantum device and can exhibit quantum advantages for probabilistic generative modeling.
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 machine learning is increasingly being explored as a way to tackle complex data analysis problems by combining quantum computing with modern learning techniques. In particular, variational quantum classifiers have attracted considerable attention because they can be implemented on current noisy intermediate-scale quantum (NISQ) devices. Despite their potential, most existing variational quantum classifiers rely on deterministic optimization of circuit parameters. Such approaches can struggle when the available training data are limited or noisy, often leading to unstable predictions and reduced reliability. To address these challenges, recent research has begun incorporating Bayesian learning principles into variational quantum models. By treating circuit parameters as probabilistic variables rather than fixed values, Bayesian variational quantum classifiers allow uncertainty to be explicitly modeled during the learning process. This makes it possible to obtain predictions that are not only accurate but also accompanied by meaningful confidence estimates. In this paper, we present a detailed analysis of Bayesian variational quantum classifiers and their role in enabling uncertainty-aware quantum machine learning. The discussion covers the foundations of variational quantum circuits, Bayesian parameter estimation, and probabilistic prediction mechanisms within hybrid quantum-classical learning frameworks. Different training and inference strategies, including variational Bayesian optimization and sampling-based methods, are examined to highlight their effectiveness in capturing parameter uncertainty in quantum circuits. We also discuss emerging application areas, such as healthcare analytics, financial forecasting, and scientific data analysis, where uncertainty-aware quantum learning models can provide valuable insights.
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural networks due to the lack of an efficient differentiable learning algorithm. We devise an adversarial quantum-classical hybrid training scheme via coupling a quantum circuit generator and a classical neural network discriminator together. After training, the quantum circuit generative model can infer missing data with quadratic speed-up via amplitude amplification. We numerically simulate the learning and inference of generative adversarial quantum circuits using the prototypical bars-and-stripes dataset. Generative adversarial quantum circuits are a fresh approach to machine learning which may enjoy the practically useful quantum advantage of near-term quantum devices.
Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we develop a quantum bayesian learning framework of the restricted Boltzmann machine in the quantum-enhanced feature spaces. Our framework provides the encoding phase to map the real data and Boltzmann weight onto the quantum feature spaces and the training phase to learn an optimal inference function. Specifically, the training phase provides a physical quantity to measure the posterior distribution in quantum feature spaces, and this measure is utilized to design the quantum maximum a posterior (QMAP) algorithm and the quantum predictive distribution estimator (QPDE). It is shown that both quantum algorithms achieve exponential speed-up over their classical counterparts. Furthermore, it is interesting to note that our framework can figure out the classical bayesian learning tasks, i.e. processing the classical data and outputting corresponding classical labels. And a simulation, which is performed on an open-source software framework for quantum computing, illustrates that our algorithms show almost the same classification performance compared to their classical counterparts. Noting that the proposed quantum algorithms utilize the shallow circuit, our work is expected to be implemented on the noisy intermediate-scale quantum (NISQ) devices, and is one of the promising candidates to achieve quantum supremacy.