English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Quantum computers have the potential of solving problems more efficientlythan classical computers. While first commercial prototypes have becomeavailable, the performance of such machines in practical application is stillsubject to exploration. Quantum computers will not entirely replace classicalmachines, but serve as accelerators for specific problems. This necessitatesintegrating quantum computational primitives into existing applications.  In this paper, we perform a case study on how to augment existing softwarewith quantum computational primitives for the Boolean satisfiability problem(SAT) implemented using a quantum annealer (QA). We discuss relevant qualitymeasures for quantum components, and show that mathematically equivalent, butstructurally different ways of transforming SAT to a QA can lead to substantialdifferences regarding these qualities. We argue that engineers need to be awarethat (and which) details, although they may be less relevant in traditionalsoftware engineering, require considerable attention in quantum computing.

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