  Quantum computers have the potential of solving problems more efficiently
than classical computers. While first commercial prototypes have become
available, the performance of such machines in practical application is still
subject to exploration. Quantum computers will not entirely replace classical
machines, but serve as accelerators for specific problems. This necessitates
integrating quantum computational primitives into existing applications.
  In this paper, we perform a case study on how to augment existing software
with quantum computational primitives for the Boolean satisfiability problem
(SAT) implemented using a quantum annealer (QA). We discuss relevant quality
measures for quantum components, and show that mathematically equivalent, but
structurally different ways of transforming SAT to a QA can lead to substantial
differences regarding these qualities. We argue that engineers need to be aware
that (and which) details, although they may be less relevant in traditional
software engineering, require considerable attention in quantum computing.
