Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions

Classical Fully Homomorphic Encryption for Quantum Circuits (edit)

363 bytes added , 26 November 2018

m

Write, autoreview, editor, reviewer

3,125

edits

Revision as of 02:06, 26 November 2018 (edit) Shraddha (talk \| contribs) m (→‎Stage 2 Server’s Computation) ← Older edit		Revision as of 02:09, 26 November 2018 (edit) (undo) Shraddha (talk \| contribs) m (→‎Discussion) Newer edit →
Line 103:		Line 103:

	==Discussion==		==Discussion==
	This protocol is first and only protocol currently, to use a classical functionality to solve a quantum task. It provides computationally security. ~~A verifiable variant~~ 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.