Open main menu
Home
Random
Log in
Settings
About Quantum Protocol Zoo
Disclaimers
Quantum Protocol Zoo
Search
Editing
Measurement-Only Universal Blind Quantum Computation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Properties== *Universality - Any model of quantum computation based on MBQC can be changed made blind using these protocols, thus, the universality of the protocol is implied by the universality of the resource state used. *Correctness - Correctness for both protocols is implied from MBQC implementing the quantum computation successfully. *Blindness - Blindness for protocol 1a is implied by no-signalling theorem as Client does not send any information to Server by measuring her states. *Security of protocol 1a is device independent i.e. Client does not need to trust her measurement device in order to guarantee privacy. *Protocol 1a can cope with Client’s measurement device inefficiency. *Protocol 1b can cope with high channel losses but is no longer a no-signalling protocol. In order to make it no-signalling Client needs to discard measurement device after one use or use a random number generator to indicate if the particle was received or not. *Both protocols follow the following definition of blindness: A protocol is blind if, **The conditional probability distribution of Alice’s computational angles, given all the classical information Bob can obtain during the protocol, and given the measurement results of any POVMs which Bob may perform on his system at any stage of the protocol, is equal to the a priori probability distribution of Alice’s computational angles, and **The conditional probability distribution of the final output of Alice’s algorithm, given all the classical information Bob can obtain during the protocol, and given the measurement results of any POVMs which Bob may perform on his system at any stage of the protocol, is equal to the a priori probability distribution of the final output of Alice’s algorithm.
Summary:
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Quantum Protocol Zoo:Copyrights
for details).
Do not submit copyrighted work without permission!
To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:
Cancel
Editing help
(opens in new window)