mlsanityData to 14 Oct 2026

Non-convex Quadratic Programming Using Coherent Optical Networks

arXiv 2209.04415 ↗First posted 9 Sep 2022quant-ph cs.DS math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

We investigate the possibility of solving continuous non-convex optimization problems using a network of interacting quantum optical oscillators. We propose a native encoding of continuous variables in analog signals associated with the quadrature operators of a set of quantum optical modes. Optical coupling of the modes and noise introduced by vacuum fluctuations from external reservoirs or by weak measurements of the modes are used to optically simulate a diffusion process on a set of continuous random variables. The process is run sufficiently long for it to relax into the steady state of an energy potential defined on a continuous domain. As a first demonstration, we numerically benchmark solving box-constrained quadratic programming (BoxQP) problems using these settings. We consider delay-line and measurement-feedback variants of the experiment. Our benchmarking results demonstrate that in both cases the optical network is capable of solving BoxQP problems over three orders of magnitude faster than a state-of-the-art classical heuristic.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Sep 2022.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.