Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Introduction
- 2 Basics of Model Checking
- 3 Basics of Quantum Theory
- 4 Model Checking Quantum Automata
- 5 Model Checking Quantum Markov Chains
- 6 Model Checking Super-Operator-Valued Markov Chains
- 7 Conclusions and Prospects
- Appendix 1 Proofs of Technical Lemmas in Chapter 4
- Appendix 2 Proofs of Technical Lemmas in Chapter 5
- Appendix 3 Proofs of Technical Lemmas in Chapter 6
- References
- Index
4 - Model Checking Quantum Automata
Published online by Cambridge University Press: 14 January 2021
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Introduction
- 2 Basics of Model Checking
- 3 Basics of Quantum Theory
- 4 Model Checking Quantum Automata
- 5 Model Checking Quantum Markov Chains
- 6 Model Checking Super-Operator-Valued Markov Chains
- 7 Conclusions and Prospects
- Appendix 1 Proofs of Technical Lemmas in Chapter 4
- Appendix 2 Proofs of Technical Lemmas in Chapter 5
- Appendix 3 Proofs of Technical Lemmas in Chapter 6
- References
- Index
Summary
Quantum systems are modelled as different mathematical structures, depending on their nature and complexity. This chapter considers one of the simplest (discrete-time) models of quantum systems, namely quantum automata. It introduces a way of describing linear-time (dynamic) properties of quantum systems and presents several algorithms for checking certain linear-time properties of quantum automata, for example, invariants andreachability.
Keywords
- Type
- Chapter
- Information
- Model Checking Quantum SystemsPrinciples and Algorithms, pp. 50 - 86Publisher: Cambridge University PressPrint publication year: 2021