Abstract
Suppose we have a small quantum computer with only qubits. Can such a device genuinely speed up certain algorithms, even when the problem size is much larger than ? Here we answer this question to the affirmative. We present a hybrid quantum-classical algorithm to solve 3-satisfiability problems involving 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.
- Received 24 July 2018
- Revised 14 September 2018
DOI:https://doi.org/10.1103/PhysRevLett.121.250501
© 2018 American Physical Society
Physics Subject Headings (PhySH)
Synopsis
A Possible Quantum Computing Boost
Published 18 December 2018
A hybrid quantum-classical computing algorithm could solve a basic computer science problem faster than a classical computer.
See more in Physics