Write, autoreview, editor, reviewer
3,129
edits
Weak String Erasure: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
| 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. | ||
'''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:''' 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]] | ||
[[: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| | [[: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)]] | ||
==Assumptions== | ==Assumptions== | ||
*We assume that the adversary has access to a quantum memory that is bounded in size, say the memory is of at most <math>log2(d)</math> qubits. See Bounded/Noisy Storage Model in [[Weak String Erasure#References| | *We assume that the adversary has access to a quantum memory that is bounded in size, say the memory is of at most <math>log2(d)</math> qubits. See Bounded/Noisy Storage Model in [[Weak String Erasure#References| | ||
( | (4)/(3)]] | ||
* The transmission of qubit is noiseless/lossless. | * The transmission of qubit is noiseless/lossless. | ||
* The preparation devices (for quantum state) are assumed to be fully characterized and trusted. We assume the same for the measurement devices. | * The preparation devices (for quantum state) are assumed to be fully characterized and trusted. We assume the same for the measurement devices. | ||