Skip to main content

Improved Simulation of Quantum Random Walks

  • Conference paper
Book cover Computer and Information Sciences - ISCIS 2005 (ISCIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3733))

Included in the following conference series:

  • 2615 Accesses

Abstract

We present an optimized version of the quantum random walk simulation algorithm. Our approach can be generalized to optimize any quantum simulation in which the linear combination rule is used to simulate a collection of constituent Hamiltonians. The method involves manipulation of the order in which the constituent Hamiltonians are simulated for small durations in the iterative step of the simulation algorithm. An analysis to illustrate the benefits of the new approach in oracle-based simulations is also given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Childs, A., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.: Exponential algorithmic speedup by a quantum walk. In: Proceedings of STOC 2003, pp. 59–68 (2003)

    Google Scholar 

  2. Feynman, R.P.: Simulating physics with computers. International Journal of Theoretical Physics 21, 467–488 (1982)

    Article  MathSciNet  Google Scholar 

  3. Grassmann, W.K.: Computational Probability. Kluwer Academic Publishers, Dordrecht (2000)

    MATH  Google Scholar 

  4. Lloyd, S.: Universal quantum simulators. Science 273, 1073–1078 (1996)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing 26(5), 1484–1509 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Küçük, U., Say, A.C.C. (2005). Improved Simulation of Quantum Random Walks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_95

Download citation

  • DOI: https://doi.org/10.1007/11569596_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29414-6

  • Online ISBN: 978-3-540-32085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics