This book is concerned with the models of quantum computation. Information processing based on the rules of quantum mechanics provides us with new opportunities for developing more efficient algorithms and protocols. However, to harness the power offered by quantum information processing it is essential to control the behavior of quantum mechanical objects in a precise manner. As this seems to be conceptually difficult at the level of quantum states and unitary gates, high-level quantum programming languages have been proposed for this purpose.
The aim of this book is to provide an introduction to abstract models of computation used in quantum information theory. Starting from the abstract models of Turing machine and finite automata, we introduce the models of Boolean circuits and Random Access Machine and use them to present quantum programming techniques and quantum programming languages.
Table of Contents
Quantum Finite State Automata
Random Access Machines
Quantum Programming Environment
Quantum Programming Languages
Imperative quantum programming
Functional Quantum Programming
About the Author(s)Jaroslaw Miszczak
, Institute of Theoretical and Applied Informatics, Polish Academy of Sciences
Dr. Jaroslaw Adam Miszczak is a researcher at the Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences in Gliwice, Poland. He obtained his Master's degree with specialization in theoretical physics from University of Silesia in Katowice, Poland, in 2005 and Ph.D. degree in Computer Science from the Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences, Gliwice, Poland, in July 2008. His research interests include quantum information theory, foundations of quantum mechanics, scientific computing, and theory of programming languages.