# Computational speedups using small quantum devices

arXiv: https://arxiv.org/abs/1807.08970 · HTML: https://mlsanity.com/paper/1807.08970/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 24 Jul 2018.

## Built on by (most cited first, 1 of 1)

- [Augmented Electronic Ising Machine as an Effective SAT Solver](https://mlsanity.com/paper/2305.01623/) (2023)

## Abstract (arXiv)

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.