Skip to main content

Toward Quantum Computational Agents

  • Conference paper
Book cover Agents and Computational Autonomy (AUTONOMY 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2969))

Included in the following conference series:

Abstract

In this chapter, we provide some first thoughts on, and preliminary answers to the question how intelligent software agents could take most advantage of the potential of quantum computation and communication, once practical quantum computers become available in foreseeable future. In particular, we discuss the question whether the adoption of quantum computational and communication means will affect the autonomy of individual and systems of agents. We show that the ability of quantum computing agents to perform certain computational tasks more efficient than classically computing agents is at the cost of limited self-autonomy, due to non-local effects of quantum entanglement.

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. Aharonov, D.: Quantum Computation. LANL Archive quant-ph/981203 (1998)

    Google Scholar 

  2. Aharonov, D., Ben-Or, M.: Polynomial Simulations of Decohered Quantum Computers. In: Proc. 37th Ann. Symp. Foundations of Computer Science, FOCS (1996)

    Google Scholar 

  3. Bell, J.S.: Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press, Cambridge (1987)

    Google Scholar 

  4. Bennett, C.H.: Time/Space Trade-offs for Reversible Computation. SIAM Journal of Computing 18(4), 766–776 (1989)

    Article  MATH  Google Scholar 

  5. Bennett, C.H., Brassard, G.: Quantum Cryptography: Public Key Distribution and Coin Tossing. In: Proc. IEEE Intl. Conference on Computers, Systems, and Signal Processing, pp. 175–179 (1984)

    Google Scholar 

  6. Bennett, C.H., DiVincenzo, D.P.: Quantum Information and Computation. Nature 404(6775), 247–254 (2000)

    Article  Google Scholar 

  7. Bennett, C.H., Brassard, G., Crepau, C., Josza, R., Peres, A., Wootters, W.K.: Phys. Reviews Letters 70, 1895 (1993)

    Google Scholar 

  8. Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on EPR states. Phys. Review Letters 69(20) (1992)

    Google Scholar 

  9. Betteli, S., Calarco, T., Serafini, L.: Toward an Architecture for Quantum Programming. LANL Archive cs.PL/0103009 (March 2003)

    Google Scholar 

  10. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal of Computing 26(5), 1411–1473 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Biham, E., Brassard, G., Kenigsberg, D., Mor, T.: Quantum Computing Without Entanglement. LANL Archive quant-ph/0306182 (2003)

    Google Scholar 

  12. Bouwmeester, D., Ekert, A., Zeilinger, A.: The Physics of Quantum Information. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  13. Brassard, G., Chuang, I., Lloyd, S., Monroe, C.: Quantum Computing. Proc. National Academy of Sciences, USA 95, 11032–11033 (1998)

    Article  MathSciNet  Google Scholar 

  14. Brennen, G.K., Song, D., Williams, C.J.: A Quantum Computer Architecture using Nonlocal Interactions. LANL Archive quant-ph/0301012 (2003)

    Google Scholar 

  15. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. Classical Communication and Computation. In: Proc. 30th Ann. ACM Symp. Theory of Computing, STOC 1998 (1998)

    Google Scholar 

  16. Carabelea, C., Boissier, O., Florea, A.: Autonomy in Multi-agent Systems: A classification Attempt. In: Rovatso, M., Nickles, M. (eds.) Proc. Intl. Autonomous Agents and Multiagent Systems Conference Workshop on Computational Autonomy, Melbourne, Australia (2003)

    Google Scholar 

  17. Davies, P.C.W., Brown, J.R. (eds.): The Ghost in the Atom. Cambridge University Press, Cambridge (2000) (Canto edition reprint)

    Google Scholar 

  18. Deutsch, D.: Quantum Theory, the Church-Turing Principle, and the Universal Quantum Computer. Proc. Royal Society London A 400, 97 (1985)

    Google Scholar 

  19. DiVincenzo, D.P.: The Pysical Implementation of Quantum Computation. LANL archive quant-ph/0002077 (2000)

    Google Scholar 

  20. Einstein, A., Podolsky, B., Rosen, N.: Can quantum mechanical description of physics be considered complete? Phys. Review, 47, 777–780 (1935)

    Article  MATH  Google Scholar 

  21. Grover, L.: A Fast Quantum Mechanical Algorithm for Database Search. In: Proc. 28th Annual ACM Symposium on Theory of Computation, USA, pp. 212–219. ACM Press, New York (1996)

    Google Scholar 

  22. Gruska, J., Imai, H.: Power, puzzles and properties of entanglement. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, p. 25. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  23. Hirvensalo, M.: Quantum Computing. Natural Computing Series. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  24. Holevo, A.S.: Some estimates of the information transmitted by quantum communication channels. Problems of Information Transmission 9, 177–183 (1973)

    MathSciNet  Google Scholar 

  25. Josza, R.: Entanglement and Quantum Computation. In: Huggett, S., et al. (eds.) Geometric Issues in the foundations of Science. Oxford University Press, Oxford (1997)

    Google Scholar 

  26. Kalyanasundra, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5(4) (1992)

    Google Scholar 

  27. Kane, B.: A Silicon-Based Nuclear Spin Quantum Computer. Nature 393 (1998)

    Google Scholar 

  28. Knill, E., Laflamme, R., Zurek, W.H.: Resilient Quantum Computation. Science 279, 342–345 (1998)

    Article  Google Scholar 

  29. Klusch, M.: Information Agent Technology for the Internet: A Survey. Data and Knowledge Engineering 36(3) (2001)

    Google Scholar 

  30. Klusch, M., Sycara, K.: Brokering and Matchmaking for Coordination of Agent societies: A Survey. In: Omicini, A., et al. (eds.) Coordination of Internet Agents. Springer, Heidelberg (2001)

    Google Scholar 

  31. Kremer, I.: Quantum Communication. Master Thesis, Hebrew University, Jerusalem, Israel (1995)

    Google Scholar 

  32. Los Alamos National Lab Archive, USA: http://xxx.lanl.gov/archive/

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

    MATH  Google Scholar 

  34. Oemer, B.: Quantum Programming in QCL. Master Thesis, Technical University of Vienna, Computer Science Department, Vienna, Austria (2000)

    Google Scholar 

  35. Oskin, M., Chong, F.T., Chuang, I.L.: A Practical Architecture for Reliable Quantum Computers. IEEE Computer 35, 79–87 (January 2002)

    Google Scholar 

  36. Oskin, M., Chong, F.T., Chuang, I.L., Kubiatowicz, J.: Building Quantum Wires: The Long and the Short of it. In: Proc. 30th Intnl Symposium on Computer Architecture, ISCA (2003)

    Google Scholar 

  37. Ozawa, M.: Quantum Turing Machines: Local Transitions, Preparation, Measurement,and Halting Problem. LANL Archive quant-ph/9809038 (1998)

    Google Scholar 

  38. Penrose, R.: The Large, the Small, and the Human Mind. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  39. Pereira, A.: The Quantum Mind/Classical Brain Problem. NeuroQuantology,Neuroscience & Quantum Physics 1, 94–118 (2003)

    Google Scholar 

  40. Selinger, P.: Towards a Quantum Programming Language. Mathematical Structures in Computer Science (2003)

    Google Scholar 

  41. Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science, Los Alamitos, USA (1994)

    Google Scholar 

  42. Steane, A.: Quantum computing. LANL Archive quant-ph/9708022 (1997)

    Google Scholar 

  43. Steffen, M., Vandersypen, L.M.K., Chuang, I.L.: Toward Quantum Computation: A Five-Qubit Quantum Processor. IEEE Micro ( March/April 2001)

    Google Scholar 

  44. Sycara, K., Widoff, S., Klusch, M., Lu, J.: LARKS: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace. Autonomous Agents and Multi-Agent Systems 5(2) (2002)

    Google Scholar 

  45. Weiss, G.: Introduction to Multiagent Systems. MIT Press, Cambridge (1999)

    Google Scholar 

  46. Wooldridge, M.: An Introduction to Multiagent Systems, UK. John Wiley &Sons, Chichester (2002)

    Google Scholar 

  47. Wootters, W.K., Zurek, W.H.: A Single Quantum Cannot be Cloned. Nature 299, 802–803 (1982)

    Article  Google Scholar 

  48. Yao, A.C.-C.: Quantum Circuit Complexity. In: Proc. 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 352–361 (1993)

    Google Scholar 

  49. Zuliani, P.: Logical Reversibility. IBM Journal of Res. & Devel. 45 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klusch, M. (2004). Toward Quantum Computational Agents. In: Nickles, M., Rovatsos, M., Weiss, G. (eds) Agents and Computational Autonomy. AUTONOMY 2003. Lecture Notes in Computer Science(), vol 2969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25928-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25928-2_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22477-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics