Quantum Proofs provides an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define. In particular, it discusses non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive proof systems and the complexity class QSZK, and multiprover interactive proof systems and the complexity classes QMIP, QMIP*, and MIP*. This book is mainly intended for non-specialists having a basic background in complexity theory and quantum information. A typical reader may be a student or researcher in either area desiring to learn about the fundamentals of the (actively developing) theory of quantum interactive proofs.

This book offers an accessible and engaging introduction to quantum cryptography, assuming no prior knowledge in quantum computing. Essential background theory and mathematical techniques are introduced and applied in the analysis and design of quantum cryptographic protocols. The title explores several important applications such as quantum key distribution, quantum money, and delegated quantum computation, while also serving as a self-contained introduction to the field of quantum computing. With frequent illustrations and simple examples relevant to quantum cryptography, this title focuses on building intuition and challenges readers to understand the basis of cryptographic security. Frequent worked examples and mid-chapter exercises allow readers to extend their understanding, and in-text quizzes, end-of-chapter homework problems, and recommended further reading reinforce and broaden understanding. Online resources available to instructors include interactive computational problems in Julia, videos, lecture slides, and a fully worked solutions manual.