Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
==Functionality== | ==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. | 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]] | ||
'''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]] | ||
Revision as of 05:44, 11 June 2019
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. BQP is the class of problems which can be efficiently solved by quantum computers, 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 Tags: Quantum Functionality, Universal Task
Use Case
- Quantum task
- Classical analogue: Classical Verification of Quantum Computation
- Best Implementation specifications
Protocols
Properties
- Correctness
- Soundness
Further Information
- Review Papers
References
contributed by Shraddha Singh