Quantum automata cannot detect biased coins, even in the limit

Guy Kindler; Ryan O'Donnell

doi:10.4230/LIPIcs.ICALP.2017.15

Quantum automata cannot detect biased coins, even in the limit

Guy Kindler, Ryan O'Donnell

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
Editors	Anca Muscholl, Piotr Indyk, Fabian Kuhn, Ioannis Chatzigiannakis
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770415
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2017.15
State	Published - 1 Jul 2017
Event	44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 - Warsaw, Poland Duration: 10 Jul 2017 → 14 Jul 2017

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	80
ISSN (Print)	1868-8969

Conference

Conference	44th International Colloquium on Automata, Languages, and Programming, ICALP 2017
Country/Territory	Poland
City	Warsaw
Period	10/07/17 → 14/07/17

Bibliographical note

Publisher Copyright:
© Guy Kindler and Ryan O'Donnell;.

Keywords

Quantum automata

Access to Document

10.4230/LIPIcs.ICALP.2017.15

Cite this

Kindler, G., & O'Donnell, R. (2017). Quantum automata cannot detect biased coins, even in the limit. In A. Muscholl, P. Indyk, F. Kuhn, & I. Chatzigiannakis (Eds.), 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 Article 15 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 80). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2017.15

Kindler, Guy ; O'Donnell, Ryan. / Quantum automata cannot detect biased coins, even in the limit. 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. editor / Anca Muscholl ; Piotr Indyk ; Fabian Kuhn ; Ioannis Chatzigiannakis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{5345447462e24b21b2149ec6a476cd5e,

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 = "גרמניה",

}

Kindler, G & O'Donnell, R 2017, Quantum automata cannot detect biased coins, even in the limit. in A Muscholl, P Indyk, F Kuhn & I Chatzigiannakis (eds), 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017., 15, Leibniz International Proceedings in Informatics, LIPIcs, vol. 80, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, 10/07/17. https://doi.org/10.4230/LIPIcs.ICALP.2017.15

Quantum automata cannot detect biased coins, even in the limit. / Kindler, Guy; O'Donnell, Ryan.
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. ed. / Anca Muscholl; Piotr Indyk; Fabian Kuhn; Ioannis Chatzigiannakis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 15 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 80).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Quantum automata cannot detect biased coins, even in the limit

AU - Kindler, Guy

AU - O'Donnell, Ryan

PY - 2017/7/1

Y1 - 2017/7/1

N2 - 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.

AB - 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.

KW - Quantum automata

UR - http://www.scopus.com/inward/record.url?scp=85027251734&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICALP.2017.15

DO - 10.4230/LIPIcs.ICALP.2017.15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85027251734

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017

A2 - Muscholl, Anca

A2 - Indyk, Piotr

A2 - Kuhn, Fabian

A2 - Chatzigiannakis, Ioannis

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017

Y2 - 10 July 2017 through 14 July 2017

ER -

Kindler G, O'Donnell R. Quantum automata cannot detect biased coins, even in the limit. In Muscholl A, Indyk P, Kuhn F, Chatzigiannakis I, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 15. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ICALP.2017.15

Quantum automata cannot detect biased coins, even in the limit

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this