Editing Prepare-and-Send Verifiable Universal Blind Quantum Computation (section)

==Properties==
* The client is partially quantum and should be able to prepare the given initial quantum states.
* Security: This protocol is secure against malicious adversary setting and also detects a cheating server.
* 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 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.
* The trap qubit in the tape format of the cylinder brickwork state remains disentangled from the rest of the graph.
* Every qubit of the underlying graph could potentially be an isolated trap qubit.