Abstract
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in some subsets of S. In particular when k=2, we show a tight bound of the quantum query complexity for the Claw Finding problem, improving previous upper and lower bounds by Buhrman, Durr, Heiligman, Hoyer, Magniez, Santha and de Wolf [7].
We also consider the distributed scenario, where two parties each holds an n-element set, and they want to decide whether the two sets share a common element. We show a family of protocols s.t.q(P)3/2 . c(P)= O(n 2log n), where q(P) and c(P) are the number of quantum queries and the number of communication qubits that the protocol P makes, respectively. This implies that we can pay more for quantum queries to save on quantum communication, and vice versa. To our knowledge, it is the first result about the tradeoff between the two resources.
This research was supported in part by NSF grant CCR-0310466.
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., Ambainis, A.: Quantum search of spatial regions. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 200–209 (2003); Earlier version at quant-ph/0303041
Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM 51(4), 595–605 (2004)
Ambainis, A.: Quantum lower bounds for collision and element distinctness with small range. Theory of Computing 1(3) (2005); Earlier version at quant-ph/0305179
Ambainis, A.: Quantum query algorithms and lower bounds. In: Proceedings of FOTFS III (to appear)
Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 22–31 (2004); Earlier version at quant-ph/0311001
Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 63–68 (1998)
Buhrman, H., Durr, C., Heiligman, M., Hoyer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for Element Distinctness. In: Proceedings of Sixteenth IEEE conference on Computational Complexity, pp. 131–137 (2001); Journal version to appear in SIAM Journal of Computing
Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288(1), 21–43 (2002)
Childs, A., Eisenberg, J.: Quantum algorithms for subset finding. quantph/ 0311038
de Wolf, R.: Quantum communication and complexity. Theoretical Computer Science 287(1), 337–353 (2002)
Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996)
Hoyer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Hoyer, P.,, R. (eds.) Proceedings of the 19th Symposium on Theoretical Aspects of Computer Science, pp. 299–310 (2002); Earlier version at quant-ph/0109068
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the Triangle problem. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1109–1117 (2005); Earlier versions at quant-ph/0310107 and quant-ph/0310134
Jain, R., Radhakrishnan, J., Sen, P.: A lower bound for bounded round quantum communication complexity of set disjointness. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 220–229 (2003)
Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics 67(1), 145–159 (2003)
Yao, A.: Quantum circuit complexity. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 352–361 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, S. (2005). Promised and Distributed Quantum Search. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_44
Download citation
DOI: https://doi.org/10.1007/11533719_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)