Skip to main content
SpringerLink
Log in

Quantum Algorithms for Matching Problems

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We present quantum algorithms for the following matching problems in unweighted and weighted graphs with n vertices and m edges:

  1. •

    Finding a maximal matching in general graphs in time \(O(\sqrt{nm}\log^{2}n)\) .

  2. •

    Finding a maximum matching in general graphs in time \(O(n\sqrt{m}\log^{2}n)\) .

  3. •

    Finding a maximum weight matching in bipartite graphs in time \(O(n\sqrt{m}N\log^{2}n)\) , where N is the largest edge weight.

Our quantum algorithms are faster than the best known classical deterministic algorithms for the corresponding problems. In particular, the second result solves an open question stated in a paper by Ambainis and Špalek (Proceedings of STACS’06, pp. 172–183, 2006).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ambainis, A.: Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci. 64, 750–767 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of FOCS’04, pp. 22–31 (2004)

  3. Ambainis, A., Špalek, R.: Quantum algorithms for matching and network flows. In: Proceedings of STACS’06, pp. 172–183 (2006)

  4. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. Assoc. Comput. Mach. 48, 778–797 (2001)

    MATH  Google Scholar 

  5. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4–5), 493–505 (1998)

    Article  Google Scholar 

  6. Buhrman, H., Cleve, R., de Wolf, R., Zalka, C.: Bounds for small-error and zero-error quantum algorithms. In: Proceedings of FOCS’99, pp. 358–368 (1999)

  7. Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O.: Quantum query complexity for some graph problems. In: Proceedings of SOFSEM’04, pp. 140–150 (2004)

  8. 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’01, pp. 131–137 (2001)

  9. Brassard, G., Hóyer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Proceedings of LATIN’98, pp. 163–169 (1998)

  10. Bondy, J., Murty, U.: Graph Theory with Applications. North-Holland, Amsterdam (1976)

    Google Scholar 

  11. Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proceedings of SODA’06, pp. 880–889 (2006)

  12. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, New York (1998)

    MATH  Google Scholar 

  13. Dürr, C., Heiligman, M., Hoyer, P., Mhalla, M.: Quantum query complexity of some graph problems. In: Proceedings of ICALP’04, pp. 481–493 (2004)

  14. Dörn, S.: Quantum complexity bounds of independent set problems. In: Proceedings of SOFSEM’07 (SRF), pp. 25–36 (2007)

  15. Dörn, S.: Quantum algorithms for graph traversals and related problems. In: Proceedings of CIE’07, pp. 123–131 (2007)

  16. Dörn, S., Thierauf, T.: The quantum query complexity of algebraic properties. In: Proceedings of FCT’07, pp. 250–260 (2007)

  17. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443 (1990)

  18. Grover, L.: A fast mechanical algorithm for database search. In: Proceedings of STOC’96, pp. 212–219 (1996)

  19. Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Comput. 18, 1013–1036 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  20. Gross, J., Yellen, J.: Graph Theory and its Applications. CRC Press, Boca Raton (1999)

    MATH  Google Scholar 

  21. Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kao, M.-Y., Lam, T.-W., Sung, W.-K., Ting, H.-F.: A decomposition theorem for maximum weight bipartite matchings. SIAM J. Comput. 31, 18–26 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. In: Proceedings of ICALP’05, pp. 1312–1324 (2005)

  24. Mucha, M., Sankowski, P.: Maximum matchings via Gaussian elimination. In: Proceedings of FOCS’04, pp. 248–255 (2004)

  25. Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. In: Proceedings of SODA’05, pp. 1109–1117 (2005)

  26. Micali, S., Vazirani, V.V.: An \(O(\sqrt{n}m)\) algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS’80, pp. 17–27 (1980)

  27. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  28. Zhang, S.: On the power of Ambainis’s lower bounds. In: Proceedings of ICALP’04. Lecture Notes in Computer Science, vol. 3142, pp. 1238–1250. Springer, Berlin (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik, Universität Ulm, 89069, Ulm, Germany

    Sebastian Dörn

Authors
  1. Sebastian Dörn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastian Dörn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dörn, S. Quantum Algorithms for Matching Problems. Theory Comput Syst 45, 613–628 (2009). https://doi.org/10.1007/s00224-008-9118-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-008-9118-x

Keywords

Search

Navigation