Quantum Computing

1. Front Matter

   Pages I-XI

   PDF

2. Introduction

   • Mika Hirvensalo

   Pages 1-11

3. Devices for Computation

   • Mika Hirvensalo

   Pages 13-39

4. Fast Factorization

   • Mika Hirvensalo

   Pages 41-62

5. Finding the Hidden Subgroup

   • Mika Hirvensalo

   Pages 63-71

6. Grover’s Search Algorithm

   • Mika Hirvensalo

   Pages 73-90

7. Complexity Lower Bounds for Quantum Circuits

   • Mika Hirvensalo

   Pages 91-102

8. Appendix A: Quantum Physics

   • Mika Hirvensalo

   Pages 103-144

9. Appendix B: Mathematical Background

   • Mika Hirvensalo

   Pages 145-181

10. Back Matter

    Pages 183-191

    PDF

The twentieth century witnessed the birth of revolutionary ideas in the phys­ ical sciences. These ideas began to shake the traditional view of the universe dating back to the days of Newton, even to the days of Galileo. Albert Ein­ stein is usually identified as the creator of the relativity theory, a theory that is used to model the behavior of the huge macrosystems of astronomy. An­ other new view of the physical world was supplied by quantum physics, which turned out to be successful in describing phenomena in the microworld, the behavior of particles of atomic size. Even though the first ideas of automatic information processing are quite old, I feel justified in saying that the twentieth century also witnessed the birth of computer science. As a mathematician, by the term "computer sci­ ence", I mean the more theoretical parts of this vast research area, such as the theory of formal languages, automata theory, complexity theory, and al­ gorithm design. I hope that readers who are used to a more flexible concept of "computer science" will forgive me. The idea of a computational device was crystallized into a mathematical form as a Turing machine by Alan Turing in the 1930s. Since then, the growth of computer science has been immense, but many problems in newer areas such as complexity theory are still waiting for a solution.

• Algorithmen
• Probabilistik
• Quantum Computing
• Quantum computation
• Turing machine
• Wahrscheinlichkeitsrechnung
• algorithms
• complexity
• complexity theory
• probabilistic computation
• algorithm analysis and problem complexity

• Department of Mathematics, University of Turku, Turku, Finland

  Mika Hirvensalo

Policies and ethics