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
8 - Quantum Languages, Compilers, and Tools
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
At this point, we understand the principles of quantum computing, the important foundational algorithms, and the basics of quantum error correction. We have developed a compact infrastructure for exploration and experimentation, but it is at the gate level.
Higher levels of abstraction are needed to scale to much larger programs. The chapter discusses several quantum programming languages, including their specific tooling, such as hierarchical program representations or entanglement analysis. General challenges for compilation are discussed, as well as compiler optimization techniques.
The chapter finishes with transpilation, a powerful compilation-based technique. It allows seamless porting of circuits to other frameworks, enabling the use of their advanced error models or distributed simulation capabilities. The underlying (simple) compiler technology would further enable implementation of several of the features found in programming languages, such as automatic uncomputation, entanglement analysis, and conditional blocks.
- Type
- Chapter
- Information
- Quantum Computing for Programmers , pp. 292 - 321Publisher: Cambridge University PressPrint publication year: 2022