Quantum weighted model counting

DOI10.3233/FAIA200401MaRDI QIDQ4999323zbMATH OpenOpenAlexFDO

Authors Fabrizio Riguzzi

Publication date 6 July 2021

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

Mathematics Subject Classification ID

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

Abstract: In Weighted Model Counting (WMC) we assign weights to Boolean literals and we want to compute the sum of the weights of the models of a Boolean function where the weight of a model is the product of the weights of its literals. WMC was shown to be particularly effective for performing inference in graphical models, with a complexity of $O(n{2}^w)$ where $n$ is the number of variables and $w$ is the treewidth. In this paper, we propose a quantum algorithm for performing WMC, Quantum WMC (QWMC), that modifies the quantum model counting algorithm to take into account the weights. In turn, the model counting algorithm uses the algorithms of quantum search, phase estimation and Fourier transform. In the black box model of computation, where we can only query an oracle for evaluating the Boolean function given an assignment, QWMC solves the problem approximately with a complexity of $Theta(2^{fracn2})$ oracle calls while classically the best complexity is $Theta(2^n)$, thus achieving a quadratic speedup.

Recommendations

• A structured view on weighted counting with relations to counting, quantum computation and applications
• scientific article; zbMATH DE number 2103524
• Exact quantum algorithm to distinguish Boolean functions of different weights
• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• Quantum computing and quadratically signed weight enumerators

Cited in

(6)

• A structured view on weighted counting with relations to counting, quantum computation and applications
• Algebraic model counting
• Weighted model counting on the GPU by exploiting small treewidth
• Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights
• Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
• Classical computation over quantum architectures. From graph encoding to declarative languages compilation

This page was built for publication: Quantum weighted model counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999323)