Write, autoreview, editor, reviewer
3,125
edits
Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Verification of Universal Quantum Computation (edit)
Revision as of 21:55, 17 June 2019
, 17 June 2019→Properties
| Line 17: | Line 17: | ||
==Properties== | ==Properties== | ||
[[File:Suspected relationship between BQP and MA.png|right|thumb|1000px|Figure 1: One Bit Teleportation]] | |||
*'''[https://complexityzoo.uwaterloo.ca/Complexity_Zoo Complexity Classes]''' | *'''[https://complexityzoo.uwaterloo.ca/Complexity_Zoo Complexity Classes]''' | ||
#'''BQP''' is the class of problems which can be efficiently solved by quantum computers | #'''BQP''' is the class of problems which can be efficiently solved by quantum computers | ||
| Line 23: | Line 24: | ||
#'''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== | ||