Quantum automata cannot detect biased coins, even in the limit
classification
💻 cs.CC
quant-ph
keywords
biasedquantumtossesaaronsonacceptingansweraskedautomata
read the original abstract
Aaronson and Drucker (2011) asked whether there exists a quantum finite automaton that can distinguish fair coin tosses from biased ones by spending significantly more time in accepting states, on average, given an infinite sequence of tosses. We answer this question negatively.
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.