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]  Eli Biham,et al.  Grover's quantum search algorithm for an arbitrary initial mixed state , 2002 .

[2]  Frédéric Magniez,et al.  Quantum algorithms for the triangle problem , 2005, SODA '05.

[3]  Theodore J. Yoder,et al.  Fixed-point quantum search with an optimal number of queries. , 2014, Physical review letters.

[4]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[5]  Richard J. Lipton,et al.  Quantum Algorithms via Linear Algebra: A Primer , 2014 .

[6]  Andrew M. Childs,et al.  Exponential improvement in precision for simulating sparse Hamiltonians , 2013, Forum of Mathematics, Sigma.

[7]  Ronald de Wolf,et al.  Improved Quantum Communication Complexity Bounds for Disjointness and Equality , 2001, STACS.

[8]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[9]  A. Acín Statistical distinguishability between unitary operations. , 2001, Physical review letters.

[10]  Keiji Matsumoto,et al.  Simpler Exact Leader Election via Quantum Reduction , 2014, Chic. J. Theor. Comput. Sci..

[11]  Ronald de Wolf,et al.  Communication complexity lower bounds by polynomials , 1999, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[12]  P. Høyer Arbitrary phases in quantum amplitude amplification , 2000, quant-ph/0006031.

[13]  Maris Ozols,et al.  Quantum rejection sampling , 2011, ITCS '12.

[14]  Debajyoti Bera,et al.  Detection and Diagnosis of Single Faults in Quantum Circuits , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  G M D'Ariano,et al.  Using entanglement improves the precision of quantum measurements. , 2001, Physical review letters.

[16]  Runyao Duan,et al.  Entanglement is not necessary for perfect discrimination between unitary operations. , 2007, Physical review letters.

[17]  G. Brassard,et al.  Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.

[18]  Markus Grassl,et al.  Grover's quantum search algorithm for an arbitrary initial amplitude distribution , 1999 .

[19]  Steven Homer,et al.  Small depth quantum circuits , 2007, SIGA.

[20]  François Le Gall,et al.  Quantum Query Complexity of Unitary Operator Discrimination , 2017, COCOON.