  We discuss several mappings from well-known NP-hard problems to Quadratic
Unconstrained Binary Optimisation problems which are treated incorrectly by
Lucas. We provide counterexamples and correct the mappings. We also extend the
body of QUBO formulations of NP-complete and NP-hard optimisation problems by
discussing additional problems.
