Write, autoreview, editor, reviewer
3,129
edits
Measurement-Only Verifiable Universal Blind Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Measurement-Only Verifiable Universal Blind Quantum Computation (edit)
Revision as of 19:58, 16 June 2019
, 16 June 2019no edit summary
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
The [https://arxiv.org/abs/1208.1495 example protocol] achieves the functionality of [[Secure Client- Server Delegated Computation|Delegated Computation]] which is the task of assigning quantum computation to an untrusted device while maintaining privacy of the computation. This protocol allows the client to verify the correctness of the blind delegated quantum computing with high probability. Here, the server prepares and sends a universal resource quantum state to the client, and the client | The [https://arxiv.org/abs/1208.1495 example protocol] achieves the functionality of [[Secure Verifiable Client-Server Delegated Quantum Computation|Secure Verifiable Delegated Quantum Computation]] which is the task of assigning quantum computation to an untrusted device while maintaining privacy of the computation. This protocol allows the client to verify the correctness of the blind delegated quantum computing with high probability. Here, the server prepares and sends a universal resource quantum state to the client, and the client performs measurements on the resource state to carry out the quantum computation. Using this method, it is easy to verify with high probability whether the server is honest. The computation here remains perfectly private from the server and this protocol can implement any quantum computation. | ||
</br> | </br> | ||
| Line 25: | Line 25: | ||
* <math>G_{m\times n}</math>: Resource state | * <math>G_{m\times n}</math>: Resource state | ||
* <math>m\times n</math>: Resource state size | * <math>m\times n</math>: Resource state size | ||
* <math>|\psi\rangle_P</math>: <math>P(|R\rangle\otimes |+\rangle^{\otimes \frac{N}{3}} \otimes |0\rangle^{\otimes \frac{N}{3}})</math>, this is the | * <math>|\psi\rangle_P</math>: <math>P(|R\rangle\otimes |+\rangle^{\otimes \frac{N}{3}} \otimes |0\rangle^{\otimes \frac{N}{3}})</math>, this is the <math>n</math>-qubit state left with the server which contains the trap qubits (<math>|0\rangle</math>, <math>|+\rangle</math>) and resource state. | ||
* <math>|R\rangle</math>: <math>\frac{n}{3}</math>-qubit resource state | * <math>|R\rangle</math>: <math>\frac{n}{3}</math>-qubit resource state | ||
* <math>P</math>: <math>n</math>-qubit permutation, which keeps the order of qubits in <math>|R\rangle</math> | * <math>P</math>: <math>n</math>-qubit permutation, which keeps the order of qubits in <math>|R\rangle</math> | ||
| Line 39: | Line 39: | ||
==Properties== | ==Properties== | ||
* This protocol | * This protocol detects a cheating server with high probability. | ||
* Universality: This protocol is universal in nature. The resource state used is universal and thus can implement any quantum computation. | * Universality: This protocol is universal in nature. The resource state used is universal and thus can implement any quantum computation. | ||
* Correctness: The correctness of the protocol is implied | * Correctness: The correctness of the protocol is implied from the measurement based quantum computing used. | ||
* Blindness: As there exists no quantum channel from the client to the server, the no- | * Blindness: As there exists no quantum channel from the client to the server, the [[no-signaling theorem]] ensures that no information about the states is sent to the server using just the measurements. | ||
* The security of this protocol is device independent. | * The security of this protocol is device independent, which means client does not need to trust their measurement device in order to guarantee the security. | ||
* One advantage of this protocol is that no random number generators are required. | |||
==Pseudocode== | ==Pseudocode== | ||
'''Stage 1''': Server's preparation </br> | '''Stage 1''': Server's preparation </br> | ||
'''Input''': Dimensions of the resource state. | '''Input''': Dimensions of the resource state.</br> | ||
'''Output''': Client: receives all qubits | '''Output''': Client: receives all qubits | ||
* Server creates <math>G_{m\times n}</math> and sends each qubit to Client | * Server creates <math>G_{m\times n}</math> and sends each qubit to Client | ||