<progress id="hpfzt"><pre id="hpfzt"></pre></progress>
<ruby id="hpfzt"></ruby>
<big id="hpfzt"><p id="hpfzt"></p></big>

<progress id="hpfzt"></progress>

<big id="hpfzt"><pre id="hpfzt"></pre></big>

<i id="hpfzt"></i>

<strike id="hpfzt"><video id="hpfzt"><ins id="hpfzt"></ins></video></strike>
<dl id="hpfzt"></dl>
Mirror operated in collaboration with local support

### Current browse context:

cs.ET

### Bookmark

(what is this?)

# Title: Quantum Annealing-Based Software Components: An Experimental Case Study with SAT Solving

Abstract: 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.
 Subjects: Emerging Technologies (cs.ET); Quantum Physics (quant-ph) DOI: 10.1145/3387940.3391472 Cite as: arXiv:2005.05465 [cs.ET] (or arXiv:2005.05465v1 [cs.ET] for this version)

## Submission history

From: Tom Krüger [view email]
[v1] Mon, 11 May 2020 22:20:17 GMT (131kb,D)
Æ´ÈýÕÅÓÎÏ·ÏÂÔØ