A Question About Quantum Finite Automata Scott Aaronson (MIT) Is there a QFA that takes as input an infinite sequence of i.i.d. coin flips, and whose limiting.

Slides:



Advertisements
Similar presentations
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
Advertisements

A Theory of Isolatability Scott Aaronson Andrew Drucker MIT.
How Much Information Is In Entangled Quantum States? Scott Aaronson MIT |
Quantum Versus Classical Proofs and Advice Scott Aaronson Waterloo MIT Greg Kuperberg UC Davis | x {0,1} n ?
Quantum Software Copy-Protection Scott Aaronson (MIT) |
Limitations of Quantum Advice and One-Way Communication Scott Aaronson UC Berkeley IAS Useful?
How Much Information Is In A Quantum State? Scott Aaronson MIT |
Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) August 14, 2003.
Advice Coins Scott Aaronson. PSPACE/coin: Class of problems solvable by a PSPACE machine that can flip an advice coin (heads with probability p, tails.
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
How to Solve Longstanding Open Problems In Quantum Computing Using Only Fourier Analysis Scott Aaronson (MIT) For those who hate quantum: The open problems.
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.
When Qubits Go Analog A Relatively Easy Problem in Quantum Information Theory Scott Aaronson (MIT)
THE QUANTUM COMPLEXITY OF TIME TRAVEL Scott Aaronson (MIT)
Let’s extend our knowledge of trigonometric functions…
Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.
Do Now:.
Data Handling & Analysis BD Andrew Jackson Zoology, School of Natural Sciences
Quantitative Skills 4: The Chi-Square Test
Great Theoretical Ideas in Computer Science.
The Structure of a Hypothesis Test. Hypothesis Testing Hypothesis Test Statistic P-value Conclusion.
Physics 270 – Experimental Physics. Let say we are given a functional relationship between several measured variables Q(x, y, …) What is the uncertainty.
Probability theory and average-case complexity. Review of probability theory.
Classical and Quantum Automata Abuzer Yakaryılmaz Advisor: Prof. Cem Say.
1 Languages. 2 A language is a set of strings String: A sequence of letters Examples: “cat”, “dog”, “house”, … Defined over an alphabet: Languages.
1 Introduction to Computability Theory Lecture14: Recap Prof. Amos Israeli.
Chris Morgan, MATH G160 January 9, 2012 Lecture 1 Chapter 4.1, 4.2, & 4.3: Set Theory, Introduction to Probability.
CS5371 Theory of Computation
Unit 11: Chi-Squared Tests. Type I and type II errors A “type I” error in a sig test is to reject H 0 when it is true. –Many “discoveries” are type.
1 Finite Automata. 2 Finite Automaton Input “Accept” or “Reject” String Finite Automaton Output.
1 Languages and Finite Automata or how to talk to machines...
CHAPTER 4 Decidability Contents Decidable Languages
Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.
CS5371 Theory of Computation Lecture 4: Automata Theory II (DFA = NFA, Regular Language)
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Unit 4 Starters. Starter Suppose a fair coin is tossed 4 times. Find the probability that heads comes up exactly two times.
Section 11.4 Language Classes Based On Randomization
1 Finite Automata (Finite State Machine) Lecture 4-5 Ref. Handout p18-24.
Let’s flip a coin. Making Data-Based Decisions We’re going to flip a coin 10 times. What results do you think we will get?
Simple Mathematical Facts for Lecture 1. Conditional Probabilities Given an event has occurred, the conditional probability that another event occurs.
Randomized Turing Machines
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
P. STATISTICS LESSON 8.2 ( DAY 1 )
Rotation Around a Point. A Rotation is… A rotation is a transformation that turns a figure around a fixed point called the center of rotation. A rotation.
Rotation – A circular movement around a fixed point Rotation.
Problem of the Day 1.) Graph triangle ABC
Minimal NFA Problems are hard Tao Jiang & B. Ravikumar N Andres Parra.
Math 1320 Chapter 7: Probability 7.3 Probability and Probability Models.
CS 154 Formal Languages and Computability May 12 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Theory of Computation Automata Theory Dr. Ayman Srour.
Lecture #4 Thinking of designing an abstract machine acts as finite automata. Advanced Computation Theory.
PROBABILITY AND COMPUTING RANDOMIZED ALGORITHMS AND PROBABILISTIC ANALYSIS CHAPTER 1 IWAMA and ITO Lab. M1 Sakaidani Hikaru 1.
CS 461 – Nov. 2 Sets Prepare for ATM finite vs. infinite Infinite sets
Languages.
Introduction to Statistics for Engineers
Notes Over 3.4 The Rational Zero Test
CSCI 2670 Introduction to Theory of Computing
Uncountable Classical and Quantum Complexity Classes
Modeling Computation:
Undecidable Problems (unsolvable problems)
Making Data-Based Decisions
How many different ways can 8 people be seated in a row of 8 seats
Chapter Nine: Advanced Topics in Regular Languages
Formal Languages, Automata and Models of Computation
Rotation.
Turing Machines Everything is an Integer
Non Deterministic Automata
Let’s start an intro unit to Geometry!!
Rotations.
Presentation transcript:

A Question About Quantum Finite Automata Scott Aaronson (MIT) Is there a QFA that takes as input an infinite sequence of i.i.d. coin flips, and whose limiting probability a of being in an “Accept” state is  2/3 if the coin is fair, or  1/3 if the coin is unfair? (Where ) Hellman-Cover 1970: The answer is “no” for classical finite automata. Indeed, any DFA that distinguishes a fair coin from a coin with bias , w.h.p., must have Ω(1/  ) states A.-Drucker 2011: The Hellman-Cover argument fails for quantum FAs! Indeed, for any fixed  >0, there’s a 2-state QFA that distinguishes a fair coin from a coin with bias , halting after ~1/  2 steps with a probably-correct answer

Idea of the QFA for fixed  : Just rotate a qubit an  (  ) amount clockwise with each heads, or counterclockwise with each tails With  (  2 ) probability, measure in {|0 ,|1  } basis On the other hand: let p = coin bias and S = dimension of the QFA. Then Drucker and I showed that the limiting acceptance probability a(p) is a quotient g(p)/h(p) of two degree-S 2 polynomials, except possibly when h(p)=0 (and that’s the trouble!) a(p) p

Now, if the QFA halts on entering an Accept state, then we can show that a(p) is a rational function on the entire open interval p  (0,1) (Though possibly not at the endpoints—do you see why?) So, at least in the halting case, a single QFA indeed can’t distinguish p=1/2 from all p  1/2 My question is whether this can be extended to QFAs that never halt, but only “accept” or “reject” in the limit