@inproceedings{ed8fcbb71b9244ae89aec0fde0867449,
title = "Quantum automata cannot detect biased coins, even in the limit",
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.",
keywords = "Quantum automata",
author = "Guy Kindler and Ryan O'Donnell",
note = "Publisher Copyright: {\textcopyright} Guy Kindler and Ryan O'Donnell;.; 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 ; Conference date: 10-07-2017 Through 14-07-2017",
year = "2017",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.ICALP.2017.15",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Anca Muscholl and Piotr Indyk and Fabian Kuhn and Ioannis Chatzigiannakis",
booktitle = "44th International Colloquium on Automata, Languages, and Programming, ICALP 2017",
address = "ألمانيا",
}