Quantum Computing

1. Front Matter

   Pages I-XIII

   PDF

2. Introduction

   • Mika Hirvensalo

   Pages 1-11

3. Quantum Information

   • Mika Hirvensalo

   Pages 13-28

4. Devices for Computation

   • Mika Hirvensalo

   Pages 29-47

5. Fast Factorization

   • Mika Hirvensalo

   Pages 49-71

6. Finding the Hidden Subgroup

   • Mika Hirvensalo

   Pages 73-81

7. Grover’s Search Algorithm

   • Mika Hirvensalo

   Pages 83-100

8. Complexity Lower Bounds for Quantum Circuits

   • Mika Hirvensalo

   Pages 101-112

9. Appendix A: Quantum Physics

   • Mika Hirvensalo

   Pages 113-166

10. Appendix B: Mathematical Background

    • Mika Hirvensalo

    Pages 167-204

11. Back Matter

    Pages 205-215

    PDF

After the first edition of this book was published, I received much positive feedback from the readers. It was very helpful to have all those comments sug­ gesting improvements and corrections. In many cases, it was suggested that more aspects on quantum information would be welcome. Unfortunately, I am afraid that an attempt to cover such a broad area as quantum informa­ tion theory would make this book too scattered to be helpful for educational purposes. On the other hand, ladmit that some aspects of quantum information should be discussed. The first edition already contained the so-called No­ Cloning Theorem. In this edition, I have added a stronger version of the aforementioned theorem due to R. Jozsa, a variant which also covers the no-deleting principle. Moreover, in this edition, I have added some famous protocols, such as quantum teleportation. The response to the first edition strongly supports the idea that the main function of this book should be educational, and I have not included furt her aspects of quantum information theory here. For further reading, I suggest [43] by Josef Gruska and [62] by Michael A. Nielsen and Isaac L. Chuang. Chapter 1, especially Section 1.4, includes the most basic knowledge for the presentation of quantum systems relevant to quantum computation. The basic properties of quantum information are introduced in Chapter 2. This chapter also includes interesting protocols: quantum teleportation and superdense coding.

• Algorithmen
• Computer
• Probabilistik
• Quantum Computing
• Quantum computation
• Wahrscheinlichkeitsrechnung
• algorithms
• complexity
• computer science
• probabilistic computation
• theoretical computer science
• algorithm analysis and problem complexity

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

  Mika Hirvensalo

Policies and ethics