Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are quadratically faster than any classical algorithm. Amplitude amplification is controlled by choosing two complex numbers φ s and φt of unit norm, called phase factors. If the phases are well-chosen, amplitude amplification reduces the error of quantum algorithms, if not, it may increase the error. We give an analysis of amplitude amplification with a emphasis on the influence of the phase factors on the error of quantum algorithms. We introduce a so-called phase matrix and use it to give a straightforward and novel analysis of amplitude amplification processes. We show that we may always pick identical phase factors φ s = φt with argument in the range π/3 ≤ arg(φs) ≤ π. We also show that identical phase factors φs = φt with - π/2 < arg(φs)
CITATION STYLE
Høyer, P. (2005). The phase matrix. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 308–317). Springer Verlag. https://doi.org/10.1007/11602613_32
Mendeley helps you to discover research relevant for your work.