Skip to main content

On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer

  • Conference paper

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

Abstract

The role played by parallelism in the theory of computation depends on the particular paradigm or computational environment considered, but its importance has been confirmed with the emergence of each novel computing technology. In this paper we study the implications of parallelism in quantum information theory and show that a parallel approach can make the difference between success and failure when trying to distinguish among (entangled) quantum states. A (perhaps surprising) consequence of this fact is the impossibility of constructing a Universal Computer, as defined herein.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G.: Coping with uncertainty and stress: A parallel computation approach. to appear in International Journal of High Performance Computing and Networking

    Google Scholar 

  2. Akl, S.G.: Discrete steepest descent in real time. Parallel and Distributed Computing Practices 4(3), 301–317 (2001)

    MathSciNet  Google Scholar 

  3. Akl, S.G.: Inherently parallel geometric problems. Technical Report 2004–480, School of Computing, Queen’s University, Kingston, Ontario, 19 pages (April 2004)

    Google Scholar 

  4. Akl, S.G.: Superlinear performance in real-time parallel computation. The Journal of Supercomputing 29(1), 89–111 (2004)

    Article  MATH  Google Scholar 

  5. Akl, S.G.: The myth of universal computation. In: Trobec, R., Zinterhof, P., Vajteršic, M., Uhl, A. (eds.) Parallel Numerics, Part 2, Systems and Simulation, pp. 211–236. University of Salzburg, Austria, and Jožef Stefan Institute, Ljubljana (2005)

    Google Scholar 

  6. Akl, S.G., Cordy, B., Yao, W.: An analysis of the effect of parallelism in the control of dynamical systems. to appear in the International Journal of Parallel, Emergent and Distributed Systems

    Google Scholar 

  7. Akl, S.G., Yao, W.: Parallel computation and measurement uncertainty in nonlinear dynamical systems. Journal of Mathematical Modelling and Algorithms, Special Issue on Parallel and Scientific Computations with Applications 4, 5–15 (2005)

    MATH  MathSciNet  Google Scholar 

  8. Bell, J.: On the Einstein-Podolsky-Rosen paradox. Physics 1, 195–200 (1964)

    Google Scholar 

  9. Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters 69(20), 2881–2884 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dirac, P.: The Principles of Quantum Mechanics, 4th edn. Oxford University Press, Oxford (1958)

    MATH  Google Scholar 

  11. Einstein, A., Podolsky, B., Rosen, N.: Can quantum-mechanical description of physical reality be considered complete? Physical Review 47, 777–780 (1935)

    Article  MATH  Google Scholar 

  12. Mattle, K., Weinfurter, H., Kwiat, P.G., Zeilinger, A.: Dense coding in experimental quantum communication. Physical Review Letters 76(25), 4656–4659 (1996)

    Article  Google Scholar 

  13. Nagy, M., Akl, S.G.: Real-time minimum vertex cover for two-terminal series-parallel graphs. In: Proceedings of the Thirteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Anaheim, California, pp. 526–534 (August 2001)

    Google Scholar 

  14. Nagy, M., Akl, S.G.: Locating the median of a tree in real time. In: Proceedings of the Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Cambridge, Massachusetts, pp. 108–113 (November 2002)

    Google Scholar 

  15. Nagy, M., Akl, S.G.: Computing nearest neighbors in real time. In: Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, Marina Del Rey, California, vol. II, pp. 518–524 ( November 2003)

    Google Scholar 

  16. Nagy, N., Akl, S.G.: The maximum flow problem: A real-time approach. Parallel Computing 29, 767–794 (2003)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  18. Schrödinger, E.: Discussion of probability relations between separated systems. Proceedings of the Cambridge Philosophical Society 31, 555–563 (1935)

    Article  Google Scholar 

  19. Weisstein, E.W., et al.: Bloch sphere. From MathW orld–A Wolfram Web Resource, http://mathworld.wolfram.com/BlochSphere.html.

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

Nagy, M., Akl, S.G. (2005). On the Importance of Parallelism for Quantum Computation and the Concept of a Universal Computer. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_17

Download citation

  • DOI: https://doi.org/10.1007/11560319_17

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32022-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics