Superiority of exact quantum automata for promise problems
classification
💻 cs.CC
cs.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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.