We introduce a comprehensive quantum solver for binary combinatorial optimization
problems on gate-model quantum computers that outperforms any published alternative and …

This manuscript provides a comprehensive review of the Maximum Clique Problem, a
computational problem that involves finding subsets of vertices in a graph that are all …

Quantum optimization has emerged as a promising frontier of quantum computing, providing
novel numerical approaches to mathematical optimization problems. The main goal of this …

The advent of quantum computing holds the potential to revolutionize various fields by
solving complex problems more efficiently than classical computers. Despite this promise …

We investigate the possibility and current limitations of flow computations using quantum
annealers by solving a fundamental flow problem on Ising machines. As a fundamental …

Posiform planting is a method for constructing QUBO problems with a single unique planted
solution that can be tailored to arbitrary connectivity graphs. In this study we investigate …

Quantum annealers (QA), such as D-Wave systems, become increasingly efficient and
competitive at approximating combinatorial optimization problems. However, solving …

We benchmark Quantum Annealing (QA) vs. Simulated Annealing (SA) with a focus on the
impact of the embedding of problems onto the different topologies of the D-Wave quantum …

In this paper, we focus on graph-based analysis of the topology of D-Wave quantum
computers. The Pegasus, Chimera and Zephyr topologies generated with different …

Given an undirected graph, the stable set problem asks to determine the cardinality of the
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …