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, the book discusses non-interactive proofs and the complexity class QMA, and single-prover quantum interactive proof systems and the complexity class QIP.
Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.
Genom att registrera dig accepterar du vår personuppgiftspolicy.