Skip to main content

Quantum Recurrent Networks for Simulating Stochastic Processes

  • Conference paper
  • First Online:
Quantum Computing and Quantum Communications (QCQC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1509))

Abstract

We introduce the concept of quantum recurrent networks by incorporating classical feedback loops into conventional quantum networks. We show that the dynamical evolution of such networks, which interleave quantum evolution with measurement and reset operations, exhibit novel dynamical properties finding application in pattern recognition, optimization and simulation. Moreover, decoherence in quantum recurrent networks is less problematic than in conventional quantum network architectures due to the modest phase coherence times needed for network operation.

Supported by the JPL Information and Computing Technologies Research Section.

Supported by the NASA/JPL Center for Integrated Space Microsystems and by the JPL Information and Computing Technologies Research Section.

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 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.

References

  1. G. Brassard & T. Mor, “Multi-particle Entanglement via 2-particle Entanglement„, in Proceedings of the First NASA International Conference on Quantum Computing & Quantum Communications, NASA QCQC’98, Lecture Notes in Computer Science, Springer-Verlag (1998).

    Google Scholar 

  2. A. M. Ferrenberg & D. P. Landau, “Monte Carlo Simulations: Hidden errors from “Good„ Random Number Generators„, Physical Review Letters, Vol. 69, Number 23, 7th December (1992) pp3382–3384.

    Article  Google Scholar 

  3. J. Hertz, A. Krogh & R. G. Palmer, “Introduction to the Theory of Neural Computation„, Lecture Notes Volume I, Santa Fe Institute, Studies in Sciences of Complexity, Addison-Wesley Publishing Company (1991).

    Google Scholar 

  4. E. Knill, “Approximation by Quantum Circuits „, Los Alamos preprint, http://xxx.lanl.gov/archive/quant-ph/9508006, (1995).

  5. S. C. Phatak & S. S. Rao, “Logistics Map: A Possible Random Number Generator„, Physical review E, Volume 51, Number 4, April (1995) pp.3670–3678.

    Article  Google Scholar 

  6. H. Tuckwell, “Elementary Applications of Probability Theory„, Second Edition, Chapman & Hall, Texts in Statistical Science (1995).

    Google Scholar 

  7. C. P. Williams & S. H. Clearwater, “Explorations in Quantum Computing„, TELOS/Springer-Verlag, book/CD-ROM, ISBN 0-387-94768-X (1997)

    Google Scholar 

  8. M. Zak & C. P. Williams, “Quantum Neural Nets„, International Journal of Theoretical Physics, Volume 37, Number 2, (1998) pp651–684.

    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

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zak, M., Williams, C.P. (1999). Quantum Recurrent Networks for Simulating Stochastic Processes. In: Williams, C.P. (eds) Quantum Computing and Quantum Communications. QCQC 1998. Lecture Notes in Computer Science, vol 1509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49208-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-49208-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49208-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics