Computational speedups using small quantum devices

TL;DR

This paper demonstrates that small quantum computers with M qubits can be used in hybrid algorithms to significantly accelerate solving large 3SAT problems, highlighting potential near-term quantum advantages.

Contribution

It introduces a hybrid quantum-classical algorithm that leverages small quantum devices to speed up large-scale 3SAT problem solving, a novel approach for current quantum hardware.

Findings

Hybrid quantum-classical algorithm achieves speedup over classical methods

Small quantum devices can effectively contribute to large problem solving

Potential for near-term quantum advantage in combinatorial problems

Abstract

Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than M? Here we answer this question to the affirmative. We present a hybrid quantum-classical algorithm to solve 3SAT problems involving n>>M variables that significantly speeds up its fully classical counterpart. This question may be relevant in view of the current quest to build small quantum computers.