An optimal quantum algorithm for the oracle identification problem

In the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set C of size M and our task is to identify x. We present a quantum algorithm for the problem that is optimal in its dependence on N and M. Our algorithm considerably simplifies and improves the previous best algorithm due to Ambainis et al. Our algorithm also has applications in quantum learning theory, where it improves the complexity of exact learning with membership queries, resolving a conjecture of Hunziker et al. The algorithm is based on ideas from classical learning theory and a new composition theorem for solutions of the filtered gamma_2-norm semidefinite program, which characterizes quantum query complexity. Our composition theorem is quite general and allows us to compose quantum algorithms with input-dependent query complexities without incurring a logarithmic overhead for error reduction. As an application of the composition theorem, we remove all log factors from the best known quantum algorithm for Boolean matrix multiplication.

[1]  Stacey Jeffery,et al.  Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision , 2015, Algorithmica.

[2]  Wolfgang Maass.  Proceedings of the eighth annual conference on Computational learning theory , 1995, COLT 1995.

[3]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[4]  Mehdi Mhalla,et al.  Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..

[5]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

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

[7]  Andris Ambainis,et al.  Improved algorithms for quantum identification of Boolean oracles , 2006, Theor. Comput. Sci..

[8]  Wim van Dam,et al.  Quantum Oracle Interrogation: Getting All Information for Almost Half the Price , 1999 .

[9]  Rocco A. Servedio,et al.  Equivalences and Separations Between Quantum and Classical Learnability , 2004, SIAM J. Comput..

[10]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[11]  MagniezFrédéric,et al.  Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision , 2016 .

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

[13]  Maris Ozols,et al.  Easy and hard functions for the Boolean hidden shift problem , 2013, TQC.

[14]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[15]  Jihun Park,et al.  The geometry of quantum learning , 2010, Quantum Inf. Process..

[16]  Andris Ambainis,et al.  Quantum Identification of Boolean Oracles , 2004, STACS.

[17]  Mark Zhandry,et al.  Quantum-Secure Message Authentication Codes , 2013, IACR Cryptol. ePrint Arch..

[18]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[19]  Troy Lee,et al.  Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[20]  Rocco A. Servedio,et al.  Improved Bounds on Quantum Learning Algorithms , 2004, Quantum Inf. Process..

[21]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[22]  Tibor Hegedűs,et al.  Generalized teaching dimensions and the query complexity of learning , 1995, Annual Conference Computational Learning Theory.

[23]  Sean Hallgren,et al.  Quantum algorithms for some hidden shift problems , 2003, SODA '03.

[24]  Andris Ambainis,et al.  Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size , 2009, ArXiv.