In the last couple of decades, the world has seen several stunning instances of quantum
algorithms that provably outperform the best classical algorithms. For most problems …

We report on a case study in programming an early quantum annealer to attack optimization
problems related to operational planning. While a number of studies have looked at the …

Information Security was first published with McGraw Hill, then later revised and published
with Springer. This is the second edition with Springer. What has changed you might …

An effective approach to solving complex problems is to decompose them and integrate
dedicated solvers for those subproblems. We introduce a hybrid decomposition that …

In this article, we show how to map a sampling of the hardest artificial intelligence problems
in space exploration onto equivalent Ising models that then can be attacked using quantum …

Many researchers believe quantum computing will be a practical reality within the next 5–10
years. There have been significant advances in the research for quantum computing in …

We compare the performance of four quantum annealers, the D-Wave Two, 2X, 2000Q, and
Advantage in solving an identical ensemble of a parametrized family of scheduling …

An effective approach to solving problems involving mixed (continuous and discrete)
variables and constraints, such as hybrid systems, is to decompose them into subproblems …

One approach to solving planning problems is to compile them to another problem for which
powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP …

Boolean networks allow for the construction of dynamical models of biological processes
such as the cell cycle, cellular differentiation, ageing or diseases such as cancer. The …