Write, autoreview, editor, reviewer
3,129
edits
Verification of Universal Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Verification of Universal Quantum Computation (edit)
Revision as of 23:17, 11 June 2019
, 11 June 2019→Protocols
No edit summary |
|||
| Line 5: | Line 5: | ||
==Protocols== | ==Protocols== | ||
*'''Verification for universal protocols''' | *'''Verification for universal protocols''' | ||
#Single-prover prepare-and-send: Verifier can only prepare and send states | #Single-prover prepare-and-send: Verifier can only prepare and send quantum states | ||
##Quantum-authentication based verification | ##Quantum-authentication based verification | ||
##Trap-based based verification: uses blind delegated quantum computation | ##Trap-based based verification: uses blind delegated quantum computation | ||
##Verification based on repeated runs | ##Verification based on repeated runs | ||
#Single-prover receive-and-measure: Verifier can only receive and measure states | #Single-prover receive-and-measure: Verifier can only receive and measure quantum states | ||
##Measurement only verification: uses blind delegated quantum computation | ##Measurement only verification: uses blind delegated quantum computation | ||
##Post-hoc verification: Non-interactive (requires only single round of back and forth communication) | ##Post-hoc verification: Non-interactive (requires only single round of back and forth communication) | ||
#Multi-prover entanglement-based: | #Multi-prover entanglement-based: Verifier is completely classical and the provers are entangled | ||
##Verification based on CHSH rigidity | ##Verification based on CHSH rigidity | ||
##Verification based on self-testing graphs | ##Verification based on self-testing graphs | ||