Verification of Universal Quantum Computation: Difference between revisions

Verification of Universal Quantum Computation (edit)

747 bytes added , 17 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<br/>
+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:B#bqp BQP] is the class of problems that can be solved by a quantum computer and [https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bpp BPP] is the class of problems that can be solved by a classical computer. BPP is contained in BQP and hence, there are problems a quantum computer would solve that are intractable for a classical computer, to put it simply. Thus, if in future, an untrusted company claims to have built a quantum computer, how can the consumer be sure of the [correctness] of the results when he/she (the consumer) cannot compare the results predicted by the proposed quantum computer? This problem is addressed by the functionality, 'verification of quantum computers'.   <br/>
 '''Tags:'''  [[:Category: Quantum Functionality|Quantum Functionality]], [[Category: Quantum Functionality]] [[:Category:Universal Task|Universal Task]][[Category:Universal Task]]