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.

Slides:

Advertisements

Similar presentations

Closed Timelike Curves Make Quantum and Classical Computing Equivalent

Advertisements

The Polynomial Method In Quantum and Classical Computing Scott Aaronson (MIT) OPEN PROBLEM.

A Theory of Isolatability Scott Aaronson Andrew Drucker MIT.

The Learnability of Quantum States Scott Aaronson University of Waterloo.

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 |

Quantum Double Feature Scott Aaronson (MIT) The Learnability of Quantum States Quantum Software Copy-Protection.

An Invitation to Quantum Complexity Theory The Study of What We Cant Do With Computers We Dont Have Scott Aaronson (MIT) QIP08, New Delhi BQP NP- complete.

BQP/qpoly EXP/poly Scott Aaronson UC Berkeley. BQP/qpoly Class of languages recognized by a bounded-error polytime quantum algorithm, with a polysize.

Scott Aaronson Institut pour l'Étude Avançée Le Principe de la Postselection.

QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.

Oracles Are Subtle But Not Malicious Scott Aaronson University of Waterloo.

The Equivalence of Sampling and Searching Scott Aaronson MIT.

When Qubits Go Analog A Relatively Easy Problem in Quantum Information Theory Scott Aaronson (MIT)

Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves.

4.4 Rational Root Theorem.

Notes 6.6 Fundamental Theorem of Algebra

Quantum Information and the PCP Theorem Ran Raz Weizmann Institute.

THE QUANTUM COMPLEXITY OF TIME TRAVEL Scott Aaronson (MIT)

Great Theoretical Ideas in Computer Science.

Quantum and probabilistic finite multitape automata Ginta Garkaje and Rusins Freivalds Riga, Latvia.

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Multiple random variables Transform methods (Sec , 4.5.7)

Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.

1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.

4.4 Notes The Rational Root Theorem. 4.4 Notes To solve a polynomial equation, begin by getting the equation in standard form set equal to zero. Then.

2.5 Zeros of Polynomial Functions

Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.

Real Zeros of a Polynomial Function Objectives: Solve Polynomial Equations. Apply Descartes Rule Find a polynomial Equation given the zeros.

Rational Root and Complex Conjugates Theorem. Rational Root Theorem Used to find possible rational roots (solutions) to a polynomial Possible Roots :

5.5 Theorems about Roots of Polynomial Equations P

Real Zeros of Polynomial Functions. Quick Review.

Computation Model and Complexity Class. 2 An algorithmic process that uses the result of a random draw to make an approximated decision has the ability.

Binomial Probability Distribution

1 New Coins from old: Computing with unknown bias Elchanan Mossel, U.C. Berkeley

Theory of Computing Lecture 21 MAS 714 Hartmut Klauck.

Zeros of Polynomials 2.5.

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.

Section 5.5 The Real Zeros of a Polynomial Function.

2.4/2.52.4/2.5 Real Zeros of Polynomial Functions.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.

1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.

CS151 Complexity Theory Lecture 16 May 20, The outer verifier Theorem: NP  PCP[log n, polylog n] Proof (first steps): –define: Polynomial Constraint.

Section 3.4 – Zeros of a Polynomial. Find the zeros of 2, -3 (d.r), 1, -4.

EXAMPLE 1 List possible rational zeros List the possible rational zeros of f using the rational zero theorem. a. f (x) = x 3 + 2x 2 – 11x + 12 Factors.

Warm – up #6 1 3 –2 – – – – 1 3–5–16 – 23– 8– 5 – 3 3– 1112 –21 3 is upper bound – 3 is lower bound Stop when neg. Stop when.

2.5 Zeros of Polynomial Functions Question to be answered: How do we determine zeros of functions that we cannot factor easily? Copyright © by Houghton.

3.3 Real Zeros of Polynomials. Rational Zero Theorem If the polynomial P(x) has integer coefficients then every rational zero of P is of the form p/q.

PROBABILITY AND COMPUTING RANDOMIZED ALGORITHMS AND PROBABILISTIC ANALYSIS CHAPTER 1 IWAMA and ITO Lab. M1 Sakaidani Hikaru 1.

Scott Aaronson (MIT) QIP08, New Delhi

Notes Over 3.4 The Rational Zero Test

3.3 Real Zeros of Polynomials

Rational Zero Theorem Rational Zero Th’m: If the polynomial

Rational Root and Complex Conjugates Theorem

Rational Root and Complex Conjugates Theorem

4.2 Real Zeros Finding the real zeros of a polynomial f(x) is the same as solving the related polynomial equation, f(x) = 0. Zero, solution, root.

Finding Real Roots of Polynomial Equations

Uncountable Classical and Quantum Complexity Classes

The Fundamental Theorem of Algebra

How many different ways can 8 people be seated in a row of 8 seats

The Computational Complexity of Decoding Hawking Radiation

CS21 Decidability and Tractability

Entropy CSCI284/162 Spring 2009 GWU.

Closed Timelike Curves Make Quantum and Classical Computing Equivalent

Notes Over 6.6 Possible Zeros Factors of the constant

Zeros of polynomial functions

Section 2.4: Real Zeros of Polynomial Functions

The Real Zeros of a Polynomial Function

Presentation transcript:

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 with probability 1-p) as many times as it wants Clear that PSPACE/poly PSPACE/coin Other direction? Could PSPACE/coin=ALL?

Hellman-Cover 1970: To distinguish a p=1/2 coin from a p=1/2+ coin with constant bias, you need a probabilistic finite automaton with (1/ ) states I.e. you cant detect a less than 1/exp(n) change in p without more than poly(n) bits to record the statisticsregardless of how many times you flip the coin Seems to answer our question! Except that it doesnt

First problem: p could be unbelievably small (1/Ackermann(n)), and info could be stored in log(1/p) Second problem: Hellman-Cover theorem is false for quantum finite automata! I can give a QFA with 2 qubits that distinguishes p=1/2 from p=1/2+ for any >0 So question stands: PSPACE/coin=ALL? BQPSPACE/coin=ALL?

Main Result: PSPACE/coin, BQPSPACE/coin are both contained in Something/poly Main Idea: Limiting distribution (or quantum state) of an s-state automaton can be expressed in terms of degree-s rational functions of p. These can oscillate at most s times as p goes from 0 to 1. Need to count and compare roots of real polynomials. If everything is doable in NC, then a PSPACE/poly upper bound follows.