Open main menu
Home
Random
Log in
Settings
About Quantum Protocol Zoo
Disclaimers
Quantum Protocol Zoo
Search
Editing
Secure Multiparty Delegated Classical Computation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Main Routine=== # The server generates an ancilla bit <math>|0\rangle</math> and sends it to client <math>C_1</math>. # For <math>i = 1</math> to <math>n-1</math>: ## <math>C_i</math> applies <math>V^{r_i}U^{x_i}</math> on the received qubit and sends it to client <math>C_{i+1}</math>. # <math>C_n</math> applies <math>V^{r_n}U^{x_n}</math> on the received qubit. # Any client then applies <math>(U^\dagger)^{\oplus_i x_i}</math>. <br/> <math>(U^\dagger)^{\oplus_i x_i} \underbrace{V^{r_n}U^{x_n}}_{\mathcal{C}_n} ... \underbrace{V^{r_2}U^{x_2}}_{\mathcal{C}_2} \underbrace{V^{r_1}U^{x_1}}_{\mathcal{C}_1} |0\rangle= |r \oplus f\rangle </math> # The resulting state is now sent to the server who measures the outcome <math>r \oplus f</math> and announces it. # The clients locally compute XOR of the random bits of other clients. # They then perform the operation <math>f = r \oplus (r \oplus f)</math> to get the result.
Summary:
Please note that all contributions to Quantum Protocol Zoo may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Quantum Protocol Zoo:Copyrights
for details).
Do not submit copyrighted work without permission!
To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:
Cancel
Editing help
(opens in new window)
Close
Loading editor…