A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
A new algorithm for fixed point quantum search
Quantum Information & Computation
Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle
Quantum Information & Computation
Hi-index | 0.00 |
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 ${{\pi}\over{3}}{\leq} {\rm arg}(\phi_{s}){\leq} {\pi}$. We also show that identical phase factors φs = φt with $-{{\pi}\over{2}}φs = φt with ${\rm arg}(\phi_{s}) = {{\pi}\over{3}}$.