Abstract
We present quantum query and time complexity bounds for group testing problems. For a set S and a binary operation on S, we consider the decision problem whether a groupoid, semigroup or quasigroup is a group. Our quantum algorithms for these problems improve the best known classical complexity bounds. We also present upper and lower bounds for testing associativity, distributivity and commutativity.
Supported by DFG grants Scho 302/7-2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ambainis, A.: Quantum Lower Bounds by Quantum Arguments. Journal of Computer and System Sciences 64, 750–767 (2002)
Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of FOCS 2004, pp. 22–31 (2004)
Ambainis, A., Špalek, R.: Quantum Algorithms for Matching and Network Flows. In: Proceedings of STACS 2006, pp. 172–183 (2006)
Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of ACM 48, 778–797 (2001)
Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4-5), 493–505 (1998)
Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum Algorithms for Element Distinctness. In: Proceedings of CCC 2001, pp. 131–137 (2001)
Brassard, G., Hóyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. AMS Contemporary Mathematics 305, 53–74 (2002)
Brassard, G., Hóyer, P., Tapp, A.: Quantum Cryptanalysis of Hash and Claw-Free Functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163–169. Springer, Heidelberg (1998)
Buhrman, H., Špalek, R.: Quantum Verification of Matrix Products. In: Proceedings of SODA 2006, pp. 880–889 (2006)
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. In: Proceedings of the Royal Society of London, Series A, pp. 339–354 (1998)
Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups. American Mathematical Society (1961)
Dörn, S.: Quantum Complexity Bounds of Independent Set Problems. In: Proceedings of SOFSEM 2007 (SRF), pp. 25–36 (2007)
Dörn, S.: Quantum Algorithms for Graph Traversals and Related Problems. In: Proceedings of CIE 2007, pp. 123–131 (2007)
Dörn, S., Thierauf, T.: The Quantum Query Complexity of Algebraic Properties. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 250–260. Springer, Heidelberg (2007)
Dürr, C., Heiligman, M., Høyer, P., Mhalla, M.: Quantum query complexity of some graph problems. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 481–493. Springer, Heidelberg (2004)
Grover, L.: A fast mechanical algorithm for database search. In: Proceedings of STOC 1996, pp. 212–219 (1996)
Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1312–1324. Springer, Heidelberg (2005)
Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via Quantum Walk. In: Proceedings of STOC 2007, pp. 575–584 (2007)
Magniez, F., Santha, M., Szegedy, M.: Quantum Algorithms for the Triangle Problem. In: Proceedings of SODA 2005, pp. 1109–1117 (2005)
Rajagopalan, S., Schulman, L.J.: Verification of identities. SIAM J. Computing 29(4), 1155–1163 (2000)
Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of FOCS 1994, pp. 124–134 (1994)
Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of FOCS 2004, pp. 32–41 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dörn, S., Thierauf, T. (2008). The Quantum Complexity of Group Testing. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-77566-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77565-2
Online ISBN: 978-3-540-77566-9
eBook Packages: Computer ScienceComputer Science (R0)