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

arXiv:2509.10811 · Chinese Journal of Physics

Quantum-Assisted Recursive Algorithm for Solving the Exact Cover Problem

Xiao‐Hui Ni, Jia-Cheng Fan, Ling‐Xiao Li, Ziwen Huang, Su-Juan Qin, Bingjie Xu, Wei-Huang, Fei Gao

Published Nov 1, 2026• 2 citations
arXivHTMLPDF
DOI
10.1016/j.cjph.2026.11.008

Related papers

Quantum alternating operator ansatz for solving the minimum exact cover problem

Shasha Wang, Hailing Liu, Yan-Qi Song +3 more

Physica A Statistical Mechanics and its Applications•Jul 22, 2023•19 citations

Quantum Alternating Operator Ansatz for Solving the Minimum Exact Cover Problem

Shasha Wang, Hailing Liu, Yan-Qi Song +3 more

•Jan 1, 2023•0 citations

Solving a Generalized Version of the Exact Cover Problem with a Light-Based Device

S. M. Shabab Hossain, Md. Mahmudur Rahman, M. Sohel Rahman

Lecture notes in computer science•Jan 1, 2011•0 citations

The Quantum Search Algorithms for All Solutions

Hai-Sheng Li, Zhu Qingxin, Song Lan +1 more

International Journal of Theoretical Physics•Aug 23, 2012•3 citations

Solving large minimum vertex cover problems on a quantum annealer

Elijah Pelofske, Georg Hahn, Hristo N. Djidjev

We consider the minimum vertex cover problem having applications in e.g. biochemistry and network security. Quantum annealers can find the optimum solution of such NP-hard problems, given they can be embedded on the hardware. This is often infeasible due to limitations of the hardware connectivity structure. This paper presents a decomposition algorithm for the minimum vertex cover problem: The algorithm recursively divides an arbitrary problem until the generated subproblems can be embedded and solved on the annealer. To speed up the decomposition, we propose several pruning and reduction techniques. The performance of our algorithm is assessed in a simulation study.

arXiv:1904.00051•ACM International Conference on Computing Frontiers (CF)•Apr 30, 2019•35 citations

A New Efficient Quantum Algorithm for Solving NP-complete Problems

Dhananjay P. Mehendale

•Jan 1, 2026•0 citations
We consider the minimum vertex cover problem having applications in e.g. biochemistry and network security. Quantum annealers can find the optimum solution of such NP-hard problems, given they can be embedded on the hardware. This is often infeasible due to limitations of the hardware connectivity structure. This paper presents a decomposition algorithm for the minimum vertex cover problem: The algorithm recursively divides an arbitrary problem until the generated subproblems can be embedded and solved on the annealer. To speed up the decomposition, we propose several pruning and reduction techniques. The performance of our algorithm is assessed in a simulation study.