Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Line 22: | Line 22: | ||
#'''IP (interactive-proof system)''' is a generalization of MA, which involves back and forth communication between a verifier (a BPP machine) and prover (has unbounded computational power). | #'''IP (interactive-proof system)''' is a generalization of MA, which involves back and forth communication between a verifier (a BPP machine) and prover (has unbounded computational power). | ||
#Protocols 1.1, 1.2 are '''QPIP''' protocols and 2.1 is an MIP protocol. QPIP and MIP are classes of decision problems and can be decided by protocols 1.1, 1.2 and 2.1, respectively. | #Protocols 1.1, 1.2 are '''QPIP''' protocols and 2.1 is an MIP protocol. QPIP and MIP are classes of decision problems and can be decided by protocols 1.1, 1.2 and 2.1, respectively. | ||
==Further Information== | ==Further Information== |