Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
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]] | 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]] | ||
==Protocols== | ==Protocols== | ||
Revision as of 06:07, 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. Tags: Quantum Functionality, Universal Task
Protocols
Properties
- 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.
- MA (Merlin-Arthur) is the class of problems whose solutions can be verified when given a proof setting called witness.
- 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).
- Correctness
- Soundness
Further Information
- Review Papers
References
contributed by Shraddha Singh