Weak String Erasure: Difference between revisions

Weak String Erasure (edit)

Revision as of 14:30, 18 April 2019

165 bytes removed , 18 April 2019

no edit summary

Shraddha

Write, autoreview, editor, reviewer

3,125

edits

@@ Line 1: / Line 1: @@
-Weak String Erasure (WSE) is a two-party functionality, say between Alice and Bob, that allows Alice to send a random bit string to Bob, in such a way that Alice is guarantied that a fraction (ideally half) of the bits are lost during the transmission. However, Alice should not know which bits Bob has received, and which bits have been lost.
+Weak String Erasure (WSE) is a two-party functionality, say between Alice and Bob, that allows Alice to send a random bit string to Bob, in such a way that Alice is guarantied that a fraction (ideally half) of the bits are lost during the transmission. However, Alice should not know which bits Bob has received, and which bits have been lost.</br></br>
-'''Tags:''' Universal Cloning, optimal cloning, N to M cloning, symmetric cloning,  [[Asymmetric Universal 1-2 Cloning|Asymmetric Cloning]],  [[Quantum Cloning]], copying quantum states, [[:Category: Quantum Functionality|Quantum Functionality]][[Category: Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], [[Probabilistic Cloning]]
+'''Tags:''' [[:Category: Quantum Functionality|Quantum Functionality]][[Category: Quantum Functionality]], [[:Category:Specific Task|Specific Task]][[Category:Specific Task]], [[Probabilistic Cloning]]
 [[:Category: Two Party Protocols|Two Party Protocols]] [[Category: Two Party Protocols]], weak string erasure, [[Category: Building Blocks]][[:Category: Building Blocks|Building Blocks]], Bounded Storage Model[[Weak String Erasure#Further Information| (4)]]