Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Quantum Query Complexity for Some Graph Problems

  • Conference paper
SOFSEM 2004: Theory and Practice of Computer Science (SOFSEM 2004)

Part of the book series: Lecture Notes in Computer Science ((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.

Research supported by Grant No.01.0354 from the Latvian Council of Science

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ambainis, A.: Quantum Lower Bounds by Quantum Arguments. Journal of Computer and System Sciences 64, 750–767 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ambainis, A.: Personal communication (2003)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  4. Buhrman, H., de Wolf, R.: Complexity Measures and Decision Tree Complexity: A Survey. Theoretical Computer Science 288(1), 21–43 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Gruska, J.: Quantum Computing. McGraw-Hill, New York (1999)

    Google Scholar 

  8. Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000a)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia

    Aija Berzina, Andrej Dubrovsky, Rusins Freivalds, Lelde Lace & Oksana Scegulnaja

Authors
  1. Aija Berzina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrej Dubrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rusins Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lelde Lace
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Oksana Scegulnaja
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, ILLC - Department of Mathematics and Computer Science, University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Peter Van Emde Boas

  2. Faculty of Mathematics and Physics, Charles University, Prague

    Jaroslav Pokorný

  3. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava

    Mária Bieliková

  4. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague 8 Czech Republic

    Július Štuller

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O. (2004). Quantum Query Complexity for Some Graph Problems. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2004: Theory and Practice of Computer Science. SOFSEM 2004. Lecture Notes in Computer Science, vol 2932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24618-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24618-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20779-5

  • Online ISBN: 978-3-540-24618-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation