Advertisement

Quantum Query Complexity for Some Graph Problems

  • Aija Berzina
  • Andrej Dubrovsky
  • Rusins Freivalds
  • Lelde Lace
  • Oksana Scegulnaja
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2932)

Abstract

The paper [4] by H. Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis’ technique for these problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambainis, A.: Quantum Lower Bounds by Quantum Arguments. Journal of Computer and System Sciences 64, 750–767 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ambainis, A.: Personal communication (2003)Google Scholar
  3. 3.
    Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.V.: Strengths and Weaknesses of Quantum Computing. SIAM Journal on Computing 26, 1510–1523 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Buhrman, H., de Wolf, R.: Complexity Measures and Decision Tree Complexity: A Survey. Theoretical Computer Science 288(1), 21–43 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Freivalds, R., Winter, A.: Quantum Finite State Transducers. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, pp. 233–242. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Grover, L.: 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
  7. 7.
    Gruska, J.: Quantum Computing. McGraw-Hill, New York (1999)Google Scholar
  8. 8.
    Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000a)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Aija Berzina
    • 1
  • Andrej Dubrovsky
    • 1
  • Rusins Freivalds
    • 1
  • Lelde Lace
    • 1
  • Oksana Scegulnaja
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia

Personalised recommendations