Skip to main content
SpringerLink
Log in

Quantum Algorithms for Graph Connectivity

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 72 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Aleliunas R, Karp RM, Lipton RJ, Lovasz L, Rackoff C (1979) Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of 20th IEEE FOCS, San Juan, pp 218–223

    Google Scholar 

  2. Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42:844–856

    Article  MathSciNet  MATH  Google Scholar 

  3. Belovs A, Reichardt BW (2012) Span programs and quantum algorithms for st-connectivity and claw detection. In: Proceedings of 20th ESA, Ljubljana. LNCS, vol 7501, pp 193–204

    Google Scholar 

  4. Borůvka O (1926) O jistém problému minimálním (About a certain minimal problem). Práce mor Přírodověd spol v Brně (Acta Societ Scient Natur Moravicae) 3:37–58 (In Czech)

    Google Scholar 

  5. Dürr C, Heiligman M, Høyer P, Mhalla M (2004) Quantum query complexity of some graph problems. In: Proceedings of 31st ICALP, Turku. LNCS, vol 3142, pp 481–493. Springer

    Google Scholar 

  6. Reichardt BW (2009) Span programs and quantum query complexity: the general adversary bound is nearly tight for every boolean function. arXiv:0904.2759

    Google Scholar 

  7. Reichardt BW (2011) Reflections for quantum query algorithms. In: Proceedings of 22nd ACM-SIAM SODA, San Francisco, pp 560–569

    Google Scholar 

  8. Reingold O (2008) Undirected connectivity in logspace. J ACM 55(4):17

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, USA

    Aleksandrs Belovs

Authors
  1. Aleksandrs Belovs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aleksandrs Belovs .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Belovs, A. (2016). Quantum Algorithms for Graph Connectivity. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_772

Download citation

Publish with us

Policies and ethics

Search

Navigation