Write, autoreview, editor, reviewer
3,125
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 21:24, 11 June 2019
, 11 June 2019→Outline
m (→Pseudo-Code) |
|||
| Line 11: | Line 11: | ||
This protocol is a modified version of [[Prepare-and-Send Universal Blind Quantum Computation]], which is based on MBQC. An adversarial server is taken into consideration here and any computational deviations are detected with a high probability. This is achieved by insertion of randomly prepared and blindly isolated single qubits in the computation, which act as traps (trap qubits), hence assisting the client in verification. | This protocol is a modified version of [[Prepare-and-Send Universal Blind Quantum Computation]], which is based on MBQC. An adversarial server is taken into consideration here and any computational deviations are detected with a high probability. This is achieved by insertion of randomly prepared and blindly isolated single qubits in the computation, which act as traps (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. | ||