Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials Alina Dubrovska, Taisia Mischenko-Slatenkova University of Latvia.

Slides:

Advertisements

Similar presentations

Quantum Lower Bounds The Polynomial and Adversary Methods Scott Aaronson September 14, 2001 Prelim Exam Talk.

Advertisements

How to Solve Longstanding Open Problems In Quantum Computing Using Only Fourier Analysis Scott Aaronson (MIT) For those who hate quantum: The open problems.

Notes 6.6 Fundamental Theorem of Algebra

Vocabulary Lesson 10.1 Algebra Objective: I will be able to identify a polynomial and determine its degree.

1 Computational Geometry Chapter Range queries How do you efficiently find points that are inside of a rectangle? –Orthogonal range query ([x 1,

Extremal properties of polynomial threshold functions Ryan O’Donnell (MIT / IAS) Rocco Servedio (Columbia)

SECTION 3.6 COMPLEX ZEROS; COMPLEX ZEROS; FUNDAMENTAL THEOREM OF ALGEBRA FUNDAMENTAL THEOREM OF ALGEBRA.

Boolean Algebra Applications1 BOOLEAN ALGEBRA APPLICATIONS RELIABILITY OF CIRCUITS.

Lower Bounds for Collision and Distinctness with Small Range By: Andris Ambainis {medv, Mar 17, 2004.

Section 5.6 – Complex Zeros; Fundamental Theorem of Algebra Complex Numbers Standard form of a complex number is: a + bi. Every complex polynomial function.

General Results for Polynomial Equations

Polynomial Functions. Fundamental Theorem of Algebra: a polynomial with degree n, will have exactly n roots (some may be real, some may be imaginary)

Objectives Fundamental Theorem of Algebra 6-6

Quantum queries on permutations Taisia Mischenko-Slatenkova, Agnis Skuskovniks, Alina Vasilieva, Ruslans Tarasovs and Rusins Freivalds “COMPUTER SCIENCE.

Quantum Computing MAS 725 Hartmut Klauck NTU TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A.

2.3 Synthetic Substitution

6.3 – Evaluating Polynomials. degree (of a monomial) 5x 2 y 3 degree =

Lesson 4-1 Polynomial Functions.

Complex Zeros; Fundamental Theorem of Algebra

9.9 The Fundamental Theorem of Algebra

Decision Trees Shalev Ben-David. Definition Given a function and oracle access to, determine f(x) with minimum number of queries E.g. f is OR on the bits.

Welcome to Algebra I! Mr. Keith Jenkins Room 222 (check your schedule)

2.3 Synthetic Substitution OBJ:  To evaluate a polynomial for given values of its variables using synthetic substitution.

6.6 The Fundamental Theorem of Algebra

Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 2.4 Real Zeros of Polynomial Functions.

3.2a Multiply a monomial and a polynomial. A-APR.6 Rewrite simple rational expressions in different forms; write a(x) ⁄ b(x) in the form q(x) + r(x) ⁄

7.4 and 7.5 Solving and Zeros of Polynomials

General Results for Polynomial Equations In this section, we will state five general theorems about polynomial equations, some of which we have already.

Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.

Objective Use long division and synthetic division to divide polynomials.

Chapter 2 Polynomial and Rational Functions. Warm Up

Quantum algorithms vs. polynomials and the maximum quantum-classical gap in the query model.

Does tropical geometry look like…. No, it looks like …

1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 3 Polynomial and Rational Functions.

3.6 Complex Zereos. The Fundamental Theorem of Algebra The Fundamental Theorem of Algebra says that every polynomial with complex coefficients must have.

Solving Polynomial Functions involving Complex Numbers.

Exact quantum algorithms Andris Ambainis University of Latvia.

7.5 Roots and Zeros Objectives: The student will be able to…

Jeopardy Factoring Functions Laws of Exponents Polynomial Equations Q $100 Q $200 Q $300 Q $400 Q $100 Q $200 Q $300 Q $400 Final Jeopardy Q $500.

Forrelation: A Problem that Optimally Separates Quantum from Classical Computing.

1/27/ Fundamental Theorem of Algebra. Intro Find all zeros for each of the following: Multiplicity – When more than one zero occurs at the.

5.6 The Fundamental Theorem of Algebra. If P(x) is a polynomial of degree n where n > 1, then P(x) = 0 has exactly n roots, including multiple and complex.

Section 4.6 Complex Zeros; Fundamental Theorem of Algebra.

Holt McDougal Algebra Fundamental Theorem of Algebra Use the Fundamental Theorem of Algebra and its corollary to write a polynomial equation of least.

7.5 Roots and Zeros Objectives:

2015/16 TI-Smartview 2.5 The Fundamental Theorem of Algebra.

The Fundamental Theorem of Algebra Intro - Chapter 4.6.

Solve polynomial equations with complex solutions by using the Fundamental Theorem of Algebra. 5-6 THE FUNDAMENTAL THEOREM OF ALGEBRA.

State the Domain and Range. 3  /2  /2  22 –1 1 -- -2  -3  /2-  /2.

Algebra II Honors POD Multiply the following: Homework: p odds.

Honors Precalc: Warm-Up Solve for x. 1.) x = 0 2.)Perform the operation on the following complex numbers (express answers as a + bi). a.) (5 – 3i)(-2+4i)

