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:1901.10557

Bayesian Networks based Hybrid Quantum-Classical Machine Learning Approach to Elucidate Gene Regulatory Pathways

Radhakrishnan Balu, Ajinkya Borle

Published Jan 23, 2019• 4 citations
arXivHTMLPDF

Abstract

We report a scalable hybrid quantum-classical machine learning framework to build Bayesian networks (BN) that captures the conditional dependence and causal relationships of random variables. The generation of a BN consists of finding a directed acyclic graph (DAG) and the associated joint probability distribution of the nodes consistent with a given dataset. This is a combinatorial problem of structural learning of the underlying graph, starting from a single node and building one arc at a time, that fits a given ensemble using maximum likelihood estimators (MLE). It is cast as an optimization problem that consists of a scoring step performed on a classical computer, penalties for acyclicity and number of parents allowed constraints, and a search step implemented using a quantum annealer. We have assumed uniform priors in deriving the Bayesian network that can be relaxed by formulating the problem as an estimation Dirichlet parameters. We demonstrate the utility of the framework by applying to the problem of elucidating the gene regulatory network for the MAPK/Raf pathway in human T-cells using proteomics data where the concentration of proteins, nodes of the BN, are interpreted as probabilities.

DOI
10.48550/arxiv.1901.10557

Related papers

Quantum Circuits for CRISPR-Guided Gene Regulatory Network Inference

Rubayat Islam Khan, Mazharul Karim, Nuruzzaman Sojib +1 more

Gene regulatory networks (GRNs) encode the combinatorial dependencies that drive cellular programs but are difficult to learn from CRISPR perturbation data using classical models with pairwise features. We present a parameterized quantum circuit (PQC) implemented in Qiskit that represents each gene as a qubit, encodes expression with single-qubit$\text{Ry}(\pi \mathrm{x})$rotations, and models directed regulation with controlled-Ry ($\left.\theta _{-}\{\mathbf{i} \rightarrow \mathbf{j}\}\right)$gates. Circuit parameters are trained by a hybrid classical-quantum loop (SPSA/COBYLA on Aer), and the learned$\theta$values yield a weighted, directed GRN. Experiments on synthetic and curated immune-pathway datasets ($\mathbf{4 - 8}$genes) show consistent gains over strong classical baselines. The PQC achieves 95.2% accuracy, 94.8% precision, 95.6 % recall,$\mathrm{F} 1=95.2 \%$, and$\text{AUC}=0.98$, improving performance by 5-6 percentage points while requiring fewer samples to reach a given accuracy ($\approx 90 \%$using only 50 % of the training set). Graph analysis of the inferred network ranks TP53, NFKB1, IL6, MAPK1, and VEGFA as top regulators, aligning with biological priors. We also evaluate sparse interaction topologies that reduce two-qubit depth while retaining accuracy, underscoring near-term hardware viability using Ry and CNOT-based decompositions. Our results provide an interpretable and data-efficient quantum blueprint for CRISPR-guided network inference and motivate larger-scale tests on real quantum devices. Code and circuits are available for reproducibility.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•1 citation

Quantum-Inspired Optimization of Large-Scale Bayesian Networks

Jincheng Zhang

This paper investigates the application of quantum-inspired optimization techniques to the problem of inference and learning within large-scale Bayesian Networks (BNs). Traditional Bayesian Network learning and inference methods often struggle with scalability, particularly as the number of nodes and dependencies increases. We propose leveraging concepts from quantum algorithms, specifically drawing inspiration from quantum annealing and quantum Monte Carlo methods, to efficiently explore the complex search space associated with BN structure optimization and parameter estimation. The core idea is to mimic the exploration capabilities of quantum systems to accelerate the process. The proposed methodology aims to improve the efficiency of BN learning and inference, potentially unlocking new capabilities for probabilistic reasoning in complex systems. This work presents a theoretical framework and a conceptual outline for such an approach, laying the groundwork for future research and experimentation. The effectiveness of this approach is predicated on the ability to translate the inherent parallelism of quantum algorithms into an efficient optimization strategy for Bayesian Networks.

