Weak String Erasure: Difference between revisions

Weak String Erasure (edit)

1,120 bytes added , 18 April 2019

Write, autoreview, editor, reviewer

3,125

edits

@@ Line 49: / Line 49: @@
 ==Pseudo Code==
+'''Inputs:''' n</br>
+'''Output:''' <math>X_1^n</math>, <math>\mathcal{I}</math>, <math>X_{\mathcal{I}}</math>.
+# Alice and Bob agree on a time <math>\Delta t</math>.
+# For <math>i</math> in <math>[n]</math> do:
+## Alice chooses uniformly at random <math>\Theta_i \in\{0,1\}</math> and <math>X_i \in \{0,1\}</math>.
+## Alice prepares the state <math>H^{\Theta_i} \ket{X_i}</math>. She sends it over to Bob.
+## Bob announces receiving a state.
+## Bob chooses uniformly at random <math>\hat \Theta_i \in\{0,1\}</math>.
+## Bob measures the incoming qubit in the standard basis if <math>\hat \Theta_i=0</math> and in the Hadamard basis otherwise. He gets outcome <math>\hat X_i</math></br>
+At this stage Alice has string <math>X_1^n</math> and <math>\Theta_1^n</math>, and Bob has strings <math>\hat X_1^n</math> and <math>\hat \Theta_1^n</math>.
+# Alice and Bob wait for time <math>\Delta t</math>.
+# Alice sends <math>\Theta_1^n</math> to Bob.
+# Bob computes <math>\mathcal{I}:=\{i \in [n] : \Theta_i = \hat \Theta_i\}</math>.
+# Bob erases all bits from <math>\hat X_1^n</math> with index <math>i\notin \mathcal{I}</math>.
 ==Further Information==