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
This book is an introduction to quantum computing from the perspective of a classical programmer. Most concepts are explained with code, based on the insight that much of the complicated-looking math typically found in quantum computing may look quite simple in code. For many programmers, reading code is faster than reading complex math notation. Coding also allows experimentation, which helps with building intuition and understanding of the fundamental mechanisms of quantum computing.
This introductory chapter details the methodology used in this book and provides an overview of the major chapters. It suggests two alternative paths through the text, one with a focus on algorithms, the other focusing on infrastructure and simulation.
- Type
- Chapter
- Information
- Quantum Computing for Programmers , pp. xi - xivPublisher: Cambridge University PressPrint publication year: 2022