Quantum approximate optimization algorithm for Bayesian network structure learning

DOI10.1007/s11128-022-03769-2OpenAlexW4311350302MaRDI QIDQ2111010

Concha Bielza, Vicente P. Soloviev, Pedro Larrañaga

Publication date: 23 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02400

zbMATH Keywords

quantum optimizationBayesian network structure learningquantum approximate optimization algorithmvariational quantum algorithm

Mathematics Subject Classification ID

Bayesian inference (62F15) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Uses Software

• PMTK
• QISKit

Cites Work

• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• The max-min hill-climbing Bayesian network structure learning algorithm
• A Bayesian method for the induction of probabilistic networks from data
• Estimating the dimension of a model
• Supervised learning with quantum computers
• Learning Bayesian networks: The combination of knowledge and statistical data
• Learning Bayesian networks in the space of structures by estimation of distribution algorithms
• Discrete Bayesian Network Classifiers
• The theory of variational hybrid quantum-classical algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum approximate optimization algorithm for Bayesian network structure learning