Measurement-Only Universal Blind Quantum Computation: Difference between revisions

Jump to navigation Jump to search

Measurement-Only Universal Blind Quantum Computation (edit)

Revision as of 09:54, 14 May 2019

91 bytes removed ,  14 May 2019
no edit summary
No edit summary
Line 2: Line 2:
'''Tags:''' [[Category: Two Party Protocols]] [[:Category: Two Party Protocols|Two Party]], [[Category: Universal Task]][[:Category: Universal Task|Universal Task]], [[Category: Quantum Functionality]] [[:Category: Quantum Functionality|Quantum Functionality]], Quantum Online communication, Classical Online communication, [[Supplementary Information#Measurement Based Quantum Computation|Measurement Based Quantum Computation (MBQC)]],
'''Tags:''' [[Category: Two Party Protocols]] [[:Category: Two Party Protocols|Two Party]], [[Category: Universal Task]][[:Category: Universal Task|Universal Task]], [[Category: Quantum Functionality]] [[:Category: Quantum Functionality|Quantum Functionality]], Quantum Online communication, Classical Online communication, [[Supplementary Information#Measurement Based Quantum Computation|Measurement Based Quantum Computation (MBQC)]],
[[Prepare and Send-Universal Blind Quantum Computation|Prepare and Send-UBQC]], [[Measurement-Only Verifiable Universal Blind Quantum Computation|Measurement Only Verifiable UBQC]], [[Quantum Key Distribution|QKD]], [[Quantum Teleportation]].
[[Prepare and Send-Universal Blind Quantum Computation|Prepare and Send-UBQC]], [[Measurement-Only Verifiable Universal Blind Quantum Computation|Measurement Only Verifiable UBQC]], [[Quantum Key Distribution|QKD]], [[Quantum Teleportation]].
==Assumptions==
* This protocol is secure against honest but curious adversary setting
*Client should have the classical means to compute the measurement pattern
*Client should have measurement devices.
*Protocol 1a assumes that quantum channel is not too lossy.
*No unwanted leakage from Client is assumed, i.e. Server cannot bug Client’s laboratory, a fundamental assumption in QKD.


==Outline==
==Outline==
Line 13: Line 20:


==Properties==
==Properties==
===Adversarial Assumption===
* This protocol is secure against honest but curious adversary setting
===Setup Assumptions===
*Client should have the classical means to compute the measurement pattern
*Client should have measurement devices.
*Protocol 1a assumes that quantum channel is not too lossy.
*No unwanted leakage from Client is assumed, i.e. Server cannot bug Client’s laboratory, a fundamental assumption in QKD.
===Parameters===
*(m,n,o) dimensions of cluster state. It could be 2D or 3D.
===Security Claim/ Theorems===
*Universality Any model of quantum computation based on MBQC can be changed made blind using these protocols, thus, universality of protocol is implied by universality of the resource state used.
*Universality Any model of quantum computation based on MBQC can be changed made blind using these protocols, thus, universality of protocol is implied by universality of the resource state used.
*CorrectnessCorrectness for both protocols is implied from MBQC implementing the quantum computation successfully.
*CorrectnessCorrectness for both protocols is implied from MBQC implementing the quantum computation successfully.
Line 32: Line 29:
**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==  
*Unless given specific mention in [.], following steps apply to both protcols
*Unless given specific mention in [.], following steps apply to both protcols
Line 53: Line 53:
*Interaction and Computation steps are repeated until all the qubits of resource state are measured.
*Interaction and Computation steps are repeated until all the qubits of resource state are measured.


==Further Information==
<div style='text-align: right;'>''*contributed by Shraddha Singh''</div>
<div style='text-align: right;'>''*contributed by Shraddha Singh''</div>
Shraddha
Write, autoreview, editor, reviewer
3,129

edits

Retrieved from "https://wiki.veriqloud.fr/index.php?title=Special:MobileDiff/2554"

Navigation menu