Mixed-Integer Programming Using a Bosonic Quantum Computer
arXiv:2112.13917 · doi:10.1109/QCE57702.2023.00029
Abstract
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.
13 pages, 9 figures
References in corpus (11)
- Variational Quantum Algorithms
- Photonic quantum technologies
- A Quantum Approximate Optimization Algorithm
- Universal Quantum Computation with Continuous-Variable Cluster States
- Quantum circuits with many photons on a programmable nanophotonic chip
- How Powerful is Adiabatic Quantum Computation?
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Experimental Gaussian Boson Sampling
- Generalized Geometrical Phase in the Case of Continuous Spectra
- Continuous-variable error correction for general Gaussian noises
- Cardinality Minimization, Constraints, and Regularization: A Survey