Journal
PHYSICAL REVIEW LETTERS
Volume 121, Issue 25, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.121.250501
Keywords
-
Categories
Funding
- Alexander von Humboldt Foundation
- ERC Advanced Grant QENOCOBA under the EU Horizon 2020 program [742102]
Ask authors/readers for more resources
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 3-satisfiability 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available