This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding
a maximum clique in a graph, one of the most fundamental and important NP-hard problems. …

Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality
solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of …

Forest ecosystems are critical for their carbon sequestration potential. Increasing tree
diversity has been shown to enhance both forest productivity and litter decomposition. Litter …

Commercial quantum annealers from D-Wave Systems can find high quality solutions of
quadratic unconstrained binary optimization problems that can be embedded onto its hardware. …

We consider the minimum vertex cover problem having applications in eg biochemistry and
network security. Quantum annealers can find the optimum solution of such NP-hard …

Background Influenza virus is responsible for a large global burden of disease, especially in
children. Multiple Organ Dysfunction Syndrome (MODS) is a life-threatening and fatal …

Quantum annealing has the potential to find low energy solutions of NP-hard problems that
can be expressed as quadratic unconstrained binary optimization problems. However, the …

The recent availability of the first commercial quantum computers has provided a promising
tool to tackle NP hard problems which can only be solved heuristically with present …

Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices
capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we …

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of
Karp’s 21 NP-hard problems, have several applications in computational chemistry, …