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
2 - Quantum Computing Fundamentals
Published online by Cambridge University Press: 28 March 2022
- 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 chapter introduces the fundamental concepts and rules of quantum computing. In parallel, it develops an initial, easy-to-understand codebase in Python for building and simulating small-scale quantum circuits and algorithms.
The chapter details single qubits, superposition, quantum states with many qubits, operators, including a sizable set of important single-qubit gates and controlled gates. The Bloch sphere and the quantum circuit notation are introduced. Entanglement follows, that fascinating “spooky action at a distance,” as Einstein called it. With this background, the chapter discusses maximally entangled Bell states, the no-cloning theorem, the noneffect of global phases, the partial trace and reduced density matrix, and uncomputation. The quantum postulates are discussed in a nonphilosophical way, leading to measurement and how to simulate it.
- Type
- Chapter
- Information
- Quantum Computing for Programmers , pp. 9 - 77Publisher: Cambridge University PressPrint publication year: 2022