On Quadratization of Pseudo-Boolean Functions

Abstract

We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of terms based on their common parts.

11 pages

References in corpus (1)

• The Expressive Power of Binary Submodular Functions

Cited by in corpus (7)

• Bayesian Network Structure Learning Using Quantum Annealing
• Enhancing Quantum Annealing Performance for the Molecular Similarity Problem
• An Integrated Programming and Development Environment for Adiabatic Quantum Optimization
• Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing
• QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
• Quadratization of Symmetric Pseudo-Boolean Functions
• Higher Order Maximum Persistency and Comparison Theorems