2026-07-22T17:53:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7399 2024-03-06T10:40:17Z ddc:004 open_access

Quantum Automata Cannot Detect Biased Coins, Even in the Limit Kindler, Guy O'Donnell, Ryan quantum automata 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Guy Kindler and Ryan O'Donnell 2017 Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2017.15 urn:nbn:de:0030-drops-73995 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.15 eng https://creativecommons.org/licenses/by/3.0/legalcode