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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

I describe one quantum approach to solving 3-satisfiability (3-SAT), the wellknown problem in computer science. The approach is based on repeatedlymeasuring the truth value of the clauses forming the 3-SAT proposition using anon-orthogonal basis. If the basis slowly evolves then there is a stronganalogy to adiabatic quantum computing, although the approach is entirelycircuit-based. To solve a 3-SAT problem of n variables requires a quantumregister of $n$ qubits, or more precisely rebits i.e. qubits whose phase needonly be real. For cases of up to n=26 qubits numerical simulations indicatethat the algorithm runs fast, outperforming Grover's algorithm and having ascaling with n that is superior to the best reported classical algorithms.There are indications that the approach has an inherent robustness versusimperfections in the elementary operations.

Performance of a measurement-driven 'adiabatic-like' quantum 3-SAT solver