Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

  • Stacey Jeffery
  • Robin Kothari
  • Frédéric Magniez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7391)

Abstract

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, ℓ. We prove an upper bound of \(\widetilde{\mathrm{O}}(n\sqrt{\ell})\) for all values of ℓ. This is an improvement over previous algorithms for all values of ℓ. On the other hand, we show that for any ε < 1 and any ℓ ≤ εn 2, there is an \(\Omega(n\sqrt{\ell})\) lower bound for this problem, showing that our algorithm is essentially tight.

We first reduce Boolean matrix multiplication to several instances of graph collision. We then provide an algorithm that takes advantage of the fact that the underlying graph in all of our instances is very dense to find all graph collisions efficiently.

Keywords

Quantum Algorithm Query Complexity Complete Bipartite Graph Quantum Walk Boolean Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Amb04]
    Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 22–31 (2004)Google Scholar
  2. [BBBV97]
    Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing (Special Issue on Quantum Computing) 26, 1510–1523 (1997), arXiv:quant-ph/9701001v1Google Scholar
  3. [BBC+01]
    Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48 (2001)Google Scholar
  4. [BBHT98]
    Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4-5), 493–505 (1998)CrossRefGoogle Scholar
  5. [Bel11]
    Belovs, A.: Span programs for functions with constant-sized 1-certificates. Technical Report arXiv:1105.4024, arXiv (2011)Google Scholar
  6. [BŠ06]
    Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proceedings of the 17th ACM-SIAM Symposium On Discrete Algorithms, pp. 880–889 (2006)Google Scholar
  7. [CKK11]
    Childs, A., Kimmel, S., Kothari, R.: The quantum query complexity of read-many formulas. Technical Report arXiv:1112.0548v1, arXiv (2011)Google Scholar
  8. [DH96]
    Dürr, C., Høyer, P.: A quantum algorithm for finding the minimum. Technical Report arXiv:quant-ph/9607014v2, arXiv (1996)Google Scholar
  9. [DHHM06]
    Dürr, C., Heiligman, M., Høyer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM Journal on Computing 35(6), 1310–1328 (2006)MathSciNetMATHCrossRefGoogle Scholar
  10. [Gal12a]
    Le Gall, F.: Improved output-sensitive quantum algorithms for Boolean matrix multiplication. In: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms, pp. 1464–1476 (2012)Google Scholar
  11. [Gal12b]
    Le Gall, F.: Improved time-efficient output-sensitive quantum algorithms for Boolean matrix multiplication, arXiv:1201.6174 (2012)Google Scholar
  12. [Gro96]
    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 212–219 (1996)Google Scholar
  13. [Lin09]
    Lingas, A.: A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 408–419. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. [MSS07]
    Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM Journal on Computing 37(2), 413–424 (2007)MathSciNetMATHCrossRefGoogle Scholar
  15. [Sho97]
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26, 1484–1509 (1997)MathSciNetMATHCrossRefGoogle Scholar
  16. [VW10]
    Vassilevska Williams, V., Williams, R.: Sub-cubic equivalences between path, matrix and triangle problems. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science, pp. 645–654 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Stacey Jeffery
    • 1
    • 2
  • Robin Kothari
    • 1
    • 2
  • Frédéric Magniez
    • 3
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooCanada
  2. 2.Institute for Quantum ComputingUniversity of WaterlooCanada
  3. 3.LIAFAUniv. Paris Diderot, CNRSParisFrance

Personalised recommendations