14
edits
| Line 28: | Line 28: | ||
==Protocol Description== | ==Protocol Description== | ||
<!-- Mathematical step-wise protocol algorithm helpful to write a subroutine. --> | <!-- Mathematical step-wise protocol algorithm helpful to write a subroutine. --> | ||
; Collision detection | |||
: Nodes run the classical collision detection protocol [9] to determine a single sender <math>S</math>. All nodes input 1 if they do wish to be the sender and 0 otherwise. If a single node wants to be the sender, continue. | |||
; Receiver notification | |||
: Nodes run the classical receiver notification protocol [9], where the receiver <math>R</math> is notified of her role. | |||
; State distribution | |||
: A trusted source distributes the <math>N</math>-partite <math>W</math> state. | |||
; Measurement | |||
: All nodes except for <math>S</math> and <math>R</math> measure in the {|0〉,|1〉} basis. | |||
; Anonymous announcement of outcomes | |||
: Nodes use the classical veto protocol [9] which outputs 0 if all the <math>N-2</math> measurement outcomes are 0, and 1 otherwise. If the output is 0 then anonymous entanglement is established, else abort. | |||
; Teleportation | |||
: Sender <math>S</math> teleports the message state |ψ〉 to the receiver <math>R</math>. Classical messagemassociated with teleportationis sent anonymously. The communication is carried outusing the classical logical OR protocol [9] which computes <math>m \oplus rand</math>, where <math>rand</math> is a random 2-bit string input by the receiver <math>R</math>. | |||
==Further Information== | ==Further Information== | ||