•Aug 28, 2026•0 citations

Adaptive Bayesian Networks: A Quantumized Algorithm for Complex System Modeling

Jincheng Zhang

The Adaptive Bayesian Networks (ABN) represent a powerful framework for modeling complex systems by leveraging probabilistic inference and Bayesian reasoning. This paper introduces a novel quantumized algorithm for ABN, designed to enhance learning and prediction accuracy, particularly for systems exhibiting intricate probability distributions. We explore the utilization of quantum phenomena – superposition and entanglement – to accelerate the network's learning process and improve the precision of risk assessments. The core mechanism focuses on applying quantum-enhanced optimization techniques to the ABN structure, leading to a more efficient and accurate representation of the underlying probability landscape. This research addresses the limitations of classical ABN algorithms, offering a promising pathway toward enhanced predictive capabilities in diverse domains.

•Aug 31, 2026•0 citations

Quantum-Inspired Bayesian Network Structure Learning via Entangled State Sampling

Jincheng Zhang

Bayesian network structure learning aims to discover the probabilistic relationships between variables from data. Traditional methods often struggle with high-dimensional data and computational complexity. This paper proposes a novel approach to Bayesian network structure learning inspired by quantum mechanical principles, specifically, the concept of entangled states. We introduce an algorithm that simulates the sampling of entangled states to explore the space of possible network structures. The probability of a particular structure is determined by the degree of entanglement observed during the simulation. This approach offers the potential for significantly improved efficiency and accuracy, particularly when dealing with complex datasets. The key idea is to treat network structure learning as a search problem where the "entanglement" represents the degree of correlation between different parts of the search space. We define the core metrics and algorithms used in this process, emphasizing the probabilistic interpretation of the entanglement measure. This work represents a significant departure from conventional Bayesian network learning, introducing a quantum-inspired perspective to enhance structure discovery.

•Sep 1, 2026•0 citations

Bayesian Networks of Density Operators

Steffen Lauritzen, Piotr Zwiernik

We study quantum analogues of Bayesian networks on a directed acyclic graph (DAG), distinguishing two constructions for positive definite density operators on finite-dimensional tensor-product Hilbert spaces. The intrinsic construction starts from a joint state and its conditional-independence properties. The extrinsic construction assembles a state sequentially from prescribed local quantum kernels, following an ordering compatible with the arrows of the DAG. For the intrinsic construction, we prove the equivalence of the ordered, local, and global directed Markov properties, together with entropy, recursive-factorization, and logarithmic characterizations. The extrinsic construction always gives a normalized state and recovers each kernel as a conditional on all preceding systems. The same kernel, however, need not be recovered from the marginal on the vertex and its parents; a three-qubit example exhibits this obstruction. We prove that independence of the chosen topological ordering is sufficient exactly for transitive DAGs: every order-invariant kernel family then yields an intrinsically directed Markov state. Finally, we associate a logarithmic candidate with every positive definite state and DAG, prove that it is subnormalized, and show that the trace-one candidate is a directed Markov state. Both the candidate and the excess global information are invariant under DAG Markov equivalence.

quant-pharXiv:2607.27876•Jul 31, 2026•0 citations

A Hybrid Quantum-Classical Machine Learning Framework for Accelerated Drug Discovery

Sriramadasu Sri Sainadh, Saigeetha S.B., Jeeru Bharath Reddy +4 more

The pharmaceutical industry faces mounting challenges in drug discovery, where exploring a chemical space exceeding 10 60 possible compounds remains computationally prohibitive. Traditional in-silico screening approaches struggle to capture the quantum mechanical interactions that determine molecular behavior. To overcome these limitations, this study introduces a hybrid quantum–classical machine learning framework that uniquely integrates molecular graph theory with quantum-enhanced learning for accelerated drug discovery. Using the QM9 benchmark dataset containing 133,885 molecules of low-to-medium structural complexity, we extract Laplacian eigenvalue spectra as topological descriptors that preserve both connectivity and electronic information. These features are jointly processed by Random Forest (RF), Support Vector Machine (SVM), and a Variational Quantum Classifier (VQC) in a weighted ensemble architecture designed for balanced generalization. The Quantum Graph Neural Network (QGNN) component achieves 97.5% accuracy, while the hybrid ensemble attains 100.0% accuracy, confirming strong predictive reliability. Although quantum training requires roughly 3.2× longer computation, it captures high-dimensional correlations that classical methods overlook. Overall, the proposed framework bridges the gap between theoretical quantum computing and practical pharmaceutical modeling, providing a scalable, physics-inspired pathway toward intelligent molecular screening and next-generation drug discovery systems.

