Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
==Protocols== | ==Protocols== | ||
* [[Secure Client- Server Delegated Quantum Computation#Properties|Delegated Quantum Computation]] employing 'blindness' | |||
#[[Prepare-and-Send Verifiable Universal Blind Quantum Computation|Single-prover prepare-and-send]] | |||
#[[Measurement-Only Verifiable Universal Blind Quantum Computation|Single-prover receive-and-measure]] | |||
#Multi-prover entanglement-based | |||
==Properties== | ==Properties== | ||
Revision as of 05:16, 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
- Delegated Quantum Computation employing 'blindness'
- Single-prover prepare-and-send
- Single-prover receive-and-measure
- Multi-prover entanglement-based
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