The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for quantum versions of amplification problems. Next, we establish nearly optimal quantum-classicalarXiv:cs/9904019v2 fatcat:6xj5kxpbifg37fezhfyril3s7e