Verification of Universal Quantum Computation: Difference between revisions

Quantum Computers perform task which are intractable for classical computers. The basic question here would be, "How should one verify the result of a quantum computer? This task is known as quantum verification or verification of quantum computation. [https://complexityzoo.uwaterloo.ca/Complexity_Zoo BQP] is the class of problems which can be efficiently solved by quantum computers, [https://complexityzoo.uwaterloo.ca/Complexity_Zoo BPP] is the class of problems which can be efficiently solved by classical computers and, MA (Merlin-Arthur) is the class of problems whose solutions can be verified when given a proof setting called [[witness]]