Gaussian boson sampling for binary optimization (2412.14783v1)

Abstract: Binary optimization is a fundamental area in computational science, with wide-ranging applications from logistics to cryptography, where the tasks are often formulated as Quadratic or Polynomial Unconstrained Binary Optimization problems (QUBO/PUBO). In this work, we propose to use a parametrized Gaussian Boson Sampler (GBS) with threshold detectors to address such problems. We map general PUBO instance onto a quantum Hamiltonian and optimize the Conditional Value-at-Risk of its energy with respect to the GBS ansatz. In particular, we observe that, when the algorithm reduces to standard Variational Quantum Eigensolver, the cost function is analytical. Therefore, it can be computed efficiently, along with its gradient, for low-degree polynomials using only classical computing resources. Numerical experiments on 3-SAT and Graph Partitioning problems show significant performance gains over random guessing, providing a first proof of concept for our proposed approach.