REVIEW
Quantum advantage for combinatorial optimization problems, Simplified
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
quant-ph
keywords
advantagecomputersoptimizationproblemsquantumapproximatingclassicalcombinatorial
read the original abstract
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation however gives nothing in practice.
Discussion (0). Continue with ORCID to comment.