[Paper Review] Quantum Lower Bounds by Polynomials

Robert Beals, Harry Buhrman+3 more|ArXiv.org|Feb 18, 1998

Quantum Computing Algorithms and ArchitectureComputer Science29 references179 citations

TL;DR

This paper establishes that quantum algorithms cannot achieve exponential speed-ups over classical algorithms for total Boolean functions, proving a polynomial upper bound of O(T⁶) classical queries for any quantum algorithm using T queries. It provides tight characterizations of quantum query complexity for symmetric functions and exact bounds for AND, OR, and PARITY across exact, zero-error, and bounded-error models using a quantum extension of the polynomial method.

ABSTRACT

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions (i.e. problems involving a promise on the input) by Deutsch and Jozsa and by Simon cannot be obtained for any total function: if a quantum algorithm computes some total Boolean function f with bounded-error using T black-box queries then there is a classical deterministic algorithm that computes f exactly with O(T^6) queries. We also give asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings. Finally, we give new precise bounds for AND, OR, and PARITY. Our results are a quantum extension of the so-called polynomial method, which has been successfully applied in classical complexity theory, and also a quantum extension of results by Nisan about a polynomial relationship between randomized and deterministic decision tree complexity.

Motivation & Objective

• To determine the limits of quantum speed-up for total Boolean functions in the black-box model.
• To characterize the quantum query complexity of symmetric functions across exact, zero-error, and bounded-error settings.
• To establish tight bounds for fundamental functions like AND, OR, and PARITY under various error models.
• To extend the classical polynomial method to quantum query complexity, enabling new lower bound techniques.

Proposed method

• Use a quantum extension of the polynomial method, mapping T-query quantum algorithms to multilinear polynomials of degree at most 2T.
• Apply symmetrization techniques to reduce the analysis of symmetric functions to univariate polynomials.
• Leverage degree bounds of approximating polynomials to derive lower bounds on query complexity.
• Use the polynomial method to prove that bounded-error quantum query complexity is polynomially related to deterministic query complexity.
• Apply results from Nisan on randomized vs. deterministic decision trees to strengthen the classical-quantum complexity relationship.
• Use block sensitivity and polynomial degree arguments to prove optimality of quantum algorithms for specific functions.

Experimental results

Research questions

• RQ1 Can quantum algorithms achieve exponential speed-ups for total Boolean functions in the black-box model?
• RQ2 What is the exact quantum query complexity of symmetric functions such as AND, OR, and PARITY?
• RQ3 How do quantum query complexities relate to classical deterministic and randomized query complexities for total functions?
• RQ4 Can the polynomial method be extended to derive tight lower bounds for quantum query complexity?
• RQ5 What is the minimal number of queries required for exact, zero-error, and bounded-error computation of MAJORITY and other symmetric functions?

Key findings

• No exponential quantum speed-up is possible for any total Boolean function: if a quantum algorithm computes a total function with bounded-error using T queries, then a classical deterministic algorithm can compute it exactly using O(T⁶) queries.
• For symmetric functions, the quantum query complexity is tightly characterized in terms of the degree of their representing polynomials in the exact, zero-error, and bounded-error models.
• The exact and zero-error quantum query complexity of OR is N, while the bounded-error complexity is Θ(√N), demonstrating a quadratic speed-up.
• The exact and zero-error quantum query complexity of PARITY is N/2, and its bounded-error complexity is also N/2, with the degree of its approximating polynomial being N.
• For MAJORITY, the bounded-error quantum query complexity is Θ(N), with an upper bound of N/2 + √N, and the exact complexity is at least (N+1)/2.
• The polynomial method proves that XOR and its negation are the only binary connectives for which quantum algorithms offer a query advantage over classical algorithms.