60 страниц. 2010 год. LAP Lambert Academic Publishing Over the last few decades, the limitations of classical computing demand for a new way of computation. One such limit can be found in classical interactive proof systems. Quantum computing sounds promising enough in overcoming those limits. Although there are many great books on this subject, a short introduction to quantum interactive proof systems which gives the reader an intuition of the subject was lacking. This book, therefore, provides such an intuition by firstly introducing the basic concepts and secondly by defining some of the quantum computational classes based on their classical counterparts. At the end a quantum oracle separation of QMA and QCMA is presented which helps the reader in better understanding of differences between quantum and classical interactive proof systems.