Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Speedups for Bayesian Network Structure Learning

Published 31 May 2023 in cs.DS and quant-ph | (2305.19673v2)

Abstract: The Bayesian network structure learning (BNSL) problem asks for a directed acyclic graph that maximizes a given score function. For networks with nn nodes, the fastest known algorithms run in time O(2nn2)O(2^n n^2) in the worst case, with no improvement in the asymptotic bound for two decades. Inspired by recent advances in quantum computing, we ask whether BNSL admits a polynomial quantum speedup, that is, whether the problem can be solved by a quantum algorithm in time O(cn)O(c^n) for some constant cc less than $2$. We answer the question in the affirmative by giving two algorithms achieving c≤1.817c \le 1.817 and c≤1.982c \le 1.982 assuming the number of potential parent sets is, respectively, subexponential and O(1.453n)O(1.453^n). Both algorithms assume the availability of a quantum random access memory. We also prove that one presumably cannot lower the base $2$ for any classical algorithm, as that would refute the strong exponential time hypothesis.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.