Quick Navigation
Topics
Open Quantum Systems Decoherence
Quantum Simulation
Quantum State Preparation Representation
Entanglement Theory Quantum Correlations
Quantum automata cannot detect biased coins, even in the limit
arXiv
Authors: Guy Kindler, Ryan O`Donnell
Year
2016
Paper ID
43004
Status
Preprint
Abstract Read
~2 min
Abstract Words
41
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2016 reference point for readers tracking recent quantum research.
- 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...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.