Book contents
- Frontmatter
- Dedication
- Contents
- Acknowledgements
- Introduction
- 1 The Mathematical Minimum
- 2 Quantum Computing Fundamentals
- 3 Simple Algorithms
- 4 Scalable, Fast Simulation
- 5 Beyond Classical
- 6 Complex Algorithms
- 7 Quantum Error Correction
- 8 Quantum Languages, Compilers, and Tools
- Appendix Sparse Implementation
- References
- Index
- Frontmatter
- Dedication
- Contents
- Acknowledgements
- Introduction
- 1 The Mathematical Minimum
- 2 Quantum Computing Fundamentals
- 3 Simple Algorithms
- 4 Scalable, Fast Simulation
- 5 Beyond Classical
- 6 Complex Algorithms
- 7 Quantum Error Correction
- 8 Quantum Languages, Compilers, and Tools
- Appendix Sparse Implementation
- References
- Index
Summary
Armed with the knowledge and infrastructure from the previous chapters, the first set of quantum algorithms is introduced. The algorithms in this chapter are typically shorter and require less preparation than those in later chapters. Additionally, the mathematical derivations are developed with great detail.
The chapter starts with the simplest possible algorithm: a quantum random number generator. This is followed by several gate equivalences, a classical full adder implemented with quantum gates, and the Swap Test to measure similarity between states. Two algorithms that utilize entanglement come next: quantum teleportation and superdense coding. After this, three so-called oracle algorithms are discussed,the Bernstein–Vazirani algorithm, Deutsch’s algorithm, and Deutsch–Jozsa’s algorithm. These are the first quantum algorithms that perform better than their classical counterparts. Oracle construction itself is discussed at great length.
- Type
- Chapter
- Information
- Quantum Computing for Programmers , pp. 78 - 121Publisher: Cambridge University PressPrint publication year: 2022