D ec 2 00 1 Sharp quantum vs . classical query complexity separations

@inproceedings{Beaudrap2001DE2,
  title={D ec 2 00 1 Sharp quantum vs . classical query complexity separations},
  author={J. Niel de Beaudrap and Richard Cleve and John Watrous},
  year={2001}
}
We obtain the strongest separation between quantum and classical query complexity known to date—specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved exactly in the quantum case with a single query (and a polynomial number of auxiliary operations). The problem is simple to define and the quantum algorithm solving it is also simple when described in terms of certain quantum Fourier transforms (QFTs) that have… CONTINUE READING

Similar Papers

Loading similar papers…