# Mixed-Integer Programming Using a Bosonic Quantum Computer

arXiv: https://arxiv.org/abs/2112.13917 · HTML: https://mlsanity.com/paper/2112.13917/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Dec 2021.

## Built on by (most cited first, 1 of 1)

- [Explainable AI using expressive Boolean formulas](https://mlsanity.com/paper/2306.03976/) (2023)

## Abstract (arXiv)

We propose a scheme for solving mixed-integer programming problems in which the optimization problem is translated to a ground-state preparation problem on a set of bosonic quantum field modes (qumodes). We perform numerical demonstrations by simulating a circuit-based optical quantum computer with each individual qumode prepared in a Gaussian state. We simulate an adiabatic evolution from an initial mixing Hamiltonian, written in terms of the momentum operators of the qumodes, to a final Hamiltonian which is a polynomial of the position and boson number operators. In these demonstrations, we solve a variety of small non-convex optimization problems in integer programming, continuous non-convex optimization, and mixed-integer programming.