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

Applied Soft Computing

A parallel algorithm based on quantum annealing and double-elite spiral search for mixed-integer optimal control problems in engineering

Zhe Liu, Shurong Li, Yulei Ge

Published May 18, 2022• 8 citations
Publisher
DOI
10.1016/j.asoc.2022.109018

Related papers

Numerical Computation of a Mixed-Integer Optimal Control Problem Based on Quantum Annealing

Zhe Liu, Shurong Li, Yulei Ge

Journal of Shanghai Jiaotong University (Science)•Jul 31, 2020•3 citations

Improved Bloch Quantum Genetic Algorithm Based on Elite Strategy

Maoyu Du, Qiudong Yu, Laiqi Zhao +1 more

Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.

International Conference on Intelligent Computing and Next Generation Networks (ICNGN)•Nov 23, 2024•0 citations

A Quantum Computing Based Numerical Method for Solving Mixed-Integer Optimal Control Problems

Zhe Liu, Shurong Li

Journal of Systems Science and Complexity•Jan 12, 2021•7 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

Parallel Improved Quantum Evolutionary Algorithm for Complex Optimization Problems

Yapeng Sun

Lecture notes in computer science•Jan 1, 2022•1 citation

Quantum annealing computing for grid partition in large-scale power systems

Dawei Wang, Kedi Zheng, Qixin Chen +2 more

As more and more controllable devices equiped in the smart grid, the inceasing scale of binary virables brings time-consuming dimension explosion problems to traditional optimizations problems. As a parallel computing method, quantum computing is valuable for exploration to accelerate the optimization computation. The classic quantum annealer (QA) only can be used for quadratic unconstraint binary optimization (QUBO) problems. This paper is to explore a novel algorithm based on the quantum annealer for grid partition problems. It is a typical large-scale Integer Quadratic Programming (IQP) problems. The proposed quantum algorithm attemped to apply Lagrangian relaxation (LR) and alternating direction method of multipliers (ADMM), to transform an IQP problem to general format of QUBO problems. Some numerical cases of the grid partition are discussed to compare the performance of the proposed algorithm with some typical methods, thus verifing the feasibility and performance of this ADMM-QA algorithm.

IEEE International Electrical and Energy Conference (CIEEC)•May 27, 2022•2 citations
Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.
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.
As more and more controllable devices equiped in the smart grid, the inceasing scale of binary virables brings time-consuming dimension explosion problems to traditional optimizations problems. As a parallel computing method, quantum computing is valuable for exploration to accelerate the optimization computation. The classic quantum annealer (QA) only can be used for quadratic unconstraint binary optimization (QUBO) problems. This paper is to explore a novel algorithm based on the quantum annealer for grid partition problems. It is a typical large-scale Integer Quadratic Programming (IQP) problems. The proposed quantum algorithm attemped to apply Lagrangian relaxation (LR) and alternating direction method of multipliers (ADMM), to transform an IQP problem to general format of QUBO problems. Some numerical cases of the grid partition are discussed to compare the performance of the proposed algorithm with some typical methods, thus verifing the feasibility and performance of this ADMM-QA algorithm.