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 15:45, 15 June 2019
, 15 June 2019→Properties
| Line 63: | Line 63: | ||
* The client is partially quantum and should be able to prepare the given initial quantum states. | * The client is partially quantum and should be able to prepare the given initial quantum states. | ||
* This protocol is secure against malicious adversary setting and also detects a cheating server. | * This protocol is secure against malicious adversary setting and also detects a cheating server. | ||
* This protocol is universal in nature. The universality of the cylinder brickwork state guarantees that the server’s knowledge about the graph does not reveal anything about the underlying computation. | * Universality: This protocol is universal in nature. The universality of the cylinder brickwork state guarantees that the server’s knowledge about the graph does not reveal anything about the underlying computation. | ||
* Correctness If Client and Server follow the protocol as described above, the outcome will be correct. | |||
* Blindness: This protocol is blind in nature, only revealing <math>n</math> and <math>m</math>. | |||
* This protocol requires no quantum memory for the client. | * This protocol requires no quantum memory for the client. | ||
* This protocol is <math>1-\frac{1}{2m}</math> verifiable in quantum output case. | * This protocol is <math>1-\frac{1}{2m}</math> verifiable in quantum output case. | ||
* This protocol is <math>1-\frac{1}{m}</math> verifiable in classical output case. | * This protocol is <math>1-\frac{1}{m}</math> verifiable in classical output case. | ||