Quantum Advantage for All

by   Christoph M. Kirsch, et al.

We show how to translate a subset of RISC-V machine code compiled from a subset of C to quadratic unconstrained binary optimization (QUBO) models that can be solved by a quantum annealing machine: given a bound n, there is input I to a program P such that P runs into a given program state E executing no more than n machine instructions if and only if the QUBO model of P for n evaluates to 0 on I. Thus, with more qubits on the machine than variables in the QUBO model, quantum annealing the model reaches 0 (ground) energy in constant time with high probability on some input I that is part of the ground state if and only if P runs into E on I in no more than n instructions. Translation takes 𝒪(n^2) time turning a quantum annealer into a polynomial-time symbolic execution engine and bounded model checker, eliminating their path and state explosion problems. Here, we take advantage of the fact that any machine instruction may only increase the size of the program state by 𝒪(w) bits where w is machine word size. Translation time comes down to 𝒪(n) if memory consumption of P is bounded by a constant, establishing a linear (quadratic) upper bound on quantum space, in number of qubits, in terms of algorithmic time (space) in classical computing. This result motivates a temporal and spatial metric of quantum advantage. Our prototypical open-source toolchain translates machine code that runs on real RISC-V hardware to models that can be solved by real quantum annealing hardware, as shown in our experiments.


page 1

page 2

page 3

page 4


A Single-Step Multiclass SVM based on Quantum Annealing for Remote Sensing Data Classification

In recent years, the development of quantum annealers has enabled experi...

An Ensemble Approach for Compressive Sensing with Quantum

We leverage the idea of a statistical ensemble to improve the quality of...

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Factorization Machine (FM) is the most commonly used model to build a re...

A symbolic approach to discrete structural optimization using quantum annealing

With the advent of novel quantum computing technologies, and the knowled...

Quantum and Classical Algorithms for Approximate Submodular Function Minimization

Submodular functions are set functions mapping every subset of some grou...

Practical Graph Bipartization with Applications in Near-Term Quantum Computing

We experimentally evaluate the practical state-of-the-art in graph bipar...

Q-Match: Iterative Shape Matching via Quantum Annealing

Finding shape correspondences can be formulated as an NP-hard quadratic ...

Please sign up or login with your details

Forgot password? Click here to reset