Editing Verification of Universal Quantum Computation
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 3: | Line 3: | ||
'''Tags:''' [[:Category: Quantum Functionality|Quantum Functionality]], [[Category: Quantum Functionality]] [[:Category:Universal Task|Universal Task]][[Category:Universal Task]], [[Classical Verification of Universal Quantum Computation]], [[Verification of Sub-Universal Quantum Computation]], [[Verification of NP-complete problems]] | '''Tags:''' [[:Category: Quantum Functionality|Quantum Functionality]], [[Category: Quantum Functionality]] [[:Category:Universal Task|Universal Task]][[Category:Universal Task]], [[Classical Verification of Universal Quantum Computation]], [[Verification of Sub-Universal Quantum Computation]], [[Verification of NP-complete problems]] | ||
==Use Case== | |||
* Quantum task | |||
* Classical analogue: [[Classical Verification of Quantum Computation]] | |||
* Best Implementation specifications | |||
==Protocols== | ==Protocols== | ||
#Single-prover prepare-and-send: Verifier can only prepare and send quantum states to delegate a BQP computation to the prover | #Single-prover prepare-and-send: Verifier can only prepare and send quantum states to delegate a BQP computation to the prover |