Measurement-Only Universal Blind Quantum Computation: Difference between revisions

no edit summary
mNo edit summary
No edit summary
Line 19: Line 19:
*''Server’s preparation'': This step remains the same as protocol 1a
*''Server’s preparation'': This step remains the same as protocol 1a
*'' Interaction and Client’s Computation'': Server prepares a Bell pair and sends one half of the Bell Pair to the Client. The Client informs the Server if she receives it or else if she doesn’t, Client asks Server to send it again. The client measures her share of entangled pair in a certain measurement basis depending on her MBQC pattern. The Server then entangles his share of Bell pair and qubit of the resource state using CZ gate which transfers the gate/ measurement operated by Client to the resource qubit. Then he measures the resource qubit in X basis and communicates his classical measurement outcome to the Client. Client records it and uses it to compute her final outcome.
*'' Interaction and Client’s Computation'': Server prepares a Bell pair and sends one half of the Bell Pair to the Client. The Client informs the Server if she receives it or else if she doesn’t, Client asks Server to send it again. The client measures her share of entangled pair in a certain measurement basis depending on her MBQC pattern. The Server then entangles his share of Bell pair and qubit of the resource state using CZ gate which transfers the gate/ measurement operated by Client to the resource qubit. Then he measures the resource qubit in X basis and communicates his classical measurement outcome to the Client. Client records it and uses it to compute her final outcome.
==Notations==
*(m,n,o) dimensions of cluster state. It could be 2D or 3D.
==Requirements==
[[File:Measurement-Only Universal Blind Quantum Computation.png|center|Measurement-Only Universal Blind Quantum Computation]]


==Properties==
==Properties==
Line 30: Line 37:
**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 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.
**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.
==Notations==
*(m,n,o) dimensions of cluster state. It could be 2D or 3D.


==Pseudocode==  
==Pseudocode==  
Write, autoreview, editor, reviewer
3,129

edits