The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexityarXiv:1005.1601v1 fatcat:ou7trlkrebedzket6tpjykj46i