Computational speedups using small quantum devices
Quantum Physics
2018-12-26 v2 Artificial Intelligence
Computational Complexity
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.
Cite
@article{arxiv.1807.08970,
title = {Computational speedups using small quantum devices},
author = {Vedran Dunjko and Yimin Ge and J. Ignacio Cirac},
journal= {arXiv preprint arXiv:1807.08970},
year = {2018}
}
Comments
5+12 pages