Verification of Universal Quantum Computation
Jump to navigation
Jump to search
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