Abstract
The set equality problem is to tell whether two sets A and B are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any ω(1) query lower bound when sets A and B are given by quantum oracles. We will show that any error-bounded quantum query algorithm that solves the set equality problem must evaluate oracles \(\Omega(\sqrt[5]{\frac{n}{\ln n}})\) times, where n=|A|=|B|.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaronson, S.: Quantum lower bound for the collision problem. In: Proceedings Proceedings of ACM STOC 2002, pp. 635–642 (2002), quant-ph/0111102
Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences 64, 750–767 (2002); Earlier versions at STOC 2000 and quant-ph/0002066
Ambainis, A.: Quantum query algorithms and lower bounds. In: Proceedings of FOTFS III (to appear)
Ambainis, A.: Quantum lower bounds for collision and element distinctness with small range (2003); quant-ph/0305179
Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of ACM 48, 778–797 (2001); Earlier version at FOCS 1998 (1998)
Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. To appear in AMS Contemporary Mathematics Series Millennium Volume entitled ”Quantum Computation & Information”
Grover, L.K.: A fast quantum mechanical algorithm for database search. Journal of ACM 2, 212–219 (1996)
Gruska, J.: Quantum computing. McGraw-Hill, New York (1999)
Hoyer, P., Neerbek, J., Shi, Y.: Quantum lower bounds of ordered searching, sorting and element distinctness. Algorithmica 34, 429–448 (2002); Earlier versions at ICALP’01 and quant-ph/0102078
Kutin, S.: Quantum lower bound for the collision problem (2003); quant-ph/0304162
Midrijanis, G.: Quantum lower bounds of set equality problems (2003); quantph/ 0309068
Shi, Y.: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Information Processing Letters 75, 79–83 (2000)
Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. In: Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, pp. 513–519 (2002)
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New, Mexico, November 20-22, pp. 124–134. IEEE Computer Society Press, Los Alamitos (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Midrijānis, G. (2004). A Polynomial Quantum Query Lower Bound for the Set Equality Problem. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive