Amplitude Amplification for Operator Identification and Randomized Classes
Amplitude amplification (AA) is tool of choice for quantum algorithm designers to increase the success probability of query algorithms that reads its input in the form of oracle gates. Geometrically speaking, the technique can be understood as rotation in a specific two-dimensional space. We study and use a generalized form of this rotation operator to design algorithms in a geometric manner. Specifically, we apply AA to algorithms that take their input in the form of input states and in which rotations with different angles and directions are used in a unified manner. We show that AA can be used to sequentially discriminate between two unitary operators, both without error and with bounded-error, in an asymptotically optimal manner. We also show how to reduce error probability in one and two-sided bounded error algorithms more efficiently than the usual parallel repetitions technique; in particular, errors can be completely eliminated from the exact error algorithms.
- 1.Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th STOC (1996)Google Scholar
- 4.Kobayashi, H., Matsumoto, K., Tani, S.: Simpler exact leader election via quantum reduction. Chic. J. Theor. Comput. Sci. 2014(10) (2014)Google Scholar
- 5.Berry, D.W., Childs, A.M., Cleve, R., Kothari, R., Somma, R.D.: Exponential improvement in precision for simulating sparse Hamiltonians. In: Proceedings of the 46th STOC (2014)Google Scholar
- 7.Yoder, T.J., Low, G.H., Chuang, I.L.: Fixed-point quantum search with an optimal number of queries. Phys. Rev. Lett. 113, 210501 (2014). https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.113.210501CrossRefGoogle Scholar
- 18.Bera, D.: Amplitude amplification for operator identification and randomized classes. Technical report TR14-151. Electronic Colloquium on Computational Complexity (2018)Google Scholar
- 21.Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th CCC (2001)Google Scholar