Skip to main content
SpringerLink
Log in
Book cover

Formal Languages and Applications pp 493–505Cite as

Dialogues on Quantum Computing

  • Chapter

  • 567 Accesses

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

Summary

What sort of machines do useful computation in a universe described by classical mechanics? The answer was provided in 1936 by the British mathematician Alan Turing, and it’s known today as the Turing machine. But even in 1936 classical mechanics was known to be false, and so one could have asked the question: What sort of machines do useful computation in a universe described by quantum mechanics? In a trivial sense, everything is a quantum computer. A pebble is a quantum computer for calculating the constant-position function; current computers exploit quantum effects (like electrons tunneling through barriers) to control computation and to be able to run fast. But quantum computing is much more than that.

This is a preview of subscription content, 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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

1. Books on quantum computing

  • M. Brooks (ed.). Quantum Computing and Communications, Springer-Verlag, Berlin, 1999.

    MATH  Google Scholar 

  • J. Gruska. Quantum Computing, McGraw-Hill, London, 1999.

    Google Scholar 

  • M. Hirvensalo. Quantum Computing, Springer-Verlag, Berlin, 2001.

    MATH  Google Scholar 

  • A.Yu. Kitaev, A.H. Shen, M.N. Vylalyi. Classical and Quantum Computation, American Mathematical Society, Providence, Rhode-Island, 2002.

    Google Scholar 

  • M.A. Nielsen, I.L. Chuang. Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.

    Google Scholar 

  • C.P. Williams, S.H. Clearwater. Explorations in Quantum Computing, Springer-Verlag, New York, 1997.

    Google Scholar 

  • C.P. Williams, S.H. Clearwater. Ultimate Zero and One: Computing at the Quantum Frontier, Springer-Verlag, Heidelberg, 2000.

    Google Scholar 

2. Books containing chapters on quantum computing

  • C.S. Calude, Gh. Pâun. Computing with Cells and Atoms, Taylor liu Francis Publishers, London, 2001.

    MATH  Google Scholar 

  • J.G. Hey and R.W. Allen, (eds.). Feynman Lectures on Computation, Addison-Wesley, Reading, Massachusetts, 1996.

    Google Scholar 

  • J.G. Hey (ed.). Feynman and Computation. Exploring the Limits of Computers, Perseus Books, Reading, Massachusetts, 1999.

    MATH  Google Scholar 

  • K. Svozil. Randomness ê4 Undecidability in Physics, World Scientific, Singapore, 1993.

    Google Scholar 

3. Non-technical books on classical and quantum computing

  • J. Barrow. Impossibility - The Limits of Science and the Science of Limits, Oxford University Press, Oxford, 1998.

    Google Scholar 

  • D. Deutsch. The Fabric of Reality, Allen Lane, Penguin Press, 1997.

    Google Scholar 

  • G. Johnson. A Shortcut Through Time: The Path to a Quantum Computer, Alfred A. Knopf, New York, 2003.

    Google Scholar 

  • G. Milburn. The Feynman Processor. An Introduction to Quantum Computation, Allen liu Unwin, St. Leonards, 1998.

    Google Scholar 

  • T. Siegfried. The Bit and the Pendulum: How the New Physics of Information is Revolutionizing Science, John Wiley liu Sons, New York, 1999.

    Google Scholar 

4. Influential papers in quantum computing

  • A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margoluous, P.W. Schnor, T. Sleator, J.A. Smolin, H. Weinfurter. Elementary gates of quantum computation, Physical Review, A 52 (1995), 3457–3467.

    MathSciNet  Google Scholar 

  • C.H. Bennett. The thermodynamics of computation, International Journal of Theoretical Physics, 21 (1982), 905–940.

    Article  Google Scholar 

  • C.H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, W.K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett., 70 (1993), 1895–1898.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London, A 400 (1985), 97–119.

    Article  MathSciNet  MATH  Google Scholar 

  • D. Deutsch, Quantum computation, Physics World, 5 (1992), 57–61.

    MathSciNet  Google Scholar 

  • L.K. Grover. A fast quantum mechanical algorithm for database search, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996, 212–219.

    Google Scholar 

  • P.W. Shor. Algorithms for quantum computation: discrete log and factoring, Proceedings of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994, 124–134.

    Google Scholar 

5. Papers on automata and quantum computing

  • D. Finkelstein, S.R. Finkelstein, Computational complementarity, In- ternational Journal of Theoretical Physics, 22, 8 (1983), 753–779.

    Article  MathSciNet  MATH  Google Scholar 

  • C.S. Calude, E. Calude, K. Svozil. Quantum correlations conundrum: an automaton-theoretic approach, in C. Martin-Vide, Gh. Pun (eds.) Recent Topics in Mathematical and Computational Linguistics, The Publishing House of the Romanian Academy, Bucharest, 2000, 55–67.

    Google Scholar 

  • C.S. Calude, E. Calude, K. Svozil. Computational complementarity for probabilistic automata, in C. Martin-Vide, V. Mitrana (eds.). Where Mathematics, Computer Science, Linguistics and Biology Meet, Kluwer, Amsterdam, 2001, 99–113.

    Google Scholar 

  • C.S. Calude, E. Calude, K. Svozil, S. Yu. Physical versus computational complementarity I, International Journal of Theoretical Physics, 36, 7 (1997), 1495–1523.

    Article  MathSciNet  MATH  Google Scholar 

6. Papers challenging the Church-Turing Principle

  • V.A. Adamyan, C.S. Calude, B.S. Pavlov. Transcending the Limits of Turing Computability, Los Alamos preprint archive, http://www.quant.ph/ 0304128, 16 April 2003.

  • C.S. Calude, M J. Dinneen, K. Svozil. Reflections on quantum computing, Complexity, 6, 1 (2000), 35–37.

    Article  MathSciNet  Google Scholar 

  • C.S. Calude, B. Pavlov. Coins, quantum measurements, and Turing’s barrier, Quantum Information Processing, 1, 1–2 (2002), 107–127.

    Article  MathSciNet  Google Scholar 

  • J.-P. Delahaye. La barrière de Turing, Pour la Science, 312 October (2003), 90–95.

    Google Scholar 

  • G. Etesi, I. Németi. Non-Turing computations via Malament-Hogarth space-times, International Journal of Theoretical Physics 41 (2002), 341–370.

    Article  MathSciNet  MATH  Google Scholar 

  • T.D. Kieu. Quantum hypercomputation, Minds and Machines: Journal for Artificial Intelligence, Philosophy and Cognitive Science, 12, 4 (2002), 541–561.

    Google Scholar 

  • T.D. Kieu. Computing the noncomputable, Los Alamos preprint archive http://www.arXiv.quant-ph/0203034, vl, 7 March 2002.

  • H.T. Siegelmann. Computation beyond the Turing limit, Science, 268 (April 1995), 545–548.

    Article  Google Scholar 

  • K. Svozil. The Church-Turing Thesis as a guiding principle for physics, in C.S. Calude, J. Casti, M.J. Dinneen (eds.). Unconventional Models of Computation, Springer Verlag, Singapore, 1998, 371–385.

    Google Scholar 

  • K. Svozil. Computational universes. Chaos, Solitons Fractals,to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Cristian S. Calude

Authors
  1. Cristian S. Calude
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Lingustics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Institute of Mathematics, Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Calude, C.S. (2004). Dialogues on Quantum Computing. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation