betaFeedback

WorksPhysics and Astronomy

Non-Convex Optimization via Quantum Tunneling Search on a Photonic Chip

Abstract

Non-convex optimization plays an important role in modern machine learning since plenty of real-world problems have objective functions or constraints with non-convex properties. The non-convex nature of landscapes gives rise to numerous local minima and saddle points, dramatically hindering the ability of gradient descent-based methods to explore the landscape and obtain global optima. Here we present quantum tunneling search (QTS), an algorithm based on quantum tunneling walk and local annealing, which effectively explores the non-convex landscape by leveraging the quantum tunneling effect. In experiments, we map an objective function to the potential term of the waveguide Hamiltonian by controlling the refractive index with the femtosecond direct laser writing technique. With a proper input state, the average probability distributions on 10-micrometer-spaced 29 x 1 and 21 x 9 waveguide arrays highlight the local minima of various 1D and 2D non-convex landscapes, respectively. By further introducing the varying Hamiltonian approach, more efficient search and even the identification of the global minimum are achieved. Our work experimentally verifies that QTS is a successful and efficient non-convex optimization solver, demonstrating quantum speedups over classical stochastic gradient descent (SGD), which serves as a practical application of near-term analog quantum simulators in the field of machine learning.

Paper details

vlnc:W_nrywmpg4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 4

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…