Write, autoreview, editor, reviewer
3,129
edits
Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions
Classical Fully Homomorphic Encryption for Quantum Circuits (edit)
Revision as of 16:32, 17 April 2019
, 17 April 2019→Discussion
| Line 103: | Line 103: | ||
# She then uses the decrypted Pauli corrections to get the correct output <math>l\oplus x</math>.</br> | # She then uses the decrypted Pauli corrections to get the correct output <math>l\oplus x</math>.</br> | ||
== | ==Further Information== | ||
In case of Quantum Input, the client additionally sends quantum one tie padded input state. In case of quantum output the Server instead of classical outcome sends the final quantum one time padded output state (operated by the required circuit). Client gets the output by using the updated encryption sent by the server to perform Pauli corrections on the output state. This protocol is first and only protocol currently, to use a classical functionality to solve a quantum task. It provides computationally security. Verification of this protocol is still an open question. | In case of Quantum Input, the client additionally sends quantum one tie padded input state. In case of quantum output the Server instead of classical outcome sends the final quantum one time padded output state (operated by the required circuit). Client gets the output by using the updated encryption sent by the server to perform Pauli corrections on the output state. This protocol is first and only protocol currently, to use a classical functionality to solve a quantum task. It provides computationally security. Verification of this protocol is still an open question. | ||
<div style='text-align: right;'>''*contributed by Shraddha Singh''</div> | |||