Every polynomial P(x) of degree n>0 has at least one zero in the complex number system. N Zeros Theorem Every polynomial P(x) of degree n>0 can be expressed.

Conjugate Pairs Theorem Every complex polynomial function of degree n  1 has exactly n complex zeros, some of which may repeat. 1) A polynomial function.

Martin-Gay, Beginning Algebra, 5ed 22 x x 3 2  x 5 2  x + 11 Polynomial Vocabulary Term – a number or a product of a number and variables raised.

Quadratic Functions 2A Polynomials. A polynomial in x is an expression that contains only non-negative, whole number powers of x. The degree of a polynomial.

SOLVING SINGLE EQUATIONS Engineers are often required to solve complicated algebraic equations. These equations may represent cause-and-effect relationships.

3.5 Complex Zeros & the Fundamental Theorem of Algebra.

Polynomials Investigating Graphs and Transformations

On the analysis of indexing schemes

NAND as a complete system and Karnaugh Maps

5-5 Theorems About Roots of Polynomial Equations

3.8 Complex Zeros; Fundamental Theorem of Algebra

If a polynomial q(x) is divided by x – 4, the quotient is 2

Fundamental Theorem of Algebra

An Upper Bound on the GKS Game via Max Bipartite Matching

Section 2: Intro to Taylor Polynomials

Fundamental Theorem of Algebra

Dividing Polynomials (Long Division)

Dividing Polynomials (Long Division)

Degrees of a Monomial.

Presentation transcript:

Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials Alina Dubrovska, Taisia Mischenko-Slatenkova University of Latvia

Research problem Query algorithms are used to compute the value of Boolean functions Complexity = number of questions We consider quantum query model Every Boolean function can be represented by an algebraic polynomial, which is unique Complexity of quantum query algorithm is related to degree of representing polynomial: We are searching for new efficient quantum query algorithms and functions with low polynomial degree

Exact Quantum Query Algorithms Exact quantum algorithm with queries. Base function: Exact quantum algorithm with queries. Base function:

Low Degree Polynomials Problem: construct a polynomial p(x) for which deg(p) is much lower than number of variables. For each odd k>1 there exists 3k-variable Boolean function f with D(f)=3k and deg(f)=2(k-1). Generalization: Transform the set {0,1,2,3} to {0,1}  deg(f 9 )=4, D(f 9 )=9 where p represents Boolean function f. deg(p)=2 Approach: construction of a polynomial of degree 2 and non-Boolean range of values.