Translating Constraints into QUBOs for the Quadratic Knapsack Problem

One of the first fields where quantum computing will likely show its use is optimisation. Many optimisation problems naturally arise in a quadratic manner, such as the quadratic knapsack problem. The current state of quantum computers requires these problems to be formulated as a quadratic unconstrained binary optimisation problem, or QUBO....

Quantum Cloud Computing from a User Perspective

Quantum computing is a rapidly progressing field: quantum computers are becoming more powerful and an increasing number of functionalities are offered via various quantum platforms and quantum software packages. Current quantum computers can be used almost exclusively via cloud services. It is expected that this will remain the case, at least in...

Efficient Quantum Solution for the Constrained Tactical Capacity Problem for Distributed Electricity Generation

With the transition to sustainable energy sources and devices, the demand for and supply of energy increases ever more. With energy grids struggling to keep up with this increase, we need to ensure that supply and demand are correctly matched. The Tactical Capacity Problem tackles this issue by choosing the optimal location of sustainable power...

Evaluating the Q-score of Quantum Annealers

We report the Atos Q-score for D-Wave’s quantum devices, classical algorithms and hybrid quantum-classical solver. Computing the Q-score entails solving the Max-Cut problem for increasingly large graphs. This work presents the first computation of the Q-score on a quantum device and shows how these quantum devices compare to classical devices at...