The European Physical Journal Special Topics

, Volume 224, Issue 1, pp 163–188

Bayesian network structure learning using quantum annealing

  • B. O’Gorman
  • R. Babbush
  • A. Perdomo-Ortiz
  • A. Aspuru-Guzik
  • V. Smelyanskiy
Review

DOI: 10.1140/epjst/e2015-02349-9

Cite this article as:
O’Gorman, B., Babbush, R., Perdomo-Ortiz, A. et al. Eur. Phys. J. Spec. Top. (2015) 224: 163. doi:10.1140/epjst/e2015-02349-9
Part of the following topical collections:
  1. Quantum Annealing: The Fastest Route to Quantum Computation?

Abstract

We introduce a method for the problem of learning the structure of a Bayesian network using the quantum adiabatic algorithm. We do so by introducing an efficient reformulation of a standard posterior-probability scoring function on graphs as a pseudo-Boolean function, which is equivalent to a system of 2-body Ising spins, as well as suitable penalty terms for enforcing the constraints necessary for the reformulation; our proposed method requires 𝓞(n2) qubits for n Bayesian network variables. Furthermore, we prove lower bounds on the necessary weighting of these penalty terms. The logical structure resulting from the mapping has the appealing property that it is instance-independent for a given number of Bayesian network variables, as well as being independent of the number of data cases.

Copyright information

© EDP Sciences and Springer 2015

Authors and Affiliations

  • B. O’Gorman
    • 2
  • R. Babbush
    • 2
  • A. Perdomo-Ortiz
    • 1
  • A. Aspuru-Guzik
    • 2
  • V. Smelyanskiy
    • 1
  1. 1.Quantum Artificial Intelligence Laboratory, NASA Ames Research Center, Moffett FieldMoffett FieldUSA
  2. 2.Department of Chemistry and Chemical BiologyHarvard UniversityCambridgeUSA

Personalised recommendations