Procedia Computer Science•Jan 1, 2026•0 citations
We report a scalable hybrid quantum-classical machine learning framework to build Bayesian networks (BN) that captures the conditional dependence and causal relationships of random variables. The generation of a BN consists of finding a directed acyclic graph (DAG) and the associated joint probability distribution of the nodes consistent with a given dataset. This is a combinatorial problem of structural learning of the underlying graph, starting from a single node and building one arc at a time, that fits a given ensemble using maximum likelihood estimators (MLE). It is cast as an optimization problem that consists of a scoring step performed on a classical computer, penalties for acyclicity and number of parents allowed constraints, and a search step implemented using a quantum annealer. We have assumed uniform priors in deriving the Bayesian network that can be relaxed by formulating the problem as an estimation Dirichlet parameters. We demonstrate the utility of the framework by applying to the problem of elucidating the gene regulatory network for the MAPK/Raf pathway in human T-cells using proteomics data where the concentration of proteins, nodes of the BN, are interpreted as probabilities.
Gene regulatory networks (GRNs) encode the combinatorial dependencies that drive cellular programs but are difficult to learn from CRISPR perturbation data using classical models with pairwise features. We present a parameterized quantum circuit (PQC) implemented in Qiskit that represents each gene as a qubit, encodes expression with single-qubitRy(πx)\text{Ry}(\pi \mathrm{x})Ry(πx)rotations, and models directed regulation with controlled-Ry (θ−{i→j})\left.\theta _{-}\{\mathbf{i} \rightarrow \mathbf{j}\}\right)θ−​{i→j})gates. Circuit parameters are trained by a hybrid classical-quantum loop (SPSA/COBYLA on Aer), and the learnedθ\thetaθvalues yield a weighted, directed GRN. Experiments on synthetic and curated immune-pathway datasets (4−8\mathbf{4 - 8}4−8genes) show consistent gains over strong classical baselines. The PQC achieves 95.2% accuracy, 94.8% precision, 95.6 % recall,F1=95.2%\mathrm{F} 1=95.2 \%F1=95.2%, andAUC=0.98\text{AUC}=0.98AUC=0.98, improving performance by 5-6 percentage points while requiring fewer samples to reach a given accuracy (≈90%\approx 90 \%≈90%using only 50 % of the training set). Graph analysis of the inferred network ranks TP53, NFKB1, IL6, MAPK1, and VEGFA as top regulators, aligning with biological priors. We also evaluate sparse interaction topologies that reduce two-qubit depth while retaining accuracy, underscoring near-term hardware viability using Ry and CNOT-based decompositions. Our results provide an interpretable and data-efficient quantum blueprint for CRISPR-guided network inference and motivate larger-scale tests on real quantum devices. Code and circuits are available for reproducibility.
This paper investigates the application of quantum-inspired optimization techniques to the problem of inference and learning within large-scale Bayesian Networks (BNs). Traditional Bayesian Network learning and inference methods often struggle with scalability, particularly as the number of nodes and dependencies increases. We propose leveraging concepts from quantum algorithms, specifically drawing inspiration from quantum annealing and quantum Monte Carlo methods, to efficiently explore the complex search space associated with BN structure optimization and parameter estimation. The core idea is to mimic the exploration capabilities of quantum systems to accelerate the process. The proposed methodology aims to improve the efficiency of BN learning and inference, potentially unlocking new capabilities for probabilistic reasoning in complex systems. This work presents a theoretical framework and a conceptual outline for such an approach, laying the groundwork for future research and experimentation. The effectiveness of this approach is predicated on the ability to translate the inherent parallelism of quantum algorithms into an efficient optimization strategy for Bayesian Networks.
The Adaptive Bayesian Networks (ABN) represent a powerful framework for modeling complex systems by leveraging probabilistic inference and Bayesian reasoning. This paper introduces a novel quantumized algorithm for ABN, designed to enhance learning and prediction accuracy, particularly for systems exhibiting intricate probability distributions. We explore the utilization of quantum phenomena – superposition and entanglement – to accelerate the network's learning process and improve the precision of risk assessments. The core mechanism focuses on applying quantum-enhanced optimization techniques to the ABN structure, leading to a more efficient and accurate representation of the underlying probability landscape. This research addresses the limitations of classical ABN algorithms, offering a promising pathway toward enhanced predictive capabilities in diverse domains.
Bayesian network structure learning aims to discover the probabilistic relationships between variables from data. Traditional methods often struggle with high-dimensional data and computational complexity. This paper proposes a novel approach to Bayesian network structure learning inspired by quantum mechanical principles, specifically, the concept of entangled states. We introduce an algorithm that simulates the sampling of entangled states to explore the space of possible network structures. The probability of a particular structure is determined by the degree of entanglement observed during the simulation. This approach offers the potential for significantly improved efficiency and accuracy, particularly when dealing with complex datasets. The key idea is to treat network structure learning as a search problem where the "entanglement" represents the degree of correlation between different parts of the search space. We define the core metrics and algorithms used in this process, emphasizing the probabilistic interpretation of the entanglement measure. This work represents a significant departure from conventional Bayesian network learning, introducing a quantum-inspired perspective to enhance structure discovery.
We study quantum analogues of Bayesian networks on a directed acyclic graph (DAG), distinguishing two constructions for positive definite density operators on finite-dimensional tensor-product Hilbert spaces. The intrinsic construction starts from a joint state and its conditional-independence properties. The extrinsic construction assembles a state sequentially from prescribed local quantum kernels, following an ordering compatible with the arrows of the DAG. For the intrinsic construction, we prove the equivalence of the ordered, local, and global directed Markov properties, together with entropy, recursive-factorization, and logarithmic characterizations. The extrinsic construction always gives a normalized state and recovers each kernel as a conditional on all preceding systems. The same kernel, however, need not be recovered from the marginal on the vertex and its parents; a three-qubit example exhibits this obstruction. We prove that independence of the chosen topological ordering is sufficient exactly for transitive DAGs: every order-invariant kernel family then yields an intrinsically directed Markov state. Finally, we associate a logarithmic candidate with every positive definite state and DAG, prove that it is subnormalized, and show that the trace-one candidate is a directed Markov state. Both the candidate and the excess global information are invariant under DAG Markov equivalence.
The pharmaceutical industry faces mounting challenges in drug discovery, where exploring a chemical space exceeding 10 60 possible compounds remains computationally prohibitive. Traditional in-silico screening approaches struggle to capture the quantum mechanical interactions that determine molecular behavior. To overcome these limitations, this study introduces a hybrid quantum–classical machine learning framework that uniquely integrates molecular graph theory with quantum-enhanced learning for accelerated drug discovery. Using the QM9 benchmark dataset containing 133,885 molecules of low-to-medium structural complexity, we extract Laplacian eigenvalue spectra as topological descriptors that preserve both connectivity and electronic information. These features are jointly processed by Random Forest (RF), Support Vector Machine (SVM), and a Variational Quantum Classifier (VQC) in a weighted ensemble architecture designed for balanced generalization. The Quantum Graph Neural Network (QGNN) component achieves 97.5% accuracy, while the hybrid ensemble attains 100.0% accuracy, confirming strong predictive reliability. Although quantum training requires roughly 3.2× longer computation, it captures high-dimensional correlations that classical methods overlook. Overall, the proposed framework bridges the gap between theoretical quantum computing and practical pharmaceutical modeling, providing a scalable, physics-inspired pathway toward intelligent molecular screening and next-generation drug discovery systems.