Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Non-convex optimization algorithm based on alternating quantum walk with potentials

Dan Li, Guoliang Ju

Published Feb 26, 2026• 0 citations
Publisher
DOI
10.1007/s11128-026-05107-2

Related papers

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

Xi-Jun Yuan, Shuo Zhou, Yizhou Liu +15 more

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.

arXiv:2611.16791•Nov 12, 2026•0 citations

Solving hard optimization problems using quantum walks

Puya Mirkarimi, Adam Callison, Nicholas Chancellor +1 more

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Quantum Walk-Based Optimization Algorithms

Jincheng Zhang

This paper investigates the potential of quantum walk algorithms for solving optimization problems. Traditional optimization algorithms often struggle with complex search spaces due to their inherent limitations in exploring multiple possibilities simultaneously. Quantum walks, inspired by quantum mechanics, offer a compelling alternative by exploiting superposition and interference. This work proposes a novel quantum walk-based algorithm designed for efficient exploration of optimization landscapes. The core idea revolves around encoding the optimization problem as a quantum walk on a graph, where the walker's probabilistic movement is governed by quantum mechanical principles. We demonstrate how superposition allows the walker to exist in multiple states concurrently, while interference can amplify the probability of reaching optimal solutions. The algorithm's effectiveness is analyzed through theoretical considerations and mathematical formulations, highlighting its potential advantages over classical approaches. This research contributes to the growing field of quantum optimization and offers a new perspective on tackling challenging optimization tasks.

•Aug 28, 2026•0 citations

Discrete-time quantum walk-based optimization algorithm

Ioannis Liliopoulos, Georgios D. Varsamis, Ioannis G. Karafyllidis

Quantum Information Processing•Jan 17, 2024•7 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

Lecture notes in computer science•Jul 29, 2025•1 citation

A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices

Jakub Mareček, Albert Akhriev

There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here, we discuss how to utilize an alternative approach to convex optimization, in general, and semidefinite programming (SDP), in particular. This approach is based on a randomized variant of the cutting-plane method. We show how to leverage quantum speed-up of an eigensolver in speeding up an SDP solver utilizing the cutting-plane method. For the first time, we demonstrate a practical implementation of a randomized variant of the cutting-plane method for semidefinite programming on instances from SDPLIB, a well-known benchmark. Furthermore, we show that the RCP method is very robust to noise in the boundary oracle, which may make RCP suitable for use even on noisy quantum devices.

arXiv:2110.03400•Oct 7, 2021•6 citations
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.
This paper investigates the potential of quantum walk algorithms for solving optimization problems. Traditional optimization algorithms often struggle with complex search spaces due to their inherent limitations in exploring multiple possibilities simultaneously. Quantum walks, inspired by quantum mechanics, offer a compelling alternative by exploiting superposition and interference. This work proposes a novel quantum walk-based algorithm designed for efficient exploration of optimization landscapes. The core idea revolves around encoding the optimization problem as a quantum walk on a graph, where the walker's probabilistic movement is governed by quantum mechanical principles. We demonstrate how superposition allows the walker to exist in multiple states concurrently, while interference can amplify the probability of reaching optimal solutions. The algorithm's effectiveness is analyzed through theoretical considerations and mathematical formulations, highlighting its potential advantages over classical approaches. This research contributes to the growing field of quantum optimization and offers a new perspective on tackling challenging optimization tasks.
There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here, we discuss how to utilize an alternative approach to convex optimization, in general, and semidefinite programming (SDP), in particular. This approach is based on a randomized variant of the cutting-plane method. We show how to leverage quantum speed-up of an eigensolver in speeding up an SDP solver utilizing the cutting-plane method. For the first time, we demonstrate a practical implementation of a randomized variant of the cutting-plane method for semidefinite programming on instances from SDPLIB, a well-known benchmark. Furthermore, we show that the RCP method is very robust to noise in the boundary oracle, which may make RCP suitable for use even on noisy quantum devices.