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

World Academy of Science, Engineering and Technology, International Journal of Computer and Information Engineering

An Adiabatic Quantum Optimization Approach for the Mixed Integer Nonlinear Programming Problem

M. Todd Henderson, Tristan Cook, Justin Chan Jin Le, Mark J. Hodson, YoungJung Chang, John T. Novak, Daniel Fernando Padilha, Nishan Kulatilaka, Ansu Bagchi, S.K. Ray, John Kelly

Published May 14, 2018• 0 citations
OpenAlex

Related papers

Reinforcement-Learning-Based Quantum Adiabatic Algorithm Design for Integer Programming

Jiawei Zhu

Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.

SPIN•Sep 1, 2021•0 citations

An improved hybrid quantum optimization algorithm for solving nonlinear equations

Yumin Dong, Jinlei Zhang

Quantum Information Processing•Apr 1, 2021•17 citations

Quantum Algorithms for Optimization Problems

Dilnoz Muhamediyeva, Rustam Raximov, Shavkat Urokov

Lecture notes in computer science•Jul 29, 2025•0 citations

Mixed-Integer Programming Using a Bosonic Quantum Computer

Farhad Khosravi, Artur Scherer, Pooya Ronagh

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.

arXiv:2112.13917•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

A quantum computing-based numerical method of mixed-integer optimal control problems under uncertainty for alkali–surfactant–polymer flooding

Zhe Liu, Shurong Li, Yulei Ge

This article presents a numerical method based on quantum computing to solve two unresolved key issues for alkali–surfactant–polymer (ASP) flooding in oil exploitation: uncertainties affecting development planning and a switch control regarding injection oil wells. First, a fuzzy multi-objective mixed-integer optimal control model describing the mechanism of ASP flooding is established. Then, an improved possibilistic programming algorithm is presented to remove fuzziness and transform the model into a deterministic single-objective mixed-integer nonlinear programming (MINLP) model. On this basis, a bi-level quantum computing algorithm including quantum annealing and quantum ant colony algorithm is proposed to solve the MINLP and acquire the optimal mixed-integer control variables. The superiority of the proposed algorithm is verified by testing a number of benchmark examples. Finally, the numerical method based on quantum computing is adopted to solve successfully a mixed-integer optimal control problem for ASP flooding under uncertainty.

Engineering Optimization•Apr 2, 2020•12 citations

Learning adiabatic quantum algorithms over optimization problems

Davide Pastorello, Enrico Blanzieri, Valter Cavecchia

Quantum Machine Intelligence•Jan 3, 2021•9 citations
Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.
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.
This article presents a numerical method based on quantum computing to solve two unresolved key issues for alkali–surfactant–polymer (ASP) flooding in oil exploitation: uncertainties affecting development planning and a switch control regarding injection oil wells. First, a fuzzy multi-objective mixed-integer optimal control model describing the mechanism of ASP flooding is established. Then, an improved possibilistic programming algorithm is presented to remove fuzziness and transform the model into a deterministic single-objective mixed-integer nonlinear programming (MINLP) model. On this basis, a bi-level quantum computing algorithm including quantum annealing and quantum ant colony algorithm is proposed to solve the MINLP and acquire the optimal mixed-integer control variables. The superiority of the proposed algorithm is verified by testing a number of benchmark examples. Finally, the numerical method based on quantum computing is adopted to solve successfully a mixed-integer optimal control problem for ASP flooding under uncertainty.