REVIEW
Superiority of exact quantum automata for promise problems
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
cs.CCcs.FLquant-ph
keywords
automataproblemspromisequantumamplitudesboundclassicalcorresponding
read the original abstract
In this note, we present an infinite family of promise problems which can be solved exactly by just tuning transition amplitudes of a two-state quantum finite automata operating in realtime mode, whereas the size of the corresponding classical automata grow without bound.
Discussion (0). Sign in to comment.