Write, autoreview, editor, reviewer
3,129
edits
Prepare-and-Send Verifiable Universal Blind Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Prepare-and-Send Verifiable Universal Blind Quantum Computation (edit)
Revision as of 05:53, 14 June 2019
, 14 June 2019no edit summary
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
The [https://arxiv.org/abs/1203.5217 example protocol] achieves the functionality of [[Secure Client-Server Delegated Computation|Delegated Computation]] which is | The [https://arxiv.org/abs/1203.5217 example protocol] achieves the functionality of [[Secure Client-Server Delegated Computation|Delegated Computation]] which is a take which enables a client with limited quantum technology to delegate a computation to an untrusted but powerful quantum server in such a manner, where the privacy of the computation is maintained. This protocol introduces verifiability as a property and allows the client to verify the correctness of [[Prepare-and-Send Universal Blind Quantum Computation]]. The client has an ability to verify whether the server has followed the instructions of the protocol and also can check if the server tried to deviate from the protocol which would have resulted in an incorrect output state. | ||
'''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 Offline communication, Classical Online communication, [[Supplementary Information#Measurement Based Quantum Computation|Measurement Based Quantum Computation (MBQC)]], [[Measurement-Only Universal Blind Quantum Computation|Measurement Only UBQC]], [[Pseudo-Secret Random Qubit Generator (PSQRG)]], [[Prepare-and-Send Universal Blind Quantum Computation]]. | '''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 Offline communication, Classical Online communication, [[Supplementary Information#Measurement Based Quantum Computation|Measurement Based Quantum Computation (MBQC)]], [[Measurement-Only Universal Blind Quantum Computation|Measurement Only UBQC]], [[Pseudo-Secret Random Qubit Generator (PSQRG)]], [[Prepare-and-Send Universal Blind Quantum Computation]]. | ||
| Line 9: | Line 9: | ||
==Outline== | ==Outline== | ||
This protocol is a modified version of [[Prepare-and-Send Universal Blind Quantum Computation]], which is based on MBQC. | This protocol is a modified version of [[Prepare-and-Send Universal Blind Quantum Computation]], which is based on [[MBQC]]. Here a powerful adversarial server is delegated with quantum computation while maintaining the privacy. Any computational deviations by this server are detected by high probability. This is achieved by insertion of randomly prepared and blindly isolated single qubits in the computation, which act as a trap (trap qubits), hence assisting the client in verification. | ||
<br></br> | <br></br> | ||
The original brickwork state used in [[Prepare-and-Send Universal Blind Quantum Computation]] is modified to a [[cylinder brickwork state]] which allows the client to embed a trap qubit surrounded by multiple dummy qubits without disrupting the computation. This state is universal and maintains the privacy of the client's preparation. | The [[original brickwork state]] used in [[Prepare-and-Send Universal Blind Quantum Computation]] is modified to a [[cylinder brickwork state]] which allows the client to embed a trap qubit surrounded by multiple dummy qubits without disrupting the computation. This state is universal and maintains the privacy of the client's preparation. | ||
<br></br> | <br></br> | ||
The dummy qubits here do not take part in the actual computation as they are disentangled from the rest of the qubits of the graph state. Hence by adding them to the neighbouring nodes of the trap qubits, they are blindly isolated and thus do not interfere with the actual computation. The dummy qubits are added next to the trap qubit in a tape format. | The dummy qubits here do not take part in the actual computation as they are disentangled from the rest of the qubits of the graph state. Hence by adding them to the neighbouring nodes of the trap qubits, they are blindly isolated and thus do not interfere with the actual computation. The dummy qubits are added next to the trap qubit in a tape format. | ||