Verification of Universal Quantum Computation: Difference between revisions

Verification of Universal Quantum Computation (edit)

399 bytes removed , 11 June 2019

Write, autoreview, editor, reviewer

3,125

edits

@@ Line 1: / Line 1: @@
 ==Functionality==
-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]]
+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. '''Tags:'''  [[:Category: Quantum Functionality|Quantum Functionality]], [[Category: Quantum Functionality]] [[:Category:Universal Task|Universal Task]][[Category:Universal Task]]
-'''Tags:'''  [[:Category: Quantum Functionality|Quantum Functionality]], [[Category: Quantum Functionality]] [[:Category:Universal Task|Universal Task]][[Category:Universal Task]]
 ==Use Case==