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

Structural and Multidisciplinary Optimization

An improved quantum-inspired evolutionary algorithm framework implemented to solve minimum vertex cover problem

Sulabh Bansal, Shiladitya Bhattacharjee

Published Jul 1, 2025• 1 citation
Publisher
DOI
10.1007/s00158-025-04078-9

Related papers

Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm

Zhaocai Wang, Kun Liang, Xiaoguang Bao +1 more

Quantum Information Processing•Jul 1, 2023•6 citations

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

Yongqiang Zhang, X.D. Mu, Xiaowen Liu +6 more

Applied Soft Computing•Feb 5, 2022•38 citations

Qubit-Efficient Quantum Circuit for the Minimum Vertex Cover Problem Using Grover's Algorithm

Krissada Sarawit, Kamonluk Suksen

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Calculating the Topological Resilience of Supply Chain Networks Using Quantum Hopfield Neural Networks

Nahed Abdelgaber, Chris Nikolopoulos

A quantum computing approach is presented for implementing a quantum version of a Hopfield Neural Network which is then used for solving the Minimum Vertex Cover (MVC) problem. A bijection maps the Minimum Vertex Cover of a graph to a stable pattern of the Quantum Hopfield Neural Network. The proposed algorithm reached a 100% accuracy in finding the minimum vertex cover for a testing dataset of graphs. The use of the Quantum HNN and quantum principles such as superposition enables the usage of potentially exponential power and speed up in solving NP-complete graph problems such as the MVC.

International Conference on Artificial Intelligence for Industries (AI4I)•Sep 1, 2021•3 citations

Ising Hamiltonians for Constrained Combinatorial Optimization Problems and the Metropolis‐Hastings Warm‐Starting Algorithm

Huimin Li, Jin‐Min Liang, Zhi‐Xi Wang +1 more

Abstract Quantum approximate optimization algorithm (QAOA) is a promising variational quantum algorithm for combinatorial optimization problems. However, the implementation of QAOA is limited due to the requirement that the problems be mapped to Ising Hamiltonians and the nonconvex optimization landscapes. Although the Ising Hamiltonians for many NP hard problems have been obtained, a general method to obtain the Ising Hamiltonians for constrained combinatorial optimization problems (CCOPs) has not yet been investigated. In this paper, a general method is introduced to obtain the Ising Hamiltonians for CCOPs and the Metropolis‐Hastings warm‐starting algorithm for QAOA is presented which can provably converge to the global optimal solutions. The effectiveness of this method is demonstrated by tackling the minimum weight vertex cover (MWVC) problem, the minimum vertex cover (MVC) problem, and the maximal independent set problem as examples. The Ising Hamiltonian for the MWVC problem is obtained first time by using this method. The advantages of the Metropolis‐Hastings warm‐starting algorithm presented here is numerically analyzed through solving 30 randomly generated MVC cases with 1‐depth QAOA.

arXiv:2307.08980•Advanced Quantum Technologies•Jul 16, 2023•3 citations

A Quantum-Inspired Evolutionary Algorithm for Optimization Numerical Problems

Maurizio Fiasché

Lecture notes in computer science•Jan 1, 2012•21 citations
A quantum computing approach is presented for implementing a quantum version of a Hopfield Neural Network which is then used for solving the Minimum Vertex Cover (MVC) problem. A bijection maps the Minimum Vertex Cover of a graph to a stable pattern of the Quantum Hopfield Neural Network. The proposed algorithm reached a 100% accuracy in finding the minimum vertex cover for a testing dataset of graphs. The use of the Quantum HNN and quantum principles such as superposition enables the usage of potentially exponential power and speed up in solving NP-complete graph problems such as the MVC.
Abstract Quantum approximate optimization algorithm (QAOA) is a promising variational quantum algorithm for combinatorial optimization problems. However, the implementation of QAOA is limited due to the requirement that the problems be mapped to Ising Hamiltonians and the nonconvex optimization landscapes. Although the Ising Hamiltonians for many NP hard problems have been obtained, a general method to obtain the Ising Hamiltonians for constrained combinatorial optimization problems (CCOPs) has not yet been investigated. In this paper, a general method is introduced to obtain the Ising Hamiltonians for CCOPs and the Metropolis‐Hastings warm‐starting algorithm for QAOA is presented which can provably converge to the global optimal solutions. The effectiveness of this method is demonstrated by tackling the minimum weight vertex cover (MWVC) problem, the minimum vertex cover (MVC) problem, and the maximal independent set problem as examples. The Ising Hamiltonian for the MWVC problem is obtained first time by using this method. The advantages of the Metropolis‐Hastings warm‐starting algorithm presented here is numerically analyzed through solving 30 randomly generated MVC cases with 1‐depth QAOA.