Quantum lower bound for recursive fourier sampling

نویسنده

  • Scott Aaronson
چکیده

We revisit the oft-neglected ‘recursive Fourier sampling’ (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one needs to go outside the RFS framework. Our proof argues that, given any variant of RFS, either the adversary method of Ambainis yields a good quantum lower bound, or else there is an efficient classical algorithm. This technique may be of independent interest. Subject classifications: quantum computing, lower bounds, query complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Polynomial Degree of Recursive Fourier Sampling

We present matching upper and lower bounds for the “weak” polynomial degree of the recursive Fourier sampling problem from quantum complexity theory. The degree bound is h+ 1, where h is the order of recursion in the problem’s definition, and this bound is exponentially lower than the bound implied by the existence of a BQP algorithm for the problem. For the upper bound we exhibit a degree-h + ...

متن کامل

Interactive proofs with efficient quantum prover for recursive Fourier sampling

We consider the recursive Fourier sampling problem (RFS), and show that there exists an interactive proof for RFS with an efficient classical verifier and efficient quantum prover.

متن کامل

O ct 2 00 2 QUANTUM ALGORITHM UNCERTAINTY PRINCIPLES

Abstract. In this paper, we will be concerned with a class of quantum algorithms that contains Shor’s factoring and discrete log algorithms. It turns out that for these algorithms, the probability of measuring an element in some set T (at the end of the algorithm) can be written in terms of the time-limiting and band-limiting operators from finite Fourier analysis. Associated with these operato...

متن کامل

An Improved Quantum Fourier Transform Algorithm and Applications

We give an algorithm for approximating the quantum Fourier transform over an arbitrary Zp which requires only O(n logn) steps where n = log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of Kitaev [11] which requires time quadratic in n. This algorithm also leads to a general and efficient Fourier sampling technique which improves upon the...

متن کامل

Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy

It is a long-standing open problem whether quantum computing can be verified by a classical verifier. In the computational complexity term, it is “Does any BQP problem have an interactive proof system with a BQP prover and a BPP verifier?”. Several partial solutions to the open problem have been obtained. For example, verifiable blind quantum computing protocols demonstrate that if the verifier...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره   شماره 

صفحات  -

تاریخ انتشار 2002