Robust Quantum Search with Uncertain Number of Target States

The quantum search algorithm is one of the milestones of quantum algorithms. Compared with classical algorithms, it shows quadratic speed-up when searching marked states in an unsorted database. However, the success rates of quantum search algorithms are sensitive to the number of marked states. In this paper, we study the relation between the success rate and the number of iterations in a quantum search algorithm of given λ=M/N, where M is the number of marked state and N is the number of items in the dataset. We develop a robust quantum search algorithm based on Grover–Long algorithm with some uncertainty in the number of marked states. The proposed algorithm has the same query complexity ON as the Grover’s algorithm, and shows high tolerance of the uncertainty in the ratio M/N. In particular, for a database with an uncertainty in the ratio M±MN, our algorithm will find the target states with a success rate no less than 96%.

[1]  F. M. Toyama,et al.  Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters , 2013, Quantum Inf. Process..

[2]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[3]  Yao Zhang,et al.  Recent advances in quantum machine learning , 2020, Quantum Eng..

[4]  M. Mosca.  Quantum Searching Counting and Amplitude Ampli cation by Eigenvector Analysis , 1998 .

[5]  G. Long,et al.  Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover's Quantum Search Algorithm , 1999, quant-ph/9904077.

[6]  R. Portugal.  Quantum Walks and Search Algorithms , 2013 .

[7]  Gilles Brassard,et al.  Quantum Algorithm for the Collision Problem , 2016, Encyclopedia of Algorithms.

[8]  Esam El-Araby,et al.  Scaling reconfigurable emulation of quantum algorithms at high precision and high throughput , 2019, Quantum Eng..

[9]  Lov K. Grover,et al.  Fixed-point quantum search. , 2005, Physical review letters.

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

[11]  Andrew M. Childs,et al.  Spatial search by quantum walk , 2003, quant-ph/0306054.

[12]  Andris Ambainis.  A new protocol and lower bounds for quantum coin flipping , 2004, J. Comput. Syst. Sci..

[13]  G. Brassard.  Searching a Quantum Phone Book , 1997, Science.

[14]  M. Yung,et al.  Variational quantum packaged deflation for arbitrary excited states , 2021, Quantum Eng..

[15]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[16]  Giuseppe Castagnoli,et al.  Highlighting the Mechanism of the Quantum Speedup by Time-Symmetric and Relational Quantum Mechanics , 2013, 1308.5077.

[17]  Jian Sun,et al.  Enhancing crystal structure prediction by decomposition and evolution schemes based on graph theory , 2021, Fundamental Research.

[18]  Liang Hao,et al.  Geometric pictures for quantum search algorithms , 2012, Quantum Inf. Process..

[19]  Christof Zalka.  GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.

[20]  G. Long.  Grover algorithm with zero theoretical failure rate , 2001, quant-ph/0106071.

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

[22]  Gilles Brassard,et al.  An exact quantum polynomial-time algorithm for Simon's problem , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[23]  David A. Meyer,et al.  Quantum Algorithms for Highly Structured Search Problems , 2002, Quantum Inf. Process..

[24]  Mathieu Roget,et al.  The Grover search as a naturally occurring phenomenon , 2019, Physical review letters.

[25]  Yang Liu,et al.  An Exact Quantum Search Algorithm with Arbitrary Database , 2014 .

[26]  Isaac L. Chuang,et al.  Quantum Computation and Quantum Information (10th Anniversary edition) , 2011 .

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

[28]  Lvzhou Li,et al.  A query-based quantum eigensolver , 2020, Quantum Eng..

[29]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[30